답안 #339740

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
339740	2020-12-26T05:54:31 Z	talant117408	성질 급한 지학이 (IZhO13_crazy)	C++17	100 / 100	8 ms	384 KB

crazy

/*
    Code written by Talant I.D.
*/
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
 
//using namespace __gnu_pbds;
using namespace std;
//typedef tree <int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
  
#define precision(n) fixed << setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define eps (double)1e-9
#define PI 2*acos(0.0)
#define endl "\n"
#define sz(v) int((v).size())
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define OK cout << "OK" << endl;
  
inline bool isvowel(char ch){
    ch = tolower(ch);
    return (ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u');
}
  
inline bool isprime(int n){
    if(n < 2 || (n%2 == 0 && n != 2)) return false;
    for(int i = 3; i*i <= n; i++)
        if(n%i == 0) return false;
    return true;
}
 
class Union{
    private:
        vector <int> saizu, link;
    public:
        Union(int n){
            saizu.assign(n, 1); link.resize(n); 
            iota(all(link), 0);
        }
        int find(int n){
            if(link[n] == n) return n;
            return link[n] = find(link[n]);
        }
        int same(int a, int b){
            return find(a) == find(b);
        }
        void unite(int a, int b){
            if(same(a, b)) return;
             
            a = find(a); b = find(b);
            if(saizu[a] < saizu[b]) swap(a, b);
             
            saizu[a] += saizu[b];
            link[b] = a;
        }
        int getsize(int a){
            return saizu[find(a)];
        }
};
 
const int mod = 1e9+7;
 
ll mode(ll a){
    a %= mod;
    if(a < 0) a += mod;
    return a;
}
 
ll subt(ll a, ll b){
    return mode(mode(a)-mode(b));
}
 
ll add(ll a, ll b){
    return mode(mode(a)+mode(b));
}
 
ll mult(ll a, ll b){
    return mode(mode(a)*mode(b));
}
 
ll binpow(ll a, ll b){
    ll res = 1;
    while(b){
        if(b&1) res = mult(res, a);
        a = mult(a, a);
        b >>= 1;
    }
    return res;
}

int main(){
    do_not_disturb
    
    int t; 
    cin >> t;
    while(t--){
        int n, valid = 0, ind = 0;
        cin >> n;
        int v[n+1], used[n+1];
        for(int i = 1; i <= n; i++){
            cin >> v[i];
        }
        for(int j = 1; j <= n; j++){
            bool flag = 1;
            for(int i = 1; i <= n; i++){
                used[i] = 0;
            }
            used[v[1]]++;
            for(int i = 2; i <= n; i++){
                if(i <= j){
                    if(!used[i-1]){
                        if(i-1 == v[i]){
                            used[i-1]++;
                        }
                        else{
                            flag = 0;
                            break;
                        }
                    }
                    else if(!used[v[i]]){
                        used[v[i]]++;
                    }
                    else{
                        flag = 0;
                        break;
                    }
                }
                else{
                    if(!used[i]){
                        if(i == v[i]){
                            used[i]++;
                        }
                        else{
                            flag = 0;
                            break;
                        }
                    }
                    else if(!used[v[i]]){
                        used[v[i]]++;
                    }
                    else{
                        flag = 0;
                        break;
                    }
                }
            }
            if(flag){
                valid++;
                ind = j;
            }
        }
        
        if(valid == 1){
            cout << ind << endl;
        }
        else{
            cout << 0 << endl;
        }
    }
    
    return 0;
}

Subtask #1

100.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	2 ms	364 KB	Output is correct
11	Correct	2 ms	364 KB	Output is correct
12	Correct	2 ms	364 KB	Output is correct
13	Correct	3 ms	384 KB	Output is correct
14	Correct	4 ms	364 KB	Output is correct
15	Correct	3 ms	364 KB	Output is correct
16	Correct	5 ms	364 KB	Output is correct
17	Correct	4 ms	364 KB	Output is correct
18	Correct	7 ms	364 KB	Output is correct
19	Correct	6 ms	364 KB	Output is correct
20	Correct	8 ms	364 KB	Output is correct