Submission #394603

# Submission time Handle Problem Language Result Execution time Memory
394603 2021-04-27T05:46:04 Z AmShZ Network (BOI15_net) C++11
100 / 100
641 ms 51392 KB
// khodaya khodet komak kon
// Toxicity
# include <bits/stdc++.h>

using namespace std;

typedef long long                                        ll;
typedef long double                                      ld;
typedef pair <int, int>                                  pii;
typedef pair <pii, int>                                  ppi;
typedef pair <int, pii>                                  pip;
typedef pair <pii, pii>                                  ppp;
typedef pair <ll, ll>                                    pll;

# define A                                               first
# define B                                               second
# define endl                                            '\n'
# define sep                                             ' '
# define all(x)                                          x.begin(), x.end()
# define kill(x)                                         return cout << x << endl, 0
# define SZ(x)                                           int(x.size())
# define lc                                              id << 1
# define rc                                              id << 1 | 1
# define InTheNameOfGod                                  ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);

ll power(ll a, ll b, ll md) {return (!b ? 1 : (b & 1 ? a * power(a * a % md, b / 2, md) % md : power(a * a % md, b / 2, md) % md));}

const int xn = 5e5 + 10;
const int xm = - 20 + 10;
const int sq = 320;
const int inf = 1e9 + 10;
const ll INF = 1e18 + 10;
const int mod = 998244353;
const int base = 257;

int n, sz[xn], root, m, a[xn];
vector <int> adj[xn];

void plant(int v, int p = - 1){
	sz[v] = 1;
	for (int u : adj[v])
		if (u != p)
			plant(u, v), sz[v] += sz[u];
}
int find_centroid(int v, int p = - 1){
	for (int u : adj[v])
		if (u != p && sz[u] + sz[u] > n)
			return find_centroid(u, v);
	return v;
}
void DFS(int v, int p = - 1){
	if (SZ(adj[v]) == 1)
		a[m ++] = v;
	for (int u : adj[v])
		if (u != p)
			DFS(u, v);
}

int main(){
	InTheNameOfGod;

	cin >> n;
	for (int i = 0; i < n - 1; ++ i){
		int v, u;
		cin >> v >> u;
		adj[v].push_back(u);
		adj[u].push_back(v);
	}
	plant(1);
	root = find_centroid(1);
	DFS(root);
	cout << (m + 1) / 2 << endl;
	for (int i = 0; i < (m + 1) / 2; ++ i)
		cout << a[i] << sep << a[i + m / 2] << endl;

	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 6 ms 11980 KB Output is correct
2 Correct 7 ms 11980 KB Output is correct
3 Correct 7 ms 11980 KB Output is correct
4 Correct 7 ms 11980 KB Output is correct
5 Correct 7 ms 11980 KB Output is correct
6 Correct 8 ms 11980 KB Output is correct
7 Correct 7 ms 11980 KB Output is correct
8 Correct 7 ms 11980 KB Output is correct
9 Correct 7 ms 11980 KB Output is correct
10 Correct 7 ms 11980 KB Output is correct
11 Correct 7 ms 12056 KB Output is correct
12 Correct 7 ms 11980 KB Output is correct
13 Correct 7 ms 11980 KB Output is correct
14 Correct 7 ms 11980 KB Output is correct
15 Correct 7 ms 12072 KB Output is correct
16 Correct 7 ms 11980 KB Output is correct
17 Correct 7 ms 12056 KB Output is correct
18 Correct 7 ms 11980 KB Output is correct
19 Correct 7 ms 11980 KB Output is correct
20 Correct 7 ms 12016 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 6 ms 11980 KB Output is correct
2 Correct 7 ms 11980 KB Output is correct
3 Correct 7 ms 11980 KB Output is correct
4 Correct 7 ms 11980 KB Output is correct
5 Correct 7 ms 11980 KB Output is correct
6 Correct 8 ms 11980 KB Output is correct
7 Correct 7 ms 11980 KB Output is correct
8 Correct 7 ms 11980 KB Output is correct
9 Correct 7 ms 11980 KB Output is correct
10 Correct 7 ms 11980 KB Output is correct
11 Correct 7 ms 12056 KB Output is correct
12 Correct 7 ms 11980 KB Output is correct
13 Correct 7 ms 11980 KB Output is correct
14 Correct 7 ms 11980 KB Output is correct
15 Correct 7 ms 12072 KB Output is correct
16 Correct 7 ms 11980 KB Output is correct
17 Correct 7 ms 12056 KB Output is correct
18 Correct 7 ms 11980 KB Output is correct
19 Correct 7 ms 11980 KB Output is correct
20 Correct 7 ms 12016 KB Output is correct
21 Correct 7 ms 11980 KB Output is correct
22 Correct 8 ms 12108 KB Output is correct
23 Correct 8 ms 12160 KB Output is correct
24 Correct 8 ms 12108 KB Output is correct
25 Correct 7 ms 12112 KB Output is correct
26 Correct 8 ms 12108 KB Output is correct
27 Correct 8 ms 12108 KB Output is correct
28 Correct 7 ms 12108 KB Output is correct
29 Correct 8 ms 12108 KB Output is correct
30 Correct 7 ms 11980 KB Output is correct
31 Correct 8 ms 12104 KB Output is correct
32 Correct 7 ms 11980 KB Output is correct
33 Correct 7 ms 11980 KB Output is correct
34 Correct 7 ms 11980 KB Output is correct
35 Correct 7 ms 11980 KB Output is correct
36 Correct 7 ms 11980 KB Output is correct
37 Correct 8 ms 12108 KB Output is correct
38 Correct 8 ms 12108 KB Output is correct
39 Correct 7 ms 11980 KB Output is correct
40 Correct 7 ms 12084 KB Output is correct
41 Correct 7 ms 11980 KB Output is correct
42 Correct 7 ms 11980 KB Output is correct
43 Correct 7 ms 12108 KB Output is correct
44 Correct 7 ms 12084 KB Output is correct
45 Correct 7 ms 12040 KB Output is correct
46 Correct 8 ms 12108 KB Output is correct
47 Correct 7 ms 11980 KB Output is correct
48 Correct 8 ms 12084 KB Output is correct
49 Correct 7 ms 12108 KB Output is correct
50 Correct 7 ms 11980 KB Output is correct
51 Correct 7 ms 11980 KB Output is correct
52 Correct 7 ms 11980 KB Output is correct
53 Correct 7 ms 12108 KB Output is correct
54 Correct 7 ms 11980 KB Output is correct
55 Correct 7 ms 11980 KB Output is correct
56 Correct 7 ms 11980 KB Output is correct
57 Correct 7 ms 11980 KB Output is correct
58 Correct 8 ms 12108 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 6 ms 11980 KB Output is correct
2 Correct 7 ms 11980 KB Output is correct
3 Correct 7 ms 11980 KB Output is correct
4 Correct 7 ms 11980 KB Output is correct
5 Correct 7 ms 11980 KB Output is correct
6 Correct 8 ms 11980 KB Output is correct
7 Correct 7 ms 11980 KB Output is correct
8 Correct 7 ms 11980 KB Output is correct
9 Correct 7 ms 11980 KB Output is correct
10 Correct 7 ms 11980 KB Output is correct
11 Correct 7 ms 12056 KB Output is correct
12 Correct 7 ms 11980 KB Output is correct
13 Correct 7 ms 11980 KB Output is correct
14 Correct 7 ms 11980 KB Output is correct
15 Correct 7 ms 12072 KB Output is correct
16 Correct 7 ms 11980 KB Output is correct
17 Correct 7 ms 12056 KB Output is correct
18 Correct 7 ms 11980 KB Output is correct
19 Correct 7 ms 11980 KB Output is correct
20 Correct 7 ms 12016 KB Output is correct
21 Correct 7 ms 11980 KB Output is correct
22 Correct 8 ms 12108 KB Output is correct
23 Correct 8 ms 12160 KB Output is correct
24 Correct 8 ms 12108 KB Output is correct
25 Correct 7 ms 12112 KB Output is correct
26 Correct 8 ms 12108 KB Output is correct
27 Correct 8 ms 12108 KB Output is correct
28 Correct 7 ms 12108 KB Output is correct
29 Correct 8 ms 12108 KB Output is correct
30 Correct 7 ms 11980 KB Output is correct
31 Correct 8 ms 12104 KB Output is correct
32 Correct 7 ms 11980 KB Output is correct
33 Correct 7 ms 11980 KB Output is correct
34 Correct 7 ms 11980 KB Output is correct
35 Correct 7 ms 11980 KB Output is correct
36 Correct 7 ms 11980 KB Output is correct
37 Correct 8 ms 12108 KB Output is correct
38 Correct 8 ms 12108 KB Output is correct
39 Correct 7 ms 11980 KB Output is correct
40 Correct 7 ms 12084 KB Output is correct
41 Correct 7 ms 11980 KB Output is correct
42 Correct 7 ms 11980 KB Output is correct
43 Correct 7 ms 12108 KB Output is correct
44 Correct 7 ms 12084 KB Output is correct
45 Correct 7 ms 12040 KB Output is correct
46 Correct 8 ms 12108 KB Output is correct
47 Correct 7 ms 11980 KB Output is correct
48 Correct 8 ms 12084 KB Output is correct
49 Correct 7 ms 12108 KB Output is correct
50 Correct 7 ms 11980 KB Output is correct
51 Correct 7 ms 11980 KB Output is correct
52 Correct 7 ms 11980 KB Output is correct
53 Correct 7 ms 12108 KB Output is correct
54 Correct 7 ms 11980 KB Output is correct
55 Correct 7 ms 11980 KB Output is correct
56 Correct 7 ms 11980 KB Output is correct
57 Correct 7 ms 11980 KB Output is correct
58 Correct 8 ms 12108 KB Output is correct
59 Correct 384 ms 31692 KB Output is correct
60 Correct 461 ms 33972 KB Output is correct
61 Correct 7 ms 11980 KB Output is correct
62 Correct 7 ms 12032 KB Output is correct
63 Correct 346 ms 29724 KB Output is correct
64 Correct 10 ms 12620 KB Output is correct
65 Correct 21 ms 14356 KB Output is correct
66 Correct 204 ms 31696 KB Output is correct
67 Correct 641 ms 50608 KB Output is correct
68 Correct 624 ms 51392 KB Output is correct
69 Correct 16 ms 12876 KB Output is correct
70 Correct 99 ms 19676 KB Output is correct
71 Correct 355 ms 36924 KB Output is correct
72 Correct 367 ms 36152 KB Output is correct
73 Correct 114 ms 17732 KB Output is correct
74 Correct 521 ms 32836 KB Output is correct
75 Correct 32 ms 14668 KB Output is correct
76 Correct 351 ms 36676 KB Output is correct
77 Correct 335 ms 36912 KB Output is correct
78 Correct 37 ms 15300 KB Output is correct
79 Correct 630 ms 47736 KB Output is correct
80 Correct 9 ms 12236 KB Output is correct
81 Correct 116 ms 19684 KB Output is correct
82 Correct 462 ms 34880 KB Output is correct
83 Correct 508 ms 32836 KB Output is correct
84 Correct 535 ms 32836 KB Output is correct
85 Correct 543 ms 32856 KB Output is correct
86 Correct 497 ms 33852 KB Output is correct
87 Correct 542 ms 33876 KB Output is correct