Codeforces Round #315 (Div. 2)569B Inventory(队列)

最新推荐文章于 2017-12-28 18:40:00 发布

原创最新推荐文章于 2017-12-28 18:40:00 发布 · 1.2k 阅读

0 ·

CC 4.0 BY-SA版权

Codeforces 同时被 2 个专栏收录

91 篇文章

订阅专栏

队列

4 篇文章

订阅专栏

解决物品库存编号混乱的问题，通过重新分配编号实现最小化更改次数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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 ofn numbers forms a permutation if all the numbers are in the range from 1 to n, and no two numbers are equal.

Input

The first line contains a single integer n — the number of items (1 ≤ n ≤ 105).

The second line contains n numbers a1, a2, ..., an (1 ≤ ai ≤ 105) — the initial inventory numbers of the items.

Output

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.

Sample test(s)

input
3
1 3 2

output
1 3 2 

input
4
2 2 3 3

output
2 1 3 4 

input
1
2

output
1 

Note

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.

给你n个数，有可能其中有大于n的，有重复的，让你输出1~n的排列，并且尽可能减少改变次数。

定义两个数组a, b，一个队列q。a数组用来存储输入的数，b数组用来存储个数。如果个数大于1或者这个数比n还大，就push i到队列

里面，而后枚举b数组。

AC代码：

#include "iostream"
#include "cstdio"
#include "cstring"
#include "algorithm"
#include "queue"
using namespace std;
const int MAXN = 1e5 + 5;
int n, a[MAXN], b[MAXN];
queue<int> q;
int main(int argc, char const *argv[])
{
	cin >> n;
	for(int i = 0; i < n; ++i) {
		cin >> a[i];
		b[a[i]]++;
		if(b[a[i]] > 1 || a[i] > n) q.push(i);
	}
	for(int i = 1; i <= n; ++i) {
		if(!b[i]) {
			int x = q.front();
			a[x] = i;
			q.pop();
		}
		if(q.empty()) break;
	}
	for(int i = 0; i < n; ++i) 
		cout << a[i] << " ";
	cout << endl;
	return 0;
}