Submission #311451

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
311451	2020-10-10T08:58:43 Z	sofapuden	Network (BOI15_net)	C++14	100 / 100	1056 ms	60012 KB

#include <bits/stdc++.h>

using namespace std;

vector<vector<int>> v;
vector<int> o;
vector<int> lea;

void dfs(int x, int p){
	for(int y : v[x]){
		if(y == p)continue;
		dfs(y,x);
	}
	o.push_back(x);
}

int main(){
	int n; cin >> n;
	v.resize(n);
	for(int i = 0; i < n-1; ++i){
		int a, b; cin >> a >> b;
		a--, b--;
		v[a].push_back(b);
		v[b].push_back(a);
	}
	int root = 0;
	for(int i = 0; i < n; ++i){
		if(v[i].size() >= 2)root = i;
	}
	dfs(root,root);
	for(int x : o){
		if(v[x].size() == 1)lea.push_back(x);
	}
	int ln = lea.size();
	cout << (ln+1)/2 << "\n";
	for(int i = 0; i < ln/2; ++i){
		cout << lea[i]+1 << " " << lea[(ln+1)/2+i]+1 << "\n";
	}
	if(ln&1){
		cout << root+1 << " " << lea[ln/2]+1 << "\n";
	}
		
}

Subtask #1
18.0 / 18.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	1 ms	256 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Correct	0 ms	256 KB	Output is correct
6	Correct	0 ms	256 KB	Output is correct
7	Correct	0 ms	256 KB	Output is correct
8	Correct	1 ms	256 KB	Output is correct
9	Correct	0 ms	256 KB	Output is correct
10	Correct	1 ms	256 KB	Output is correct
11	Correct	1 ms	256 KB	Output is correct
12	Correct	1 ms	256 KB	Output is correct
13	Correct	0 ms	256 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	256 KB	Output is correct
16	Correct	1 ms	256 KB	Output is correct
17	Correct	0 ms	256 KB	Output is correct
18	Correct	1 ms	256 KB	Output is correct
19	Correct	1 ms	256 KB	Output is correct
20	Correct	1 ms	384 KB	Output is correct

Subtask #2
45.0 / 45.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	1 ms	256 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Correct	0 ms	256 KB	Output is correct
6	Correct	0 ms	256 KB	Output is correct
7	Correct	0 ms	256 KB	Output is correct
8	Correct	1 ms	256 KB	Output is correct
9	Correct	0 ms	256 KB	Output is correct
10	Correct	1 ms	256 KB	Output is correct
11	Correct	1 ms	256 KB	Output is correct
12	Correct	1 ms	256 KB	Output is correct
13	Correct	0 ms	256 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	256 KB	Output is correct
16	Correct	1 ms	256 KB	Output is correct
17	Correct	0 ms	256 KB	Output is correct
18	Correct	1 ms	256 KB	Output is correct
19	Correct	1 ms	256 KB	Output is correct
20	Correct	1 ms	384 KB	Output is correct
21	Correct	1 ms	256 KB	Output is correct
22	Correct	3 ms	512 KB	Output is correct
23	Correct	3 ms	512 KB	Output is correct
24	Correct	3 ms	512 KB	Output is correct
25	Correct	3 ms	512 KB	Output is correct
26	Correct	2 ms	384 KB	Output is correct
27	Correct	3 ms	512 KB	Output is correct
28	Correct	3 ms	512 KB	Output is correct
29	Correct	2 ms	384 KB	Output is correct
30	Correct	0 ms	256 KB	Output is correct
31	Correct	4 ms	512 KB	Output is correct
32	Correct	1 ms	256 KB	Output is correct
33	Correct	0 ms	256 KB	Output is correct
34	Correct	1 ms	256 KB	Output is correct
35	Correct	1 ms	256 KB	Output is correct
36	Correct	1 ms	256 KB	Output is correct
37	Correct	1 ms	384 KB	Output is correct
38	Correct	1 ms	384 KB	Output is correct
39	Correct	1 ms	256 KB	Output is correct
40	Correct	1 ms	256 KB	Output is correct
41	Correct	1 ms	384 KB	Output is correct
42	Correct	1 ms	384 KB	Output is correct
43	Correct	2 ms	384 KB	Output is correct
44	Correct	0 ms	256 KB	Output is correct
45	Correct	1 ms	384 KB	Output is correct
46	Correct	2 ms	384 KB	Output is correct
47	Correct	0 ms	256 KB	Output is correct
48	Correct	1 ms	384 KB	Output is correct
49	Correct	2 ms	384 KB	Output is correct
50	Correct	1 ms	256 KB	Output is correct
51	Correct	1 ms	256 KB	Output is correct
52	Correct	1 ms	384 KB	Output is correct
53	Correct	2 ms	384 KB	Output is correct
54	Correct	1 ms	256 KB	Output is correct
55	Correct	1 ms	384 KB	Output is correct
56	Correct	1 ms	256 KB	Output is correct
57	Correct	1 ms	384 KB	Output is correct
58	Correct	3 ms	512 KB	Output is correct

Subtask #3
37.0 / 37.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	1 ms	256 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Correct	0 ms	256 KB	Output is correct
6	Correct	0 ms	256 KB	Output is correct
7	Correct	0 ms	256 KB	Output is correct
8	Correct	1 ms	256 KB	Output is correct
9	Correct	0 ms	256 KB	Output is correct
10	Correct	1 ms	256 KB	Output is correct
11	Correct	1 ms	256 KB	Output is correct
12	Correct	1 ms	256 KB	Output is correct
13	Correct	0 ms	256 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	256 KB	Output is correct
16	Correct	1 ms	256 KB	Output is correct
17	Correct	0 ms	256 KB	Output is correct
18	Correct	1 ms	256 KB	Output is correct
19	Correct	1 ms	256 KB	Output is correct
20	Correct	1 ms	384 KB	Output is correct
21	Correct	1 ms	256 KB	Output is correct
22	Correct	3 ms	512 KB	Output is correct
23	Correct	3 ms	512 KB	Output is correct
24	Correct	3 ms	512 KB	Output is correct
25	Correct	3 ms	512 KB	Output is correct
26	Correct	2 ms	384 KB	Output is correct
27	Correct	3 ms	512 KB	Output is correct
28	Correct	3 ms	512 KB	Output is correct
29	Correct	2 ms	384 KB	Output is correct
30	Correct	0 ms	256 KB	Output is correct
31	Correct	4 ms	512 KB	Output is correct
32	Correct	1 ms	256 KB	Output is correct
33	Correct	0 ms	256 KB	Output is correct
34	Correct	1 ms	256 KB	Output is correct
35	Correct	1 ms	256 KB	Output is correct
36	Correct	1 ms	256 KB	Output is correct
37	Correct	1 ms	384 KB	Output is correct
38	Correct	1 ms	384 KB	Output is correct
39	Correct	1 ms	256 KB	Output is correct
40	Correct	1 ms	256 KB	Output is correct
41	Correct	1 ms	384 KB	Output is correct
42	Correct	1 ms	384 KB	Output is correct
43	Correct	2 ms	384 KB	Output is correct
44	Correct	0 ms	256 KB	Output is correct
45	Correct	1 ms	384 KB	Output is correct
46	Correct	2 ms	384 KB	Output is correct
47	Correct	0 ms	256 KB	Output is correct
48	Correct	1 ms	384 KB	Output is correct
49	Correct	2 ms	384 KB	Output is correct
50	Correct	1 ms	256 KB	Output is correct
51	Correct	1 ms	256 KB	Output is correct
52	Correct	1 ms	384 KB	Output is correct
53	Correct	2 ms	384 KB	Output is correct
54	Correct	1 ms	256 KB	Output is correct
55	Correct	1 ms	384 KB	Output is correct
56	Correct	1 ms	256 KB	Output is correct
57	Correct	1 ms	384 KB	Output is correct
58	Correct	3 ms	512 KB	Output is correct
59	Correct	877 ms	36792 KB	Output is correct
60	Correct	1002 ms	40680 KB	Output is correct
61	Correct	1 ms	256 KB	Output is correct
62	Correct	0 ms	256 KB	Output is correct
63	Correct	765 ms	32872 KB	Output is correct
64	Correct	7 ms	896 KB	Output is correct
65	Correct	33 ms	2808 KB	Output is correct
66	Correct	343 ms	18848 KB	Output is correct
67	Correct	1056 ms	60012 KB	Output is correct
68	Correct	1045 ms	52840 KB	Output is correct
69	Correct	19 ms	1664 KB	Output is correct
70	Correct	260 ms	13916 KB	Output is correct
71	Correct	853 ms	43872 KB	Output is correct
72	Correct	850 ms	42724 KB	Output is correct
73	Correct	250 ms	11500 KB	Output is correct
74	Correct	1020 ms	40524 KB	Output is correct
75	Correct	82 ms	5116 KB	Output is correct
76	Correct	868 ms	43732 KB	Output is correct
77	Correct	837 ms	43736 KB	Output is correct
78	Correct	83 ms	5240 KB	Output is correct
79	Correct	1042 ms	47220 KB	Output is correct
80	Correct	5 ms	640 KB	Output is correct
81	Correct	284 ms	14824 KB	Output is correct
82	Correct	920 ms	41700 KB	Output is correct
83	Correct	999 ms	40684 KB	Output is correct
84	Correct	1002 ms	40812 KB	Output is correct
85	Correct	1000 ms	40556 KB	Output is correct
86	Correct	997 ms	40932 KB	Output is correct
87	Correct	994 ms	40804 KB	Output is correct

Submission #311451

Compilation message

Subtask #1 18.0 / 18.0

Subtask #2 45.0 / 45.0

Subtask #3 37.0 / 37.0

Subtask #1
18.0 / 18.0

Subtask #2
45.0 / 45.0

Subtask #3
37.0 / 37.0