# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
32315 | 2017-10-08T14:20:41 Z | dqhungdl | Network (BOI15_net) | C++14 | 3 ms | 14380 KB |
#include <bits/stdc++.h> using namespace std; int n; bool Free[500005]; vector<int> V,g[500005]; void DFS(int u) { Free[u]=true; if(g[u].size()==1) V.push_back(u); for(int i=0;i<g[u].size();i++) if(Free[g[u][i]]==false) DFS(g[u][i]); } int main() { ios_base::sync_with_stdio(false); //freopen("NET.INP","r",stdin); cin>>n; int u,v; for(int i=1;i<n;i++) { cin>>u>>v; g[u].push_back(v); g[v].push_back(u); } DFS(1); int res=(V.size()+1)/2; cout<<res<<"\n"; for(int i=0;i<res;i++) if(i+V.size()/2<V.size()) cout<<V[i]<<' '<<V[i+V.size()/2]<<"\n"; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 14380 KB | Output is correct |
2 | Correct | 3 ms | 14380 KB | Output is correct |
3 | Correct | 0 ms | 14380 KB | Output is correct |
4 | Correct | 0 ms | 14380 KB | Output is correct |
5 | Correct | 3 ms | 14380 KB | Output is correct |
6 | Correct | 3 ms | 14380 KB | Output is correct |
7 | Correct | 3 ms | 14380 KB | Output is correct |
8 | Correct | 3 ms | 14380 KB | Output is correct |
9 | Correct | 0 ms | 14380 KB | Output is correct |
10 | Correct | 3 ms | 14380 KB | Output is correct |
11 | Correct | 3 ms | 14380 KB | Output is correct |
12 | Correct | 3 ms | 14380 KB | Output is correct |
13 | Correct | 0 ms | 14380 KB | Output is correct |
14 | Correct | 0 ms | 14380 KB | Output is correct |
15 | Correct | 3 ms | 14380 KB | Output is correct |
16 | Correct | 0 ms | 14380 KB | Output is correct |
17 | Correct | 3 ms | 14380 KB | Output is correct |
18 | Correct | 0 ms | 14380 KB | Output is correct |
19 | Correct | 3 ms | 14380 KB | Output is correct |
20 | Correct | 3 ms | 14380 KB | Output is correct |