zoukankan      html  css  js  c++  java
  • codeforces569B

    Inventory

     CodeForces - 569B 

    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.

    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.

    Examples

    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.

    sol:XJB乱构造,对于只出现一次的当然保留,否则替换成没出现过的,顺便把当前数字的出现次数-1

    #include <bits/stdc++.h>
    using namespace std;
    typedef int ll;
    inline ll read()
    {
        ll s=0;
        bool f=0;
        char ch=' ';
        while(!isdigit(ch))
        {
            f|=(ch=='-'); ch=getchar();
        }
        while(isdigit(ch))
        {
            s=(s<<3)+(s<<1)+(ch^48); ch=getchar();
        }
        return (f)?(-s):(s);
    }
    #define R(x) x=read()
    inline void write(ll x)
    {
        if(x<0)
        {
            putchar('-'); x=-x;
        }
        if(x<10)
        {
            putchar(x+'0');    return;
        }
        write(x/10);
        putchar((x%10)+'0');
        return;
    }
    #define W(x) write(x),putchar(' ')
    #define Wl(x) write(x),putchar('
    ')
    const int N=100005;
    int n,a[N],Ges[N],Shuz[N];
    int main()
    {
        int i;
        R(n);
        for(i=1;i<=n;i++)
        {
            Ges[a[i]=read()]++;
        }
        for(i=1;i<=n;i++) if(!Ges[i]) Shuz[++*Shuz]=i;
        int Now=1;
        for(i=1;i<=n;i++)
        {
            if(a[i]<=n&&Ges[a[i]]==1) W(a[i]);
            else
            {
                W(Shuz[Now++]);
                Ges[a[i]]--;
            }
        }
        return 0;
    }
    /*
    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
    */
    View Code
  • 相关阅读:
    (转)Epoll模型详解
    (转)彻底学会使用epoll(一)——ET模式实现分析
    (转)Linux内核 TCP/IP、Socket参数调优
    Nodejs RESTFul架构实践之api篇(转)
    创业笔记-Node.js入门之阻塞与非阻塞
    创业笔记-Node.js入门之基于事件驱动的回调
    创业笔记-Node.js入门之一个完整的基于Node.js的web应用
    创业笔记-Node.js入门之JavaScript与Node.js
    在CentOS6.5下配置安装LVS
    zend studio 添加xdebug调试php代码
  • 原文地址:https://www.cnblogs.com/gaojunonly1/p/10645150.html
Copyright © 2011-2022 走看看