# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1009232 | tarpent | Special graph (IZhO13_specialg) | C++14 | 821 ms | 1084 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<bits/stdc++.h>
using namespace std;
int n,m,ch,x,y,tr,od;
const int maxn = 1e5+7;
int a[maxn];
int main(){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cin>>n;
for(int i = 0; i<n; i++){
cin>>a[i+1];
}
cin>>m;
for(int i = 0; i<m; i++){
cin>>ch;
if(ch==1){
cin>>x;
a[x]=0;
}
else{
cin>>x>>y;
tr=x;
od=0;
while(tr!=y){
tr=a[tr];
od++;
if(tr==0 && tr!=y){
break;
}
if(od>5000){
tr=0;
break;
}
}
if(tr==0) cout<<-1<<'\n';
else cout<<od<<'\n';
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |