이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#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> leaves;
for (int i = 0; i < n; ++i)
if (g[i].size() == 1)
leaves.push_back(i + 1);
vector<pt> ans;
for (int i = 0; i + 2 < (int)leaves.size(); i += 2)
ans.push_back({leaves[i], leaves[i + 1]});
if (leaves.size() % 2)
ans.push_back({leaves[0], leaves.back()});
cout << ans.size() << endl;
for (auto i: ans)
cout << i.x << " " << i.y << 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... |