# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
23242 | 2017-05-05T12:33:53 Z | jjwdi0 | Network (BOI15_net) | C++11 | 6 ms | 14224 KB |
#include <bits/stdc++.h> using namespace std; int N; vector<int> v[500005], ans; bool leaf[500005]; void dfs(int x, int p) { for(int it : v[x]) { if(it == p) continue; dfs(it, x); } if((int)v[x].size() == 1) leaf[x] = 1; } int main() { scanf("%d", &N); for(int i=1, x, y; i<N; i++) { scanf("%d %d", &x, &y); v[x].push_back(y); v[y].push_back(x); } for(int i=1; i<=N; i++) if(v[i].size() > 1) { dfs(i, 0); break; } for(int i=1; i<=N; i++) if(leaf[i]) ans.push_back(i); printf("%d\n", (int)(ans.size() + 1) / 2); for(int i=0; i<(ans.size() + 1) / 2; i++) printf("%d %d\n", ans[i], ans[i+ans.size()/2]); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 14224 KB | Output is correct |
2 | Correct | 6 ms | 14224 KB | Output is correct |
3 | Correct | 0 ms | 14224 KB | Output is correct |
4 | Correct | 0 ms | 14224 KB | Output is correct |
5 | Correct | 0 ms | 14224 KB | Output is correct |
6 | Correct | 0 ms | 14224 KB | Output is correct |
7 | Correct | 3 ms | 14224 KB | Output is correct |
8 | Correct | 0 ms | 14224 KB | Output is correct |
9 | Correct | 0 ms | 14224 KB | Output is correct |
10 | Correct | 3 ms | 14224 KB | Output is correct |
11 | Correct | 3 ms | 14224 KB | Output is correct |
12 | Incorrect | 0 ms | 14224 KB | Breaking single line is causing network to disconnect. |
13 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 14224 KB | Output is correct |
2 | Correct | 6 ms | 14224 KB | Output is correct |
3 | Correct | 0 ms | 14224 KB | Output is correct |
4 | Correct | 0 ms | 14224 KB | Output is correct |
5 | Correct | 0 ms | 14224 KB | Output is correct |
6 | Correct | 0 ms | 14224 KB | Output is correct |
7 | Correct | 3 ms | 14224 KB | Output is correct |
8 | Correct | 0 ms | 14224 KB | Output is correct |
9 | Correct | 0 ms | 14224 KB | Output is correct |
10 | Correct | 3 ms | 14224 KB | Output is correct |
11 | Correct | 3 ms | 14224 KB | Output is correct |
12 | Incorrect | 0 ms | 14224 KB | Breaking single line is causing network to disconnect. |
13 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 14224 KB | Output is correct |
2 | Correct | 6 ms | 14224 KB | Output is correct |
3 | Correct | 0 ms | 14224 KB | Output is correct |
4 | Correct | 0 ms | 14224 KB | Output is correct |
5 | Correct | 0 ms | 14224 KB | Output is correct |
6 | Correct | 0 ms | 14224 KB | Output is correct |
7 | Correct | 3 ms | 14224 KB | Output is correct |
8 | Correct | 0 ms | 14224 KB | Output is correct |
9 | Correct | 0 ms | 14224 KB | Output is correct |
10 | Correct | 3 ms | 14224 KB | Output is correct |
11 | Correct | 3 ms | 14224 KB | Output is correct |
12 | Incorrect | 0 ms | 14224 KB | Breaking single line is causing network to disconnect. |
13 | Halted | 0 ms | 0 KB | - |