oj.uz

Submission #732950

# Submission time Handle Problem Language Result Execution time Memory
732950 2023-04-29T17:39:49 Z Koful123 Papričice (COCI20_papricice) C++17
15 / 110
 10 ms 16184 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define ff first
#define ss second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
 
const int N = 2e5 + 5;
int ans = 1e18,n; set<int> s[N];
vector<int> adj[N],sz(N);
 
void merge(set<int> &a,set<int> &b){
	if(a.size() < b.size()) swap(a,b);
	for(int x : b){
		a.insert(x);
	}
}
 
void dfs(int node,int p){
	sz[node] = 1;
	for(int go : adj[node]){
		if(go == p) continue;
		dfs(go,node);
		sz[node] += sz[go];
		merge(s[node],s[go]);
	}
	s[node].insert(sz[node]);
	auto f = s[node].upper_bound(sz[node] / 2);
	if(f != s[node].end()){
		vector<int> tmp = {*f,sz[node] - *f,n - sz[node]};
		sort(tmp.begin(),tmp.end());
		ans = min(ans,tmp[2] - tmp[0]);
	}
	if(f != s[node].begin()){
		auto s = prev(f);
		vector<int> tmp = {*s,sz[node] - *s,n - sz[node]};
		sort(tmp.begin(),tmp.end());
		ans = min(ans,tmp[2] - tmp[0]);	
	}
}
 
void solve(){
 
	cin >> n;
	for(int i = 1; i < n; i++){
		int a,b; cin >> a >> b;
		adj[a].push_back(b);
		adj[b].push_back(a);
	}


	dfs(1,0); 
	for(int i = 1; i <= n; i++){
		sz[i] = 0; s[i].clear();
	}

	int leaf = 0;
	for(int i = 1; i <= n; i++){
		if(adj[i].size() == 1){
			leaf = i;
		}
	}

	dfs(leaf,0);
	cout << ans << endl;
}
 
signed main(){ 
 
	ios::sync_with_stdio(0);
	cin.tie(0);
 
	int t = 1;
//	cin >> t;
 
	while(t--)
		solve();
 	
	return 0;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 15900 KB Output is correct
2 Correct 8 ms 15992 KB Output is correct
3 Correct 8 ms 15956 KB Output is correct
4 Correct 8 ms 15956 KB Output is correct
5 Correct 8 ms 15904 KB Output is correct

Subtask #2
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 15900 KB Output is correct
2 Correct 8 ms 15992 KB Output is correct
3 Correct 8 ms 15956 KB Output is correct
4 Correct 8 ms 15956 KB Output is correct
5 Correct 8 ms 15904 KB Output is correct
6 Correct 9 ms 16084 KB Output is correct
7 Incorrect 10 ms 16184 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 15900 KB Output is correct
2 Correct 8 ms 15992 KB Output is correct
3 Correct 8 ms 15956 KB Output is correct
4 Correct 8 ms 15956 KB Output is correct
5 Correct 8 ms 15904 KB Output is correct
6 Correct 9 ms 16084 KB Output is correct
7 Incorrect 10 ms 16184 KB Output isn't correct
8 Halted 0 ms 0 KB -