oj.uz

Submission #1009228

# Submission time Handle Problem Language Result Execution time Memory
1009228 2024-06-27T10:13:22 Z tarpent Special graph (IZhO13_specialg) C++14
0 / 100
 1000 ms 852 KB 
#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>maxn){
					tr=0;
					break;
				}
			}
			if(tr==0) cout<<-1<<'\n';
			else cout<<od<<'\n';
		}
		
	}



}

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 472 KB Output is correct
2 Correct 9 ms 348 KB Output is correct
3 Correct 11 ms 348 KB Output is correct
4 Correct 4 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 14 ms 488 KB Output is correct
7 Correct 17 ms 468 KB Output is correct
8 Correct 16 ms 348 KB Output is correct
9 Correct 12 ms 348 KB Output is correct
10 Correct 15 ms 504 KB Output is correct
11 Execution timed out 1072 ms 852 KB Time limit exceeded
12 Halted 0 ms 0 KB -