# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
25733 | 2017-06-23T21:18:26 Z | nibnalin | Network (BOI15_net) | C++14 | 0 ms | 3972 KB |
#include <iostream> #include <cstdio> #include <vector> using namespace std; const int maxn = int(5e5)+5; int deg[maxn]; int main(void) { int n, u, v; scanf("%d", &n); for(int i = 1;i < n;i++) { scanf("%d%d", &u, &v); u--, v--; deg[u]++, deg[v]++; } vector<int> leafs; for(int i = 0;i < n;i++) { if(deg[i] == 1) { leafs.push_back(i); } } printf("%d\n", int(leafs.size())/2+int(leafs.size())%2); for(int i = 0;i < int(leafs.size())-1;i += 2) { printf("%d %d\n", leafs[i]+1, leafs[i+1]+1); } if(int(leafs.size()%2)) printf("%d %d\n", leafs[int(leafs.size())-2]+1, leafs[int(leafs.size())-1]+1); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 3972 KB | Output is correct |
2 | Correct | 0 ms | 3972 KB | Output is correct |
3 | Correct | 0 ms | 3972 KB | Output is correct |
4 | Correct | 0 ms | 3972 KB | Output is correct |
5 | Correct | 0 ms | 3972 KB | Output is correct |
6 | Correct | 0 ms | 3972 KB | Output is correct |
7 | Correct | 0 ms | 3972 KB | Output is correct |
8 | Correct | 0 ms | 3972 KB | Output is correct |
9 | Correct | 0 ms | 3972 KB | Output is correct |
10 | Incorrect | 0 ms | 3972 KB | Breaking single line is causing network to disconnect. |
11 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 3972 KB | Output is correct |
2 | Correct | 0 ms | 3972 KB | Output is correct |
3 | Correct | 0 ms | 3972 KB | Output is correct |
4 | Correct | 0 ms | 3972 KB | Output is correct |
5 | Correct | 0 ms | 3972 KB | Output is correct |
6 | Correct | 0 ms | 3972 KB | Output is correct |
7 | Correct | 0 ms | 3972 KB | Output is correct |
8 | Correct | 0 ms | 3972 KB | Output is correct |
9 | Correct | 0 ms | 3972 KB | Output is correct |
10 | Incorrect | 0 ms | 3972 KB | Breaking single line is causing network to disconnect. |
11 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 3972 KB | Output is correct |
2 | Correct | 0 ms | 3972 KB | Output is correct |
3 | Correct | 0 ms | 3972 KB | Output is correct |
4 | Correct | 0 ms | 3972 KB | Output is correct |
5 | Correct | 0 ms | 3972 KB | Output is correct |
6 | Correct | 0 ms | 3972 KB | Output is correct |
7 | Correct | 0 ms | 3972 KB | Output is correct |
8 | Correct | 0 ms | 3972 KB | Output is correct |
9 | Correct | 0 ms | 3972 KB | Output is correct |
10 | Incorrect | 0 ms | 3972 KB | Breaking single line is causing network to disconnect. |
11 | Halted | 0 ms | 0 KB | - |