# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
137107 | silxikys | Network (BOI15_net) | C++14 | 2068 ms | 57680 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>
using namespace std;
using ll = long long;
const int maxn = 5e5+5;
int n;
vector<int> adj[maxn];
int deg[maxn];
int tin[maxn];
int pt = 0;
void dfs(int i, int p) {
tin[i] = pt++;
for (int j: adj[i]) {
if (j == p) continue;
dfs(j,i);
}
}
int main()
{
scanf("%d",&n);
for (int i = 0; i < n - 1; i++) {
int a, b; scanf("%d %d",&a,&b);
++deg[a];
++deg[b];
adj[a].push_back(b);
adj[b].push_back(a);
}
vector<int> leafs;
leafs.reserve(n);
int start = 1;
for (int i = 1; i <= n; i++) {
if (deg[i] == 1) leafs.push_back(i);
if (deg[i] > 1) {
start = i;
}
}
for (int j: adj[start]) {
dfs(j,j);
}
sort(leafs.begin(),leafs.end(),[&](auto a, auto b) {
return tin[a] < tin[b];
});
int k = leafs.size();
int m = k/2;
printf("%d\n",(k+1)/2);
for (int i = 0; i < (k+1)/2; i++) {
printf("%d %d\n",leafs[i],leafs[(i+m)%k]);
}
}
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... |