# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
100586 | 2019-03-12T14:42:29 Z | MohamedAhmed0 | Network (BOI15_net) | C++14 | 15 ms | 12160 KB |
#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(edges & 1) { cout<<v.back()<<" "<<start<<"\n"; } for(int i = 0 ; i + edges < v.size() ; ++i) cout<<v[i]<<" "<<v[i+edges]<<"\n"; return 0 ; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 15 ms | 12160 KB | Breaking single line is causing network to disconnect. |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 15 ms | 12160 KB | Breaking single line is causing network to disconnect. |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 15 ms | 12160 KB | Breaking single line is causing network to disconnect. |
2 | Halted | 0 ms | 0 KB | - |