| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1009230 | bornag | Special graph (IZhO13_specialg) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
using namespace std;
const int maxn = 1e5;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
bool vis[maxn][maxn];
int n, m;
int graph[maxn];
int dis[maxn];
int dfs(int nd, int e, int d, int indx){
vis[indx][nd] = true;
if(nd == e) return d;
if(graph[nd] == -1) return -1;
if(vis[indx][nd]) return dfs(graph[nd], e, d+1, indx);
else return -1;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cin >> n;
for(int i = 0; i < n; i++){
cin >> graph[i]; graph[i]--;
}
cin >> m;
while(m--){
int typ; cin >> typ;
if(typ == 1){
int x; cin >> x;
graph[x-1] = -1;
} else {
int a, b; cin >> a >> b;
if(graph[a-1] == -1) {
cout << -1 << '\n';
continue;
}
cout << dfs(a-1, b-1, 0, m) << '\n';
}
}
}