Submission #10183084


Source Code Expand

#include<bits/stdc++.h><bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int hmt() {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';if(n) x=-x;return x;}
#define in hmt()
#define ins ({string x;char c=getchar();for(;c==' '||c=='\n';c=getchar());for(;c!=' '&&c!='\n';c=getchar()) x+=c;x;})
#define forinc(i,a,b) for(int i=a,_b=b;i<=_b;++i)
#define fordec(i,a,b) for(int i=a;i>=b;--i)
#define forb(i,BS) for(int i=BS._Find_first();i< BS.size();i = BS._Find_next(i))
#define forv(a,b) for(auto &a:b)
#define pb push_back
#define pii pair<int,int>
#define fi first
#define se second
#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 onbit(x,i) (x|(1<<(i-1)))
#define offbit(x,i) (x&~(1<<(i-1)))
const int N=100010;
int n,s[N],a[N];
set<int> f;
set<pii> t;
int main()
{
    //freopen("ATCODER.inp","r",stdin);
    n=in;
    forinc(i,1,n) a[i]=in,f.insert(i),s[a[i]]++;
    forinc(i,1,n) t.insert({s[i],i});
    if(n==2&&a[1]==2) return cout<<-1,0;
    int p=0;
    forinc(i,1,n)
    {
        int u=0;
        forv(x,f) if(x!=a[p]) {u=x;break;}
        if(t.rbegin()->fi==n-i) u=t.rbegin()->se;
        if(u==a[p]) return -1;
        cout<<u<<" ";p=u;
        f.erase(u);
        t.erase({s[u],u});
        t.erase({s[a[u]],a[u]});
        s[a[u]]--;
        t.insert({s[a[u]],a[u]});
    }
}

Submission Info

Submission Time
Task D - Arrangement
User tduong0806
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1502 Byte
Status RE
Exec Time 139 ms
Memory 11008 KB

Compile Error

./Main.cpp:1:24: warning: extra tokens at end of #include directive
 #include<bits/stdc++.h><bits/stdc++.h>
                        ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 800
Status
AC × 3
AC × 42
RE × 8
Set Name Test Cases
Sample sample_01, sample_02, sample_03
All hand2_01, hand2_02, hand2_03, hand2_04, hand_01, hand_02, hand_03, hand_04, handmaid_01, max_01, max_02, max_03, max_04, max_05, random_01, random_02, random_03, random_04, random_05, random_06, random_07, random_08, random_09, random_10, random_11, random_12, random_13, random_14, random_15, sample_01, sample_02, sample_03, small_01, small_02, small_03, small_04, small_05, special2_01, special2_02, special2_03, special2_04, special2_05, special2_06, special2_07, special2_08, special2_09, special2_10, special_01, special_02, special_03
Case Name Status Exec Time Memory
hand2_01 AC 1 ms 256 KB
hand2_02 AC 1 ms 256 KB
hand2_03 AC 132 ms 10624 KB
hand2_04 AC 122 ms 10624 KB
hand_01 AC 1 ms 256 KB
hand_02 RE 1 ms 256 KB
hand_03 RE 138 ms 11008 KB
hand_04 RE 139 ms 11008 KB
handmaid_01 RE 1 ms 256 KB
max_01 AC 119 ms 11008 KB
max_02 AC 104 ms 11008 KB
max_03 AC 100 ms 10880 KB
max_04 AC 110 ms 11008 KB
max_05 AC 95 ms 10624 KB
random_01 AC 1 ms 256 KB
random_02 AC 1 ms 256 KB
random_03 AC 1 ms 256 KB
random_04 AC 1 ms 256 KB
random_05 AC 1 ms 256 KB
random_06 AC 1 ms 256 KB
random_07 RE 2 ms 384 KB
random_08 AC 1 ms 256 KB
random_09 AC 1 ms 256 KB
random_10 AC 1 ms 256 KB
random_11 RE 1 ms 256 KB
random_12 AC 1 ms 256 KB
random_13 AC 1 ms 256 KB
random_14 RE 1 ms 256 KB
random_15 AC 1 ms 256 KB
sample_01 AC 1 ms 256 KB
sample_02 AC 1 ms 256 KB
sample_03 AC 2 ms 256 KB
small_01 AC 1 ms 256 KB
small_02 AC 1 ms 256 KB
small_03 RE 1 ms 256 KB
small_04 AC 1 ms 256 KB
small_05 AC 1 ms 256 KB
special2_01 AC 113 ms 10624 KB
special2_02 AC 118 ms 10624 KB
special2_03 AC 111 ms 10624 KB
special2_04 AC 115 ms 10624 KB
special2_05 AC 121 ms 10624 KB
special2_06 AC 85 ms 11008 KB
special2_07 AC 85 ms 11008 KB
special2_08 AC 84 ms 11008 KB
special2_09 AC 84 ms 11008 KB
special2_10 AC 83 ms 11008 KB
special_01 AC 1 ms 256 KB
special_02 AC 4 ms 768 KB
special_03 AC 90 ms 11008 KB