Submission #848289

#TimeUsernameProblemLanguageResultExecution timeMemory
848289Darren0724Crazy old lady (IZhO13_crazy)C++17
0 / 100
1 ms344 KiB
#include <bits/stdc++.h> using namespace std; void solve(){ int n;cin>>n; vector<int> v(n+1),pos(n+1); for(int i=1;i<=n;i++){ cin>>v[i]; pos[v[i]]=i; } vector<int> ans; for(int i=1;i<=n;i++){ vector<int> a(n+1); a[i]=1; int flag=1; int cnt=0; for(int j=1;j<=n;j++){ if(j==v[i]){ continue; } cnt++; int seat=-1; if(a[j]==0){ seat=j; if(v[j]!=j){ flag=0; break; } } else if(a[pos[j]]==0){ seat=pos[j]; } else{ flag=0; break; } if(cnt!=n-1&&seat==v[i]){ flag=0; break; } a[seat]=1; } if(flag){ ans.push_back(i); } } cout<<(ans.size()==1?ans[0]:0)<<endl; } int32_t main() { int t;cin>>t; while(t--){ solve(); } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...