#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>6600){
tr=0;
break;
}
}
if(tr==0) cout<<-1<<'\n';
else cout<<od<<'\n';
}
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
2 ms |
348 KB |
Output is correct |
4 |
Correct |
2 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
13 ms |
348 KB |
Output is correct |
7 |
Correct |
15 ms |
348 KB |
Output is correct |
8 |
Correct |
15 ms |
488 KB |
Output is correct |
9 |
Correct |
13 ms |
348 KB |
Output is correct |
10 |
Correct |
16 ms |
348 KB |
Output is correct |
11 |
Incorrect |
991 ms |
1104 KB |
Output isn't correct |
12 |
Halted |
0 ms |
0 KB |
- |