Submission #10183919

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define forinc(i,a,b) for(int i=a;i<=b;++i)
#define fordec(i,a,b) for(int i=a;i>=b;--i)
#define forv(i,x) for(auto &i:x)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int l,int r)
{
    return l+rng()%(r-l+1);
}
#define in ({int x=0;int c=getchar(),n=0;for(;!isdigit(c);c=getchar()) n=(c=='-');for(;isdigit(c);c=getchar()) x=x*10+c-'0';n?-x:x;})
#define pii pair<int,int>
#define fi first
#define se second
#define batbit(i,x) (x|(1ll<<i))
#define getbit(i,x) ((x>>i)&1)

const int mn=1e5+5;
int n,a[mn],kq[mn],cnt,dd[mn];
set<int> s;

main()
{
    //freopen("test.inp","r",stdin);

    cin >> n;
    forinc(i,1,n) cin >> a[i];
    if(n==2&&a[1]==2&&a[2]==1)
    {
        cout << -1;
        return 0;
    }
    forinc(i,1,n) s.insert(i);
    while(!s.empty())
    {
        int f=*s.begin();
        int tmp=a[f],ok=1;
        forv(v,s)
        {
            if(a[v]!=tmp)
            {
                ok=0;
                break;
            }
        }
        if(ok&&!dd[a[f]])
        {
            kq[++cnt]=a[f];
            dd[kq[cnt]]=1;
            s.erase(a[f]);
        }
        else
        {
            forv(v,s) if(a[kq[cnt]]!=v)
            {
                kq[++cnt]=v;
                break;
            }
            dd[kq[cnt]]=1;
            s.erase(kq[cnt]);
        }
        //cout << kq[cnt] << " ";
    }
    forinc(i,1,cnt) cout << kq[i] << " ";
}

Submission Info

Judge Result