# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
134599 | Ace | Network (BOI15_net) | C++14 | 2 ms | 380 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;
const int N = 5e5;
int n;
int ada[N+5];
int main(){
scanf("%d",&n);
for(int i=1;i<n;i++){
int u,v;
scanf("%d%d",&u,&v);
ada[u]++;
ada[v]++;
}
int cnt = 0;
for(int i=1;i<=n;i++){
if(ada[i] == 1) cnt++;
}
printf("%d\n",(cnt+1)/2);
int tmp = -1;
int bef = -1;
for(int i=1;i<=n;i++){
if(ada[i] == 1){
if(tmp == -1) tmp = i;
if(bef == -1){
bef = i;
} else {
printf("%d %d\n",i,bef);
bef = -1;
}
}
}
if(bef!=-1){
printf("%d %d\n",bef,tmp);
}
return 0;
}
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... |