Submission #629116

# Submission time Handle Problem Language Result Execution time Memory
629116 2022-08-14T07:51:50 Z Cyber_Wolf Network (BOI15_net) C++14
63 / 100
9 ms 13140 KB
//Contest: BOI'15 Day 1 Problem 3
//Problem: Net
//Link: https://oj.uz/problem/view/BOI15_net

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("Ofast")

using namespace std;
using namespace __gnu_pbds;

#define lg long long
#define ordered_set	tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args);
#define endl \n
#define lbound(x, y) lower_bound(x.begin(), x.end(), y) 
#define ubound(x, y) upper_bound(x.begin(), x.end(), y) 
#define sortasc(v) sort(v.begin(), v.end())	
#define sortdesc(v) sort(v.rbegin(), v.rend())	
#define custom_array(a,l, r) int _##a[r-l+1]; int*a=_##a-l;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const lg MOD = 1e9+7, N = 2e5+5, M = 1e7+1, SZ = 1e3+1;
/*
bitset<N> primes;
lg pwrs[N], inv[N];

lg fast_power(lg n, lg k)
{
	if(!k)	return 1;
	if(k&1)	return (fast_power(n, k-1)*n)%MOD;
	lg x = fast_power(n, k/2)%MOD;
	return (x*x)%MOD;
}

void sieve()
{
	primes.set();
	primes[0] = primes[1] = 0;
	for(lg i = 2; i < N; i++)
	{
		if(!primes[i])	continue;
		for(lg j = i*i; j < N; j += i)
		{
			primes[j] = 0;
		}
	}
	return;
}

struct matrix
{
	vector<vector<lg>> con = vector<vector<lg>> (SZ, vector<lg> (SZ));
	matrix operator *(const matrix& a)
	{
		matrix product;
		for(int i = 0; i < (lg)con.size(); i++)
		{
			for(int j = 0; j < (lg)a.con[0].size(); j++)
			{
				for(int k = 0; k < (lg)a.con.size(); k++)
				{
					product.con[i][j] = (product.con[i][j]+(con[i][k]*a.con[k][j])%MOD)%MOD; 
				}
			}
		}
		return product;
	}
};

void preprocess(lg x)
{
	inv[2e5] = fast_power(x, MOD-2);
	for(int i = 2e5-1; i > 1; i--)
	{
		inv[i] = (inv[i+1]*i)%MOD;
	}
	pwrs[0] = 1;
	for(int i = 1; i <= 2e5; i++)
	{
		pwrs[i] = (pwrs[i]*i)%MOD;
	}
	return;
}

*/
vector<lg> a, deg(N);
vector<lg> adj[N];
map<lg, lg> mp;

void dfs(lg src, lg par = -1)
{
	if(deg[src] == 1 && !mp.count(src))	a.push_back(src), mp[src] = true;
	for(auto it : adj[src])
	{
		if(par == it)	continue;
		dfs(it, src);
	}
	return;
}

int main()
{
	fastio;
	lg n;
	cin >> n;
	for(int i = 0; i < n-1; i++)
	{
		lg u, v;
		cin >> u >> v;
		adj[u].push_back(v);
		adj[v].push_back(u);
		deg[u]++;
		deg[v]++;
	}
	lg node, mxm_deg = -1;
	for(int i = 1; i <= n; i++)
	{
		if(deg[i] >= mxm_deg)
		{
			mxm_deg = deg[i];
			node = i;
		}
	}
	dfs(node);
	lg x = a.size();
	cout << (x+1)/2 << '\n';
	for(int i = 0; i < (x+1)/2; i++)
	{
		if(i+x/2 >= x)
		{
			cout << a[i] << ' ' << a.back() << '\n';
			break;
		}
		cout << a[i] << ' ' << a[i+x/2] << '\n';
	}

    return 0;
}

Compilation message

net.cpp: In function 'int main()':
net.cpp:127:5: warning: 'node' may be used uninitialized in this function [-Wmaybe-uninitialized]
  127 |  dfs(node);
      |  ~~~^~~~~~
# Verdict Execution time Memory Grader output
1 Correct 5 ms 6484 KB Output is correct
2 Correct 4 ms 6484 KB Output is correct
3 Correct 4 ms 6484 KB Output is correct
4 Correct 5 ms 6484 KB Output is correct
5 Correct 4 ms 6560 KB Output is correct
6 Correct 4 ms 6484 KB Output is correct
7 Correct 4 ms 6484 KB Output is correct
8 Correct 4 ms 6484 KB Output is correct
9 Correct 4 ms 6484 KB Output is correct
10 Correct 4 ms 6484 KB Output is correct
11 Correct 4 ms 6500 KB Output is correct
12 Correct 4 ms 6484 KB Output is correct
13 Correct 3 ms 6484 KB Output is correct
14 Correct 4 ms 6484 KB Output is correct
15 Correct 4 ms 6484 KB Output is correct
16 Correct 4 ms 6484 KB Output is correct
17 Correct 3 ms 6484 KB Output is correct
18 Correct 5 ms 6552 KB Output is correct
19 Correct 3 ms 6484 KB Output is correct
20 Correct 4 ms 6504 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 6484 KB Output is correct
2 Correct 4 ms 6484 KB Output is correct
3 Correct 4 ms 6484 KB Output is correct
4 Correct 5 ms 6484 KB Output is correct
5 Correct 4 ms 6560 KB Output is correct
6 Correct 4 ms 6484 KB Output is correct
7 Correct 4 ms 6484 KB Output is correct
8 Correct 4 ms 6484 KB Output is correct
9 Correct 4 ms 6484 KB Output is correct
10 Correct 4 ms 6484 KB Output is correct
11 Correct 4 ms 6500 KB Output is correct
12 Correct 4 ms 6484 KB Output is correct
13 Correct 3 ms 6484 KB Output is correct
14 Correct 4 ms 6484 KB Output is correct
15 Correct 4 ms 6484 KB Output is correct
16 Correct 4 ms 6484 KB Output is correct
17 Correct 3 ms 6484 KB Output is correct
18 Correct 5 ms 6552 KB Output is correct
19 Correct 3 ms 6484 KB Output is correct
20 Correct 4 ms 6504 KB Output is correct
21 Correct 4 ms 6484 KB Output is correct
22 Correct 6 ms 6740 KB Output is correct
23 Correct 5 ms 6740 KB Output is correct
24 Correct 6 ms 6740 KB Output is correct
25 Correct 6 ms 6740 KB Output is correct
26 Correct 4 ms 6740 KB Output is correct
27 Correct 5 ms 6740 KB Output is correct
28 Correct 4 ms 6740 KB Output is correct
29 Correct 5 ms 6736 KB Output is correct
30 Correct 5 ms 6484 KB Output is correct
31 Correct 6 ms 6740 KB Output is correct
32 Correct 4 ms 6484 KB Output is correct
33 Correct 5 ms 6484 KB Output is correct
34 Correct 5 ms 6484 KB Output is correct
35 Correct 5 ms 6484 KB Output is correct
36 Correct 4 ms 6484 KB Output is correct
37 Correct 3 ms 6612 KB Output is correct
38 Correct 4 ms 6612 KB Output is correct
39 Correct 3 ms 6604 KB Output is correct
40 Correct 3 ms 6604 KB Output is correct
41 Correct 4 ms 6600 KB Output is correct
42 Correct 4 ms 6612 KB Output is correct
43 Correct 6 ms 6612 KB Output is correct
44 Correct 4 ms 6484 KB Output is correct
45 Correct 4 ms 6604 KB Output is correct
46 Correct 3 ms 6612 KB Output is correct
47 Correct 4 ms 6604 KB Output is correct
48 Correct 5 ms 6612 KB Output is correct
49 Correct 4 ms 6612 KB Output is correct
50 Correct 3 ms 6484 KB Output is correct
51 Correct 4 ms 6484 KB Output is correct
52 Correct 5 ms 6604 KB Output is correct
53 Correct 5 ms 6608 KB Output is correct
54 Correct 3 ms 6484 KB Output is correct
55 Correct 4 ms 6600 KB Output is correct
56 Correct 4 ms 6484 KB Output is correct
57 Correct 4 ms 6612 KB Output is correct
58 Correct 5 ms 6740 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 6484 KB Output is correct
2 Correct 4 ms 6484 KB Output is correct
3 Correct 4 ms 6484 KB Output is correct
4 Correct 5 ms 6484 KB Output is correct
5 Correct 4 ms 6560 KB Output is correct
6 Correct 4 ms 6484 KB Output is correct
7 Correct 4 ms 6484 KB Output is correct
8 Correct 4 ms 6484 KB Output is correct
9 Correct 4 ms 6484 KB Output is correct
10 Correct 4 ms 6484 KB Output is correct
11 Correct 4 ms 6500 KB Output is correct
12 Correct 4 ms 6484 KB Output is correct
13 Correct 3 ms 6484 KB Output is correct
14 Correct 4 ms 6484 KB Output is correct
15 Correct 4 ms 6484 KB Output is correct
16 Correct 4 ms 6484 KB Output is correct
17 Correct 3 ms 6484 KB Output is correct
18 Correct 5 ms 6552 KB Output is correct
19 Correct 3 ms 6484 KB Output is correct
20 Correct 4 ms 6504 KB Output is correct
21 Correct 4 ms 6484 KB Output is correct
22 Correct 6 ms 6740 KB Output is correct
23 Correct 5 ms 6740 KB Output is correct
24 Correct 6 ms 6740 KB Output is correct
25 Correct 6 ms 6740 KB Output is correct
26 Correct 4 ms 6740 KB Output is correct
27 Correct 5 ms 6740 KB Output is correct
28 Correct 4 ms 6740 KB Output is correct
29 Correct 5 ms 6736 KB Output is correct
30 Correct 5 ms 6484 KB Output is correct
31 Correct 6 ms 6740 KB Output is correct
32 Correct 4 ms 6484 KB Output is correct
33 Correct 5 ms 6484 KB Output is correct
34 Correct 5 ms 6484 KB Output is correct
35 Correct 5 ms 6484 KB Output is correct
36 Correct 4 ms 6484 KB Output is correct
37 Correct 3 ms 6612 KB Output is correct
38 Correct 4 ms 6612 KB Output is correct
39 Correct 3 ms 6604 KB Output is correct
40 Correct 3 ms 6604 KB Output is correct
41 Correct 4 ms 6600 KB Output is correct
42 Correct 4 ms 6612 KB Output is correct
43 Correct 6 ms 6612 KB Output is correct
44 Correct 4 ms 6484 KB Output is correct
45 Correct 4 ms 6604 KB Output is correct
46 Correct 3 ms 6612 KB Output is correct
47 Correct 4 ms 6604 KB Output is correct
48 Correct 5 ms 6612 KB Output is correct
49 Correct 4 ms 6612 KB Output is correct
50 Correct 3 ms 6484 KB Output is correct
51 Correct 4 ms 6484 KB Output is correct
52 Correct 5 ms 6604 KB Output is correct
53 Correct 5 ms 6608 KB Output is correct
54 Correct 3 ms 6484 KB Output is correct
55 Correct 4 ms 6600 KB Output is correct
56 Correct 4 ms 6484 KB Output is correct
57 Correct 4 ms 6612 KB Output is correct
58 Correct 5 ms 6740 KB Output is correct
59 Runtime error 9 ms 13140 KB Execution killed with signal 11
60 Halted 0 ms 0 KB -