# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
113187 | 2019-05-24T08:21:30 Z | davitmarg | Network (BOI15_net) | C++17 | 6 ms | 2688 KB |
/*DavitMarg*/ #include <iostream> #include <algorithm> #include <cmath> #include <vector> #include <string> #include <cstring> #include <map> #include <set> #include <queue> #include <iomanip> #include <bitset> #include <stack> #include <cassert> #include <iterator> #include <ctype.h> #include <fstream> #define mod 1000000007ll #define LL long long #define LD long double #define MP make_pair #define PB push_back #define all(v) v.begin (),v.end() using namespace std; int n,used[100005],start; vector<int> g[100005]; vector<pair<int, int>> ans, t; void dfs(int v, int d = 0) { used[v] = 1; if (g[v].size() == 1) { t.PB(MP(d,v)); } for (int i = 0; i < g[v].size(); i++) { int to = g[v][i]; if (used[to]) continue; dfs(to,d+1); } } int main() { cin >> n; if (n == 0) { printf("0\n"); return 0; } else if (n == 2) { printf("1\n"); printf("1 2\n"); return 0; } for (int i = 1; i < n; i++) { int a, b; scanf("%d%d", &a, &b); g[a].PB(b); g[b].PB(a); } for(int i=1;i<=n;i++) if (g[i].size() != 1) { start = i; break; } dfs(start); sort(all(t)); if (t.size()%2) ans.PB(MP(t[t.size()/2].second, start)); for(int i=0;i<t.size()/2;i++) ans.PB(MP(t[i].second, t[t.size()-1-i].second)); printf("%d\n",(int)ans.size()); for (int i = 0; i < ans.size(); i++) printf("%d %d\n", ans[i].first, ans[i].second); return 0; } /* */
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 2688 KB | Output is correct |
2 | Correct | 4 ms | 2688 KB | Output is correct |
3 | Correct | 4 ms | 2688 KB | Output is correct |
4 | Correct | 3 ms | 2688 KB | Output is correct |
5 | Correct | 3 ms | 2688 KB | Output is correct |
6 | Correct | 4 ms | 2688 KB | Output is correct |
7 | Correct | 4 ms | 2688 KB | Output is correct |
8 | Correct | 4 ms | 2688 KB | Output is correct |
9 | Correct | 4 ms | 2688 KB | Output is correct |
10 | Correct | 4 ms | 2688 KB | Output is correct |
11 | Incorrect | 6 ms | 2688 KB | Breaking single line is causing network to disconnect. |
12 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 2688 KB | Output is correct |
2 | Correct | 4 ms | 2688 KB | Output is correct |
3 | Correct | 4 ms | 2688 KB | Output is correct |
4 | Correct | 3 ms | 2688 KB | Output is correct |
5 | Correct | 3 ms | 2688 KB | Output is correct |
6 | Correct | 4 ms | 2688 KB | Output is correct |
7 | Correct | 4 ms | 2688 KB | Output is correct |
8 | Correct | 4 ms | 2688 KB | Output is correct |
9 | Correct | 4 ms | 2688 KB | Output is correct |
10 | Correct | 4 ms | 2688 KB | Output is correct |
11 | Incorrect | 6 ms | 2688 KB | Breaking single line is causing network to disconnect. |
12 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 2688 KB | Output is correct |
2 | Correct | 4 ms | 2688 KB | Output is correct |
3 | Correct | 4 ms | 2688 KB | Output is correct |
4 | Correct | 3 ms | 2688 KB | Output is correct |
5 | Correct | 3 ms | 2688 KB | Output is correct |
6 | Correct | 4 ms | 2688 KB | Output is correct |
7 | Correct | 4 ms | 2688 KB | Output is correct |
8 | Correct | 4 ms | 2688 KB | Output is correct |
9 | Correct | 4 ms | 2688 KB | Output is correct |
10 | Correct | 4 ms | 2688 KB | Output is correct |
11 | Incorrect | 6 ms | 2688 KB | Breaking single line is causing network to disconnect. |
12 | Halted | 0 ms | 0 KB | - |