# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
146829 | 2019-08-26T10:44:36 Z | muhammad_hokimiyon | Network (BOI15_net) | C++14 | 9 ms | 5240 KB |
#include <bits/stdc++.h> //#pragma GCC optimize("Ofast") #define LL long long #define se second #define fi first using namespace std; const int N = 2e5 + 7; const int mod = 1e9 + 7; const int B = sqrt(N); int n; bool used[N]; vector < int > v[N]; vector < int > ans; int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); //freopen( "input.txt" , "r" , stdin ); //freopen( "output.txt" , "w" , stdout ); cin >> n; for( int i = 1; i < n; i++ ){ int x,y; cin >> x >> y; v[x].push_back(y); v[y].push_back(x); } int x = 1; for( int i = 1; i <= n; i++ ){ if( v[i].size() == 1 ){ ans.push_back(i); } } int k = ans.size() / 2; cout << ( (int)ans.size() + 1 ) / 2 << "\n"; for( int i = 0; i < ( ans.size() + 1) / 2; i++ ){ cout << ans[i] << " " << ans[ (i + k) ] << "\n"; } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 4984 KB | Output is correct |
2 | Correct | 8 ms | 4984 KB | Output is correct |
3 | Correct | 6 ms | 4984 KB | Output is correct |
4 | Correct | 6 ms | 4984 KB | Output is correct |
5 | Correct | 9 ms | 4984 KB | Output is correct |
6 | Correct | 6 ms | 4984 KB | Output is correct |
7 | Correct | 8 ms | 5084 KB | Output is correct |
8 | Correct | 8 ms | 5240 KB | Output is correct |
9 | Correct | 8 ms | 5112 KB | Output is correct |
10 | Correct | 7 ms | 5112 KB | Output is correct |
11 | Correct | 6 ms | 4984 KB | Output is correct |
12 | Incorrect | 6 ms | 4984 KB | Breaking single line is causing network to disconnect. |
13 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 4984 KB | Output is correct |
2 | Correct | 8 ms | 4984 KB | Output is correct |
3 | Correct | 6 ms | 4984 KB | Output is correct |
4 | Correct | 6 ms | 4984 KB | Output is correct |
5 | Correct | 9 ms | 4984 KB | Output is correct |
6 | Correct | 6 ms | 4984 KB | Output is correct |
7 | Correct | 8 ms | 5084 KB | Output is correct |
8 | Correct | 8 ms | 5240 KB | Output is correct |
9 | Correct | 8 ms | 5112 KB | Output is correct |
10 | Correct | 7 ms | 5112 KB | Output is correct |
11 | Correct | 6 ms | 4984 KB | Output is correct |
12 | Incorrect | 6 ms | 4984 KB | Breaking single line is causing network to disconnect. |
13 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 4984 KB | Output is correct |
2 | Correct | 8 ms | 4984 KB | Output is correct |
3 | Correct | 6 ms | 4984 KB | Output is correct |
4 | Correct | 6 ms | 4984 KB | Output is correct |
5 | Correct | 9 ms | 4984 KB | Output is correct |
6 | Correct | 6 ms | 4984 KB | Output is correct |
7 | Correct | 8 ms | 5084 KB | Output is correct |
8 | Correct | 8 ms | 5240 KB | Output is correct |
9 | Correct | 8 ms | 5112 KB | Output is correct |
10 | Correct | 7 ms | 5112 KB | Output is correct |
11 | Correct | 6 ms | 4984 KB | Output is correct |
12 | Incorrect | 6 ms | 4984 KB | Breaking single line is causing network to disconnect. |
13 | Halted | 0 ms | 0 KB | - |