# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
100600 | MohamedAhmed0 | Network (BOI15_net) | C++14 | 742 ms | 47932 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 MAX = 500005 ;
int n ;
vector< vector<int> >adj(MAX) ;
stack<int>s ;
vector<int>v ;
void dfs(int node , int par)
{
if(adj[node].size() == 1)
v.push_back(node) ;
for(auto &child : adj[node])
{
if(child == par)
continue;
dfs(child , node) ;
}
}
int main()
{
scanf("%d" , &n) ;
for(int i = 0 ; i < n-1 ; ++i)
{
int x , y ;
scanf("%d %d" , &x , &y) ;
adj[x].push_back(y) ;
adj[y].push_back(x) ;
}
int leaves = 0 ;
for(int i = 1 ; i <= n ; ++i)
{
if(adj[i].size() == 1)
leaves++;
}
int start = -1 ;
for(int i = 1 ; i <= n ; ++i)
{
if(adj[i].size() > 1)
{
start = i ;
dfs(start , -1) ;
break;
}
}
int edges = (leaves + 1) / 2 ;
cout<<edges<<"\n";
if(leaves & 1)
{
cout<<v[edges-1]<<" "<<start<<"\n";
}
for(int i = 0 ; v.size()/2 ; ++i)
{
if(i + edges >= v.size())
break;
cout<<v[i]<<" "<<v[i+edges]<<"\n";
}
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... |