Submission #339431

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
339431	2020-12-25T08:31:39 Z	talant117408	Special graph (IZhO13_specialg)	C++17	0 / 100	170 ms	876 KB

specialg

/*
    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;
}

const int N = 2e3+7;
int dist[N], used[N];
vector <set <int>> graph(N);

void dfs(int v, int p){
    used[v] = 1;
    dist[v] = min(dist[v], dist[p]+1);
    for(auto to : graph[v]){
        if(!used[to]){
            dfs(to, v);
        }
    }
}

int main(){
    do_not_disturb
    
    int n, m;
    cin >> n;
    for(int i = 1; i <= n; i++){
        int x;
        cin >> x;
        if(x) graph[i].insert(x);
    }
    
    cin >> m;
    
    if(n <= 2000 && m <= 20000){
        while(m--){
            int type;
            cin >> type;
            if(type == 1){
                int x;
                cin >> x;
                graph[x].clear();
            }
            else{
                int a, b;
                cin >> a >> b;
                for(int i = 1; i <= n; i++){
                    dist[i] = 2e9;
                    used[i] = 0;
                }
                dist[a] = -1;
                dfs(a, a);
                cout << (dist[b] == 2e9 ? -1 : dist[b]+1) << endl;
            }
        }
    }
    
    return 0;
}

Subtask #1

0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	492 KB	Output is correct
2	Correct	5 ms	492 KB	Output is correct
3	Correct	6 ms	512 KB	Output is correct
4	Correct	8 ms	512 KB	Output is correct
5	Correct	6 ms	492 KB	Output is correct
6	Correct	131 ms	620 KB	Output is correct
7	Correct	153 ms	628 KB	Output is correct
8	Correct	162 ms	748 KB	Output is correct
9	Correct	132 ms	640 KB	Output is correct
10	Correct	170 ms	620 KB	Output is correct
11	Runtime error	1 ms	876 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
12	Halted	0 ms	0 KB	-