Submission #477372

#TimeUsernameProblemLanguageResultExecution timeMemory
477372ogibogi2004성질 급한 지학이 (IZhO13_crazy)C++14
100 / 100
19 ms340 KiB
#include<bits/stdc++.h> using namespace std; const int MAXN=1024; int t; int a[MAXN]; bool taken[MAXN]; void solve() { int n; cin>>n; for(int i=1;i<=n;i++)cin>>a[i]; set<int>possible; for(int lady=1;lady<=n;lady++) { memset(taken,0,sizeof(taken)); taken[a[1]]=1; bool ok=1; for(int j=1;j<lady;j++) { if(taken[j]==0&&a[j+1]!=j) { ok=0;break; } taken[a[j+1]]=1; } for(int j=lady+1;j<=n;j++) { if(taken[j]==0&&a[j]!=j) { ok=0;break; } taken[a[j]]=1; } if(ok)possible.insert(lady); } if(possible.size()==1) { cout<<(*possible.begin())<<endl; } else { cout<<0<<endl; } } int main() { cin>>t; while(t--)solve(); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...