# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
23203 | 2017-05-04T13:27:14 Z | iletavcioski | Network (BOI15_net) | C++14 | 0 ms | 2024 KB |
#include<iostream> #include<vector> using namespace std; vector<vector<int> > v; int brojac=0; vector<int> toc; void dfs(int x,int prev) { if(v[x].size()==1) toc.push_back(x); for(int i=0;i<v[x].size();i++) if(v[x][i]!=prev) dfs(v[x][i],x); } int main() { int n; cin>>n; vector<int> vec; v.insert(v.begin(),n+1,vec); if(n==1) { cout<<0<<endl; return 0; } for(int i=0;i<n-1;i++) { int a,b; cin>>a>>b; a--; b--; v[a].push_back(b); v[b].push_back(a); } brojac=0; dfs(0,-1); if(toc.size()%2) { for(int i=0;i<n;i++) { if(v[i].size()>1){ toc.push_back(i); break;} } } cout<<(int)(toc.size())/2<<endl; for(int i=0;i<toc.size()-1;i+=2) { cout<<toc[i]+1<<" "<<toc[i+1]+1<<endl; } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 2024 KB | Output is correct |
2 | Incorrect | 0 ms | 2024 KB | Breaking single line is causing network to disconnect. |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 2024 KB | Output is correct |
2 | Incorrect | 0 ms | 2024 KB | Breaking single line is causing network to disconnect. |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 2024 KB | Output is correct |
2 | Incorrect | 0 ms | 2024 KB | Breaking single line is causing network to disconnect. |
3 | Halted | 0 ms | 0 KB | - |