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 <bits/stdc++.h>
#define ll long long
using namespace std;
const ll maxn = 2*1e5+5, INF = 4e18+9;
void solve(){
int n;
cin >> n;
vector<vector<int>> adj(n+1);
for(int i = 1; i < n; i++){
int u, v;
cin >> u >> v;
adj[u].push_back(v);
adj[v].push_back(u);
}
vector<int> leaf;
auto dfs = [&](auto dfs, int u, int p) -> void{
if(adj[u].size() == 1){
leaf.push_back(u);
}
for(int v : adj[u]){
if(v == p) continue;
dfs(dfs, v, u);
}
};
dfs(dfs, 1, 0);
//leaf is sorted based on dfs order
cout << (leaf.size()+1)/2 << "\n";
for(int i = 0; i < leaf.size()/2; i++){
cout << leaf[i] << " " << leaf[i+leaf.size()/2] << "\n";
}
if(leaf.size()&1){
cout << leaf[0] << " " << leaf.back() << "\n";
}
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
}
Compilation message (stderr)
net.cpp: In function 'void solve()':
net.cpp:29:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
29 | for(int i = 0; i < leaf.size()/2; i++){
| ~~^~~~~~~~~~~~~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |