| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 227990 | quocnguyen1012 | Network (BOI15_net) | C++14 | 5 ms | 384 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>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ar array
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int maxn = 5e5 + 5;
int deg[maxn], N;
vector<int> leaf;
signed main(void)
{
  ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  #ifdef LOCAL
    freopen("A.INP", "r", stdin);
    freopen("A.OUT", "w", stdout);
  #endif // LOCAL
  cin >> N;
  for(int i = 1; i < N; ++i){
    int u, v; cin >> u >> v;
    deg[u]++; deg[v]++;
  }
  for(int i = 1; i <= N; ++i){
    if(deg[i] == 1) leaf.eb(i);
  }
  cout << (leaf.size() + 1) / 2 << '\n';
  for(int i = 0; i < leaf.size(); i += 2){
    if(i == leaf.size() - 1){
      cout << leaf[i - 1] << ' ' << leaf[i] << '\n';
    }
    else cout << leaf[i] << ' ' << leaf[i + 1] << '\n';
  }
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
