A10054 | Inventory
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Companies always have a lot of equipment, furniture and other things. All of them should be tracked. To do this, there is an inventory number assigned with each item. It is much easier to create a database by using those numbers and keep the track of everything.
During an audit, you were surprised to find out that the items are not numbered sequentially, and some items even share the same inventory number! There is an urgent need to fix it. You have chosen to make the numbers of the items sequential, starting with $1$ . Changing a number is quite a time-consuming process, and you would like to make maximum use of the current numbering.
You have been given information on current inventory numbers for $n$ items in the company. Renumber items so that their inventory numbers form a permutation of numbers from $1$ to $n$ by changing the number of as few items as possible. Let us remind you that a set of $n$ numbers forms a permutation if all the numbers are in the range from $1$ to $n$ , and no two numbers are equal.
During an audit, you were surprised to find out that the items are not numbered sequentially, and some items even share the same inventory number! There is an urgent need to fix it. You have chosen to make the numbers of the items sequential, starting with $1$ . Changing a number is quite a time-consuming process, and you would like to make maximum use of the current numbering.
You have been given information on current inventory numbers for $n$ items in the company. Renumber items so that their inventory numbers form a permutation of numbers from $1$ to $n$ by changing the number of as few items as possible. Let us remind you that a set of $n$ numbers forms a permutation if all the numbers are in the range from $1$ to $n$ , and no two numbers are equal.
输入格式
The first line contains a single integer $n$ — the number of items ( $1<=n<=10^{5}$ ).
The second line contains $n$ numbers $a_{1},a_{2},...,a_{n}$ ( $1<=a_{i}<=10^{5}$ ) — the initial inventory numbers of the items.
The second line contains $n$ numbers $a_{1},a_{2},...,a_{n}$ ( $1<=a_{i}<=10^{5}$ ) — the initial inventory numbers of the items.
输出格式
Print $n$ numbers — the final inventory numbers of the items in the order they occur in the input. If there are multiple possible answers, you may print any of them.
输入输出样例
输入 #1
3 1 3 2
输出 #1
1 3 2
输入 #2
4 2 2 3 3
输出 #2
2 1 3 4
输入 #3
1 2
输出 #3
1
In the first test the numeration is already a permutation, so there is no need to change anything.
In the second test there are two pairs of equal numbers, in each pair you need to replace one number.
In the third test you need to replace $2$ by $1$ , as the numbering should start from one.
In the second test there are two pairs of equal numbers, in each pair you need to replace one number.
In the third test you need to replace $2$ by $1$ , as the numbering should start from one.
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted