# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
339424 | beksultan04 | Special graph (IZhO13_specialg) | C++14 | 54 ms | 65540 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;
#define int long long
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define scan1(a) scanf("%lld",&a);
#define scan2(a,b) scanf("%lld %lld",&a, &b);
#define scan3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
#define eps 1e-15
const int N = 1e5+12,INF=1e9+7;
vector <int> g[N];
int ans,vis[N];
void dfs(int x,int y,int cnt=0){
vis[x]=1;
if (x == y){
ans = cnt;
ret ;
}
if (ans > 0 )ret ;
for (int i=0;i<g[x].size();++i){
dfs(g[x][i],y,cnt+1);
}
vis[x]=0;
}
main(){
int n,i,j,m;
scan1(n)
for (i=1;i<=n;++i){
int x;
scan1(x)
if (x)g[i].pb(x);
}
scan1(m)
while (m--){
int t;
scan1(t)
if (t==1){
int x;
scan1(x)
g[x].pop_back();
}
else {
int x,y;
scan2(x,y)
ans=-1;
dfs(x,y);
cout <<ans<<'\n';
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |