Submission #10187083

---

Source Code Expand

/// https://atcoder.jp/contests/dwacon6th-prelims/tasks/dwacon6th_prelims_d
#include <bits/stdc++.h>
using namespace std;
#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;})
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937 rng(1);
int rnd(int l,int r){return l+rng()%(r-l+1);}
#define fasty ios_base::sync_with_stdio(0),cin.tie(0);
#define forinc(a,b,c) for(int a=b,_c=c;a<=_c;++a)
#define fordec(a,b,c) for(int a=b,_c=c;a>=_c;--a)
#define forv(a,b) for(auto&a:b)
#define fi first
#define se second
#define pb push_back
#define ii pair<int,int>
#define mt make_tuple
#define all(a) a.begin(),a.end()
#define reset(f, x) memset(f, x, sizeof(f))
#define bit(x,i) ((x>>(i-1))&1)
#define on(x,i) (x|(1ll<<(i-1)))
#define off(x,i) (x&~(1<<(i-1)))
#define gg exit(0);

const int N=100010;

int n;
int cnt[N],a[N];
set<int> st;
vector<int> ans;

void inc(int x){
    ans.pb(x);
    st.erase(x);
}
void dec(){
    st.insert(ans.back());
    ans.pop_back();
}

void dfs(int ban){
    if(ans.size()==n){
        forv(i,ans) cout<<i<<" ";
        gg
    }
    if(st.count(ban) && cnt[ban]==n-ans.size())
        return;
    cnt[ban]--;
    for(auto it=st.begin();it!=st.end();it++){
		if(*it==ban) continue;
		inc(*it);
		dfs(a[*it]);
		dec();
	}
	cnt[ban]++;
}

main(){
    #define task "arrangement"
    //freopen(task".inp","r",stdin);
    //freopen(task".out","w",stdout);

    if((n=in)==2) return cout<<-1,0;
    forinc(i,1,n) cnt[a[i]=in]++,st.insert(i);
    dfs(0);
}

Submission Info

Judge Result