zoukankan      html  css  js  c++  java
  • Codeforce 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.

     贪心

    #include<cstdio>
    #include<algorithm>
    #include<cstring>
    #include<iostream>
    using namespace std;
    
    int n,a[200008],boo[200008],b[200008],c[200008],tot,ans;
    
    int main(){
        scanf("%d",&n);
        for(int i=1;i<=n;i++){
            scanf("%d",&a[i]);
            boo[a[i]]++;
        }
        tot=0;
        for(int i=1;i<=n;i++)
            if(!boo[i]){
                tot++;
                b[tot]=i;
            }
        b[tot+1]=n+1;
        int k=1; ans=0;
        for(int i=1;i<=n;i++)
            if(boo[a[i]]>1){
                if(!c[a[i]]&&b[k]>a[i]){
                    c[a[i]]=1;
                    continue;
                }
                boo[a[i]]--;
                ans++;
                a[i]=b[k];
                k++;
            }
        printf("%d
    ",ans);
        for(int i=1;i<n;i++)
            printf("%d ",a[i]);
        printf("%d",a[n]);
    }
  • 相关阅读:
    poj 1743 Musical Theme 后缀数组
    poj 1743 Musical Theme 后缀数组
    cf 432D Prefixes and Suffixes kmp
    cf 432D Prefixes and Suffixes kmp
    hdu Data Structure? 线段树
    关于position和anchorPoint之间的关系
    ios POST 信息
    CALayers的代码示例
    CALayers详解
    ios中得sqlite使用基础
  • 原文地址:https://www.cnblogs.com/WQHui/p/7593842.html
Copyright © 2011-2022 走看看