Submission #113190

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
113190	2019-05-24T08:31:41 Z	davitmarg	Network (BOI15_net)	C++17	63 / 100	9 ms	5120 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],t;
vector<pair<int, int>> ans;

void dfs(int v, int d = 0)
{
	used[v] = 1;
	for (int i = 0; i < g[v].size(); i++)
	{
		int to = g[v][i];
		if (used[to])
			continue;
		if (g[to].size() == 1)
			t.PB(to);
	}
	for (int i = 0; i < g[v].size(); i++)
	{
		int to = g[v][i];
		if (used[to] || g[to].size() == 1)
			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);

	for (int i = 0; i + t.size() / 2 < t.size(); i++)
		ans.PB(MP(t[i], t[i+ t.size() / 2]));


	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

net.cpp: In function 'void dfs(int, int)':
net.cpp:33:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < g[v].size(); i++)
                  ~~^~~~~~~~~~~~~
net.cpp:41:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < g[v].size(); i++)
                  ~~^~~~~~~~~~~~~
net.cpp: In function 'int main()':
net.cpp:84:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < ans.size(); i++)
                  ~~^~~~~~~~~~~~
net.cpp:67:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &a, &b);
   ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
18.0 / 18.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
0 / 37.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	2688 KB	Output is correct
2	Correct	5 ms	2688 KB	Output is correct
3	Correct	4 ms	2688 KB	Output is correct
4	Correct	4 ms	2688 KB	Output is correct
5	Correct	4 ms	2688 KB	Output is correct
6	Correct	3 ms	2688 KB	Output is correct
7	Correct	4 ms	2688 KB	Output is correct
8	Correct	3 ms	2688 KB	Output is correct
9	Correct	3 ms	2688 KB	Output is correct
10	Correct	4 ms	2688 KB	Output is correct
11	Correct	3 ms	2688 KB	Output is correct
12	Correct	4 ms	2688 KB	Output is correct
13	Correct	3 ms	2688 KB	Output is correct
14	Correct	3 ms	2688 KB	Output is correct
15	Correct	3 ms	2688 KB	Output is correct
16	Correct	3 ms	2688 KB	Output is correct
17	Correct	4 ms	2688 KB	Output is correct
18	Correct	3 ms	2688 KB	Output is correct
19	Correct	3 ms	2688 KB	Output is correct
20	Correct	3 ms	2688 KB	Output is correct
21	Correct	3 ms	2688 KB	Output is correct
22	Correct	4 ms	2816 KB	Output is correct
23	Correct	5 ms	2816 KB	Output is correct
24	Correct	5 ms	2816 KB	Output is correct
25	Correct	5 ms	2816 KB	Output is correct
26	Correct	5 ms	2688 KB	Output is correct
27	Correct	5 ms	2688 KB	Output is correct
28	Correct	5 ms	2816 KB	Output is correct
29	Correct	5 ms	2816 KB	Output is correct
30	Correct	4 ms	2816 KB	Output is correct
31	Correct	4 ms	2688 KB	Output is correct
32	Correct	4 ms	2688 KB	Output is correct
33	Correct	4 ms	2688 KB	Output is correct
34	Correct	4 ms	2688 KB	Output is correct
35	Correct	4 ms	2688 KB	Output is correct
36	Correct	4 ms	2688 KB	Output is correct
37	Correct	4 ms	2688 KB	Output is correct
38	Correct	4 ms	2688 KB	Output is correct
39	Correct	4 ms	2688 KB	Output is correct
40	Correct	4 ms	2688 KB	Output is correct
41	Correct	4 ms	2688 KB	Output is correct
42	Correct	4 ms	2688 KB	Output is correct
43	Correct	4 ms	2688 KB	Output is correct
44	Correct	3 ms	2688 KB	Output is correct
45	Correct	4 ms	2688 KB	Output is correct
46	Correct	5 ms	2688 KB	Output is correct
47	Correct	4 ms	2688 KB	Output is correct
48	Correct	5 ms	2688 KB	Output is correct
49	Correct	4 ms	2688 KB	Output is correct
50	Correct	4 ms	2688 KB	Output is correct
51	Correct	4 ms	2688 KB	Output is correct
52	Correct	5 ms	2688 KB	Output is correct
53	Correct	5 ms	2688 KB	Output is correct
54	Correct	4 ms	2688 KB	Output is correct
55	Correct	4 ms	2688 KB	Output is correct
56	Correct	4 ms	2688 KB	Output is correct
57	Correct	4 ms	2688 KB	Output is correct
58	Correct	9 ms	2816 KB	Output is correct
59	Runtime error	7 ms	5120 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
60	Halted	0 ms	0 KB	-

Submission #113190

Compilation message

Subtask #1 18.0 / 18.0

Subtask #2 45.0 / 45.0

Subtask #3 0 / 37.0

Subtask #1
18.0 / 18.0

Subtask #2
45.0 / 45.0

Subtask #3
0 / 37.0