Advertisement
Guest User

Untitled

a guest
Jul 29th, 2016
53
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.08 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. #define pb push_back
  3. #define sz(x) x.size()
  4. #define F first
  5. #define S second
  6. #define mp make_pair
  7. #define ll long long
  8. #define sqr(x) ((x)*(x))
  9. using namespace std;
  10. ll a[1010][1010], b[100010], c[10010];
  11. ll mn=1e9, mx=-1e9, ans, cnt, sm;
  12. bool ok, okk, u[1000010], uu[1000010];
  13. ll n, m;
  14. int x, y;
  15. vector <int> v, vv;
  16.  
  17. void dfs(ll l){
  18. u[l]=1;
  19. for(int i=1;i<=n;i++){
  20. if(a[l][i]==1 && !u[i]){
  21. v.pb(i);
  22. cout<<i<<" "<<y<<" "<<l<<endl;
  23. u[i]=1;
  24. dfs(i);
  25. }
  26. }
  27. }
  28. void dfsk(ll l){
  29. uu[l]=1;
  30. for(int i=1;i<=n;i++){
  31. if(a[l][i]==1 && !uu[i]){
  32. vv.pb(i);
  33. cout<<i<<" "<<x<<" "<<l<<endl;
  34. uu[i]=1;
  35. dfsk(i);
  36. }
  37. }
  38. }
  39.  
  40. int main(){
  41.  
  42. freopen ("input.txt","r",stdin);
  43. freopen ("output.txt","w",stdout);
  44.  
  45. cin>>n;
  46. cin>>x>>y;
  47. for(int i=0;i<n-1;i++){
  48. int k;
  49. cin>>k;
  50. a[i+2][k]=1;
  51. a[k][i+2]=1;
  52. }
  53. dfs(y);
  54. cout<<endl;
  55. cout<<endl;
  56. dfsk(x);
  57.  
  58.  
  59. return 0;
  60. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement