zoukankan      html  css  js  c++  java
  • D. Make a Permutation!

    D. Make a Permutation!
    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Ivan has an array consisting of n elements. Each of the elements is an integer from 1 to n.

    Recently Ivan learned about permutations and their lexicographical order. Now he wants to change (replace) minimum number of elements in his array in such a way that his array becomes a permutation (i.e. each of the integers from 1 to n was encountered in his array exactly once). If there are multiple ways to do it he wants to find the lexicographically minimal permutation among them.

    Thus minimizing the number of changes has the first priority, lexicographical minimizing has the second priority.

    In order to determine which of the two permutations is lexicographically smaller, we compare their first elements. If they are equal — compare the second, and so on. If we have two permutations x and y, then x is lexicographically smaller if xi < yi, where i is the first index in which the permutations x and y differ.

    Determine the array Ivan will obtain after performing all the changes.

     
    Input

    The first line contains an single integer n (2 ≤ n ≤ 200 000) — the number of elements in Ivan's array.

    The second line contains a sequence of integers a1, a2, ..., an (1 ≤ ai ≤ n) — the description of Ivan's array.

     
    Output

    In the first line print q — the minimum number of elements that need to be changed in Ivan's array in order to make his array a permutation. In the second line, print the lexicographically minimal permutation which can be obtained from array with q changes.

    Examples
    Input
    4
    3 2 2 3
    Output
    2
    1 2 4 3
    Input
    6
    4 5 6 3 2 1
    Output
    0
    4 5 6 3 2 1
    Input
    10
    6 8 4 6 7 1 6 3 4 5
    Output
    3
    2 8 4 6 7 1 9 3 10 5
    Note

    In the first example Ivan needs to replace number three in position 1 with number one, and number two in position 3 with number four. Then he will get a permutation [1, 2, 4, 3] with only two changed numbers — this permutation is lexicographically minimal among all suitable.

    In the second example Ivan does not need to change anything because his array already is a permutation.

    字典序,已经存在的大于1以上要删去,(1,n)中没有的数按照顺序插入

     1 #include <algorithm>
     2 #include <iostream>
     3 #include <cstring>
     4 #include <stdio.h>
     5 #include <queue>
     6 #include <set>
     7 #include <map>
     8 using namespace std;
     9 inline int read(){    //输入外挂
    10   int x=0,f=1;
    11   char ch=getchar();
    12   while(ch<'0'||ch>'9'){
    13     if(ch=='-') f=-1;
    14     ch=getchar();
    15   }
    16   while(ch>='0'&&ch<='9'){
    17     x=x*10+ch-'0';
    18     ch=getchar();
    19   }
    20   return x*f;
    21 }
    22 #define mem(a) memset(a,0,sizeof(a))
    23 #define MN 200000
    24 int s[MN+5],a[MN+5],u[MN+5];
    25 int main(){
    26   int n=read(),i,j,ans=0;
    27   mem(s),mem(a),mem(u);
    28   for(i=1;i<=n;i++)
    29     if(s[a[i]=read()]++)
    30       ++ans;
    31   for(i=1;i<=n;i++)
    32     u[i]=!s[i];
    33     for(i=j=1;i<=n;i++)
    34       if(s[a[i]]>1){
    35         while(!u[j])
    36           ++j;
    37         if(s[a[i]]>MN||j<a[i])
    38           --s[a[i]],a[i]=j++;
    39         else s[a[i]]=MN*10+5;
    40       }
    41     printf("%d
    ",ans);
    42     for(int i=1;i<=n;i++)
    43       printf("%d ",a[i]);
    44       printf("
    ");
    45   return 0;
    46 }
  • 相关阅读:
    基于HT for Web矢量实现3D叶轮旋转
    基于HT for Web矢量实现2D叶轮旋转
    HT for Web列表和3D拓扑组件的拖拽应用
    基于HT for Web矢量实现HTML5文件上传进度条
    Java 8 VM GC Tunning Guide Charter 5
    Java 8 VM GC Tunning Guide Charter 6
    Java 8 VM GC Tunning Guide Charter 7-8-b
    Java 8 VM GC Tunning Guild Charter 9-b
    java文档 第十一章 其他考量-b
    iOS点击cell查看大图,点击大图还原小图-b
  • 原文地址:https://www.cnblogs.com/z-712/p/7604038.html
Copyright © 2011-2022 走看看