#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];
}
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 && od<maxn){
tr=a[tr];
od++;
if(tr==0 && tr!=y){
break;
}
}
if(tr==0) cout<<-1<<'\n';
else cout<<od<<'\n';
}
}
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
40 ms |
344 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
