# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
25733 | nibnalin | Network (BOI15_net) | C++14 | 0 ms | 3972 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 <iostream>
#include <cstdio>
#include <vector>
using namespace std;
const int maxn = int(5e5)+5;
int deg[maxn];
int main(void)
{
int n, u, v;
scanf("%d", &n);
for(int i = 1;i < n;i++)
{
scanf("%d%d", &u, &v);
u--, v--;
deg[u]++, deg[v]++;
}
vector<int> leafs;
for(int i = 0;i < n;i++)
{
if(deg[i] == 1)
{
leafs.push_back(i);
}
}
printf("%d\n", int(leafs.size())/2+int(leafs.size())%2);
for(int i = 0;i < int(leafs.size())-1;i += 2)
{
printf("%d %d\n", leafs[i]+1, leafs[i+1]+1);
}
if(int(leafs.size()%2)) printf("%d %d\n", leafs[int(leafs.size())-2]+1, leafs[int(leafs.size())-1]+1);
}
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... |