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;
random_device rd;
mt19937 rnd(rd());
#define pt pair<int, int>
#define x first
#define y second
#define what_is(x) cerr << #x << " is " << x << endl;
#define ok cerr << "ok" << endl;
#define endl '\n'
#define int long long
#define ld long double
const int N = 5e5 + 5;
vector<int> g[N];
signed main()
{
cin.tie(0), cout.tie(0), ios::sync_with_stdio(0);
int n;
cin >> n;
for (int i = 0, x, y; i < n - 1; ++i)
{
cin >> x >> y;
--x, --y;
g[x].push_back(y);
g[y].push_back(x);
}
vector<int> a;
for (int i = 0; i < n; ++i)
{
assert((int)g[i].size() > 0);
if (g[i].size() == 1)
a.push_back(i + 1);
}
int len = a.size();
if (len % 2 == 1)
{
cout << len / 2 + 1 << endl;
for (int i = 0; i < len / 2; ++i)
cout << a[i] << " " << a[i + len / 2] << endl;
cout << a[len / 2] << " " << a.back();
}
else
{
cout << len / 2 << endl;
for (int i = 0; i < len / 2; ++i)
cout << a[i] << " " << a[i + len / 2] << endl;
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |