oj.uz

Submission #477367

# Submission time Handle Problem Language Result Execution time Memory
477367 2021-10-01T19:41:50 Z ogibogi2004 Crazy old lady (IZhO13_crazy) C++14
0 / 100
 1 ms 204 KB 
#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;
        }
        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;
}

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 0 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -