Submission #394615

# Submission time Handle Problem Language Result Execution time Memory
394615 2021-04-27T05:55:27 Z woldis4 Network (BOI15_net) C++17
100 / 100
526 ms 69076 KB
# include <bits/stdc++.h>

/*
// ordered_set 
# include <ext/pb_ds/assoc_container.hpp>
# include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
# define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> 
*/

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);
#define MP make_pair

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 = 1e6 + 10;
const int xm = 1e2 + 10;
const int sq = 320;
const int inf = 1e9 + 10;
const ll INF = 1e18 + 10;
const int mod = 998244353;//1e9 + 7;//998244353;
const int base = 257;

ll n, m, k, st[xn], num[xn], cnt = 1;
vector <int> adj[xn];

void dfs(int v, int par = 0){
	num[cnt] = v;
	st[v] = cnt++;
	for (int u : adj[v]){
		if (u != par){
			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);
	}
	int mx = 0, indmx = -1;
	for (int i = 1; i <= n; ++i){
		if (int(adj[i].size()) > mx)	indmx = i, mx = int(adj[i].size());
	}
	dfs(indmx);
	vector <int> vec;
	for (int i = 1; i <= n; ++i){
		if (adj[num[i]].size() == 1)	vec.push_back(num[i]);
	}
	int sz = int(vec.size());
	cout << (sz+1)/2 << '\n';
	if (sz%2 == 1)	cout << vec[0] << ' ' << vec[sz-1] << '\n';
	for (int i = 0; i < sz/2; ++i)	cout << vec[i] << ' ' << vec[sz/2+i] << '\n';
    return 0;
}

/*
6
1 2
2 3
2 4
5 4
6 4

8
1 2
2 3
3 4
4 5
3 6
3 7
3 8
*/
# Verdict Execution time Memory Grader output
1 Correct 16 ms 23756 KB Output is correct
2 Correct 19 ms 23756 KB Output is correct
3 Correct 15 ms 23748 KB Output is correct
4 Correct 15 ms 23756 KB Output is correct
5 Correct 14 ms 23768 KB Output is correct
6 Correct 14 ms 23756 KB Output is correct
7 Correct 13 ms 23756 KB Output is correct
8 Correct 13 ms 23764 KB Output is correct
9 Correct 13 ms 23760 KB Output is correct
10 Correct 13 ms 23720 KB Output is correct
11 Correct 13 ms 23756 KB Output is correct
12 Correct 14 ms 23756 KB Output is correct
13 Correct 13 ms 23756 KB Output is correct
14 Correct 13 ms 23772 KB Output is correct
15 Correct 13 ms 23756 KB Output is correct
16 Correct 13 ms 23808 KB Output is correct
17 Correct 16 ms 23756 KB Output is correct
18 Correct 16 ms 23756 KB Output is correct
19 Correct 14 ms 23756 KB Output is correct
20 Correct 13 ms 23756 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 16 ms 23756 KB Output is correct
2 Correct 19 ms 23756 KB Output is correct
3 Correct 15 ms 23748 KB Output is correct
4 Correct 15 ms 23756 KB Output is correct
5 Correct 14 ms 23768 KB Output is correct
6 Correct 14 ms 23756 KB Output is correct
7 Correct 13 ms 23756 KB Output is correct
8 Correct 13 ms 23764 KB Output is correct
9 Correct 13 ms 23760 KB Output is correct
10 Correct 13 ms 23720 KB Output is correct
11 Correct 13 ms 23756 KB Output is correct
12 Correct 14 ms 23756 KB Output is correct
13 Correct 13 ms 23756 KB Output is correct
14 Correct 13 ms 23772 KB Output is correct
15 Correct 13 ms 23756 KB Output is correct
16 Correct 13 ms 23808 KB Output is correct
17 Correct 16 ms 23756 KB Output is correct
18 Correct 16 ms 23756 KB Output is correct
19 Correct 14 ms 23756 KB Output is correct
20 Correct 13 ms 23756 KB Output is correct
21 Correct 13 ms 23756 KB Output is correct
22 Correct 14 ms 23896 KB Output is correct
23 Correct 14 ms 23888 KB Output is correct
24 Correct 16 ms 23828 KB Output is correct
25 Correct 14 ms 23920 KB Output is correct
26 Correct 15 ms 23908 KB Output is correct
27 Correct 16 ms 23936 KB Output is correct
28 Correct 15 ms 23860 KB Output is correct
29 Correct 16 ms 23892 KB Output is correct
30 Correct 16 ms 23764 KB Output is correct
31 Correct 17 ms 23884 KB Output is correct
32 Correct 15 ms 23700 KB Output is correct
33 Correct 15 ms 23816 KB Output is correct
34 Correct 16 ms 23756 KB Output is correct
35 Correct 14 ms 23756 KB Output is correct
36 Correct 15 ms 23756 KB Output is correct
37 Correct 14 ms 23756 KB Output is correct
38 Correct 15 ms 23780 KB Output is correct
39 Correct 14 ms 23776 KB Output is correct
40 Correct 17 ms 23756 KB Output is correct
41 Correct 14 ms 23756 KB Output is correct
42 Correct 16 ms 23732 KB Output is correct
43 Correct 16 ms 23756 KB Output is correct
44 Correct 16 ms 23752 KB Output is correct
45 Correct 15 ms 23756 KB Output is correct
46 Correct 16 ms 23804 KB Output is correct
47 Correct 19 ms 23816 KB Output is correct
48 Correct 16 ms 23740 KB Output is correct
49 Correct 16 ms 23792 KB Output is correct
50 Correct 18 ms 23756 KB Output is correct
51 Correct 17 ms 23756 KB Output is correct
52 Correct 16 ms 23808 KB Output is correct
53 Correct 17 ms 23812 KB Output is correct
54 Correct 16 ms 23756 KB Output is correct
55 Correct 18 ms 23840 KB Output is correct
56 Correct 17 ms 23800 KB Output is correct
57 Correct 16 ms 23756 KB Output is correct
58 Correct 17 ms 23924 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 16 ms 23756 KB Output is correct
2 Correct 19 ms 23756 KB Output is correct
3 Correct 15 ms 23748 KB Output is correct
4 Correct 15 ms 23756 KB Output is correct
5 Correct 14 ms 23768 KB Output is correct
6 Correct 14 ms 23756 KB Output is correct
7 Correct 13 ms 23756 KB Output is correct
8 Correct 13 ms 23764 KB Output is correct
9 Correct 13 ms 23760 KB Output is correct
10 Correct 13 ms 23720 KB Output is correct
11 Correct 13 ms 23756 KB Output is correct
12 Correct 14 ms 23756 KB Output is correct
13 Correct 13 ms 23756 KB Output is correct
14 Correct 13 ms 23772 KB Output is correct
15 Correct 13 ms 23756 KB Output is correct
16 Correct 13 ms 23808 KB Output is correct
17 Correct 16 ms 23756 KB Output is correct
18 Correct 16 ms 23756 KB Output is correct
19 Correct 14 ms 23756 KB Output is correct
20 Correct 13 ms 23756 KB Output is correct
21 Correct 13 ms 23756 KB Output is correct
22 Correct 14 ms 23896 KB Output is correct
23 Correct 14 ms 23888 KB Output is correct
24 Correct 16 ms 23828 KB Output is correct
25 Correct 14 ms 23920 KB Output is correct
26 Correct 15 ms 23908 KB Output is correct
27 Correct 16 ms 23936 KB Output is correct
28 Correct 15 ms 23860 KB Output is correct
29 Correct 16 ms 23892 KB Output is correct
30 Correct 16 ms 23764 KB Output is correct
31 Correct 17 ms 23884 KB Output is correct
32 Correct 15 ms 23700 KB Output is correct
33 Correct 15 ms 23816 KB Output is correct
34 Correct 16 ms 23756 KB Output is correct
35 Correct 14 ms 23756 KB Output is correct
36 Correct 15 ms 23756 KB Output is correct
37 Correct 14 ms 23756 KB Output is correct
38 Correct 15 ms 23780 KB Output is correct
39 Correct 14 ms 23776 KB Output is correct
40 Correct 17 ms 23756 KB Output is correct
41 Correct 14 ms 23756 KB Output is correct
42 Correct 16 ms 23732 KB Output is correct
43 Correct 16 ms 23756 KB Output is correct
44 Correct 16 ms 23752 KB Output is correct
45 Correct 15 ms 23756 KB Output is correct
46 Correct 16 ms 23804 KB Output is correct
47 Correct 19 ms 23816 KB Output is correct
48 Correct 16 ms 23740 KB Output is correct
49 Correct 16 ms 23792 KB Output is correct
50 Correct 18 ms 23756 KB Output is correct
51 Correct 17 ms 23756 KB Output is correct
52 Correct 16 ms 23808 KB Output is correct
53 Correct 17 ms 23812 KB Output is correct
54 Correct 16 ms 23756 KB Output is correct
55 Correct 18 ms 23840 KB Output is correct
56 Correct 17 ms 23800 KB Output is correct
57 Correct 16 ms 23756 KB Output is correct
58 Correct 17 ms 23924 KB Output is correct
59 Correct 379 ms 48756 KB Output is correct
60 Correct 493 ms 51648 KB Output is correct
61 Correct 16 ms 23756 KB Output is correct
62 Correct 16 ms 23700 KB Output is correct
63 Correct 376 ms 46320 KB Output is correct
64 Correct 17 ms 24140 KB Output is correct
65 Correct 24 ms 25492 KB Output is correct
66 Correct 177 ms 37184 KB Output is correct
67 Correct 509 ms 59952 KB Output is correct
68 Correct 526 ms 69076 KB Output is correct
69 Correct 24 ms 24784 KB Output is correct
70 Correct 116 ms 33444 KB Output is correct
71 Correct 332 ms 54740 KB Output is correct
72 Correct 361 ms 53932 KB Output is correct
73 Correct 114 ms 31300 KB Output is correct
74 Correct 510 ms 50652 KB Output is correct
75 Correct 62 ms 27204 KB Output is correct
76 Correct 343 ms 54388 KB Output is correct
77 Correct 341 ms 54744 KB Output is correct
78 Correct 40 ms 27588 KB Output is correct
79 Correct 505 ms 55076 KB Output is correct
80 Correct 17 ms 24012 KB Output is correct
81 Correct 109 ms 33532 KB Output is correct
82 Correct 406 ms 52700 KB Output is correct
83 Correct 484 ms 50648 KB Output is correct
84 Correct 486 ms 50616 KB Output is correct
85 Correct 491 ms 50596 KB Output is correct
86 Correct 492 ms 51708 KB Output is correct
87 Correct 479 ms 51692 KB Output is correct