fork(9) download
copy 
  1. #include<cstdio>
  2. #include<iostream>
  3. #include<algorithm>
  4. #include<string>
  5. #include<cstring>
  6. #include<vector>
  7. #include<stack>
  8. #include<queue>
  9. #include<deque>
  10. #include<map>
  11. #include<set>
  12. #include<limits>
  13. #include<climits>
  14. #include<cmath>
  15. #include<functional>
  16. #include<ctime>
  17. #include<cstdlib>
  18. #include<fstream>
  19. #include<typeinfo>
  20.  
  21. using namespace std;
  22.  
  23. typedef long long int ll;
  24. typedef unsigned long long int u64;
  25. typedef unsigned u32;
  26.  
  27. const int MAX = 1<<17;
  28.  
  29. int cnt[2],n;
  30.  
  31. vector <int> v[MAX];
  32.  
  33. bool used[MAX];
  34.  
  35. void DFS(int node, bool p)
  36. {
  37.     used[node]=true;
  38.     cnt[p]++;
  39.     int i;
  40.     for(i=0;i<v[node].size();i++)
  41.         if(!used[v[node][i]])
  42.             DFS(v[node][i],p^1);
  43. }
  44.  
  45. void input()
  46. {
  47.     scanf("%d", &n);
  48.     int i,a,b;
  49.     for(i=1;i<n;i++)
  50.     {
  51.         scanf("%d %d", &a, &b);
  52.         v[a].push_back(b);
  53.         v[b].push_back(a);
  54.     }
  55. }
  56.  
  57. void solve()
  58. {
  59.     DFS(1,0);
  60.     printf("%d\n", min(cnt[0],cnt[1]));
  61. }
  62.  
  63. int main()
  64. {
  65.     input();
  66.     solve();
  67.     return 0;
  68. }
  69.  
Success #stdin #stdout 0s 4764KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
0
https://ideone.com/mbhg8o
language:
C++14 (gcc 8.3)
created:
9 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!