/** made by amunduzbaev **/
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vll vector<ll>
#define vii vector<int>
#define vpii vector<pii>
#define vpll vector<pll>
#define cnt(a)__builtin_popcount(a)
template<class T> bool umin(T& a, const T& b) {return a > b? a = b, true:false;}
template<class T> bool umax(T& a, const T& b) {return a < b? a = b, true:false;}
const int N = 2e3+5;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
int s, n, m, k, ans, a[N], par[N], used[N];
int find(int a, int b){
if(used[a]) return -1;
used[a] = 1;
//cout<<a<<" "<<b<<endl;
if(par[a] == b) return 1;
if(par[a] == 0) return -1;
int res = find(par[a], b);
return (res > 0 ? res+1 : res);
}
void solve(){
cin>>n;
for(int i=1;i<=n;i++){
int x;
cin>>x;
par[i] = x;
}
cin>>m;
for(int i=0;i<m;i++){
int t;
cin>>t;
if(t == 1){
int in;
cin>>in;
par[in] = 0;
}else{
memset(used, 0, sizeof used);
int a, b;
cin>>a>>b;
cout<< find(a, b) <<"\n";
}//cout<<"____"<<endl;
}
return;
}
int main(){
fastios
int t = 1;
if(t) solve();
else {
cin>>t;
while (t--) solve();
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
364 KB |
Output is correct |
| 2 |
Correct |
3 ms |
364 KB |
Output is correct |
| 3 |
Correct |
3 ms |
492 KB |
Output is correct |
| 4 |
Correct |
6 ms |
492 KB |
Output is correct |
| 5 |
Correct |
3 ms |
492 KB |
Output is correct |
| 6 |
Correct |
35 ms |
620 KB |
Output is correct |
| 7 |
Correct |
36 ms |
620 KB |
Output is correct |
| 8 |
Correct |
39 ms |
620 KB |
Output is correct |
| 9 |
Correct |
32 ms |
620 KB |
Output is correct |
| 10 |
Correct |
40 ms |
620 KB |
Output is correct |
| 11 |
Runtime error |
2 ms |
620 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 12 |
Halted |
0 ms |
0 KB |
- |
