# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
23240 | jjwdi0 | Network (BOI15_net) | C++11 | 6 ms | 14224 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;
int N;
vector<int> v[500005], ans;
bool leaf[500005];
void dfs(int x, int p) {
for(int it : v[x]) {
if(it == p) continue;
dfs(it, x);
}
if(v[x].size() == 1) leaf[x] = 1;
}
int main() {
scanf("%d", &N);
for(int i=1, x, y; i<N; i++) {
scanf("%d %d", &x, &y);
v[x].push_back(y);
v[y].push_back(x);
}
dfs(1, 0);
for(int i=1; i<=N; i++) if(leaf[i]) ans.push_back(i);
if((int)ans.size() % 2 == 1) ans.push_back(ans[0]);
printf("%d\n", (int)ans.size() / 2);
for(int i=0; i<ans.size(); i+=2) printf("%d %d\n", ans[i], ans[i+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... |