codeforces 569B B. Inventory(水题)
2016-04-12 21:22
741 查看
题目链接:
B. Inventory
time limit per test
1second
memory limit per test
256 megabytes
input
standard input
output
standard output
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 1to 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 1to n, and no two numbers are equal.
Input
The first line contains a single integer n — the number of items (1 ≤ n ≤ 10^5).
The second line contains n numbers a1, a2, ..., an (1 ≤ ai ≤ 10^5) — 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.
Examples
input
output
input
output
input
output
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个数变成1到n这n个数输出,就是把原来重复的和大于n的去掉,补上1到n中没有出现过的;
思路:
水题,直接不想说;
AC代码:
B. Inventory
time limit per test
1second
memory limit per test
256 megabytes
input
standard input
output
standard output
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 1to 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 1to n, and no two numbers are equal.
Input
The first line contains a single integer n — the number of items (1 ≤ n ≤ 10^5).
The second line contains n numbers a1, a2, ..., an (1 ≤ ai ≤ 10^5) — 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.
Examples
input
3 13 2
output
13 2
input
4 2 2 3 3
output
2 13 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个数变成1到n这n个数输出,就是把原来重复的和大于n的去掉,补上1到n中没有出现过的;
思路:
水题,直接不想说;
AC代码:
/*2014300227 569B - 26 GNU C++11 Accepted 46 ms 1196 KB*/
#include <bits/stdc++.h>
using namespace std;
const int N=1e5+4;
typedef long long ll;
const double PI=acos(-1.0);
int n,a
,vis
;
queue<int>qu;
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
vis[a[i]]++;
}
for(int i=1;i<=n;i++)
{
if(!vis[i])qu.push(i);
}
for(int i=1;i<=n;i++)
{
if(a[i]>n)printf("%d ",qu.front()),qu.pop();
else {
if(vis[a[i]]==1)printf("%d ",a[i]);
else if(vis[a[i]]>1)
{
printf("%d ",qu.front());
qu.pop();
vis[a[i]]--;
}
}
}
return 0;
}
相关文章推荐
- python科学计算基础知识
- C++ Primer 练习13.36和13.37
- FTP之FileZilla Server
- 初识C++之封装
- MAC OS下maven环境变量配置
- [C++]vector 的 push_back实现原理
- 中科同向备份软件Heartsone-backup(足足16个软件,可差异化备份虚拟机)
- Java学习基础入门
- Linux下进程间通信之消息队列
- Android中的IPC方式
- 根据经纬度 计算 出geohash 值 。
- Clang和LLVM学习(Day2)
- 接口测试
- Android 反编译apk
- HDU1232:畅通工程
- TreeGrid
- 【数据存储】——JSON的解析和生成
- Activity的跳转与传值
- HDU 1495 非常可乐 (BFS求最短路)
- 数据库优化--NoSQL的分类和说明