# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
905899 | dsyz | Network (BOI15_net) | C++17 | 4 ms | 12376 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;
#define MAXN (500005)
ll N, connectto1 = -1;
vector<ll> v[MAXN];
bool leaf[MAXN];
void dfs(ll x,ll p){
ll children = 0;
ll leafchildren = 0;
for(auto u : v[x]){
if(u != p){
dfs(u,x);
leafchildren += leaf[u];
if(leafchildren >= 2) connectto1 = u;
children++;
}
}
if(children == 0){
leaf[x] = 1;
}
}
int main() {
ios_base::sync_with_stdio(false);cin.tie(0);
cin>>N;
for(ll i = 0;i < N - 1;i++){
ll a,b;
cin>>a>>b;
a--, b--;
v[a].push_back(b);
v[b].push_back(a);
}
dfs(0,-1);
vector<ll> ans;
for(ll i = 0;i < N;i++){
if(leaf[i] && i != connectto1){
ans.push_back(i + 1);
}
}
cout<<ans.size() - 1 + 1<<'\n';
cout<<1<<" "<<connectto1<<'\n';
for(ll i = 1;i < ans.size();i++){
cout<<ans[i - 1]<<" "<<ans[i]<<'\n';
}
}
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... |