Submission #89028

#TimeUsernameProblemLanguageResultExecution timeMemory
89028beso123특수한 그래프 (IZhO13_specialg)C++14
0 / 100
194 ms1704 KiB
#include <bits/stdc++.h> using namespace std; int n,p[100001],q,d=1; int used[10001]; int DFS(int v,int h){ used[v]=d; queue <int> q; q.push(v); int cnt=0; while(!q.empty()){ v=q.front(); q.pop(); if(v==h){ return cnt; } used[v]=d; if(used[p[v]]!=d && p[v]!=0) q.push(p[v]); cnt++; } if(used[h]!=d) return -1; } int main(){ cin>>n; vector <int > v; for(int k=1;k<=n;k++) cin>>p[k]; cin>>q; for(int k=1;k<=q;k++){ int a; cin>>a; if(a==1){ int b; cin>>b; p[b]=0; } if(a==2){ int b,c; cin>>b>>c; d++; v.push_back(DFS(b,c)); } } for(int k=0;k<v.size();k++) cout<<v[k]<<endl; return 0; }

Compilation message (stderr)

specialg.cpp: In function 'int main()':
specialg.cpp:45:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int k=0;k<v.size();k++)
                 ~^~~~~~~~~
specialg.cpp: In function 'int DFS(int, int)':
specialg.cpp:23:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
#Verdict Execution timeMemoryGrader output
Fetching results...