oj.uz

Submission #715717

# Submission time Handle Problem Language Result Execution time Memory
715717 2023-03-27T15:33:24 Z Koful123 Papričice (COCI20_papricice) C++17
50 / 110
 220 ms 596 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 = 2e3 + 5;
int ans = 1e18,n;
vector<int> adj[N],sz(N),cnt(N);

void calc(int node,int p,int val){
	cnt[node] = 1;
	for(int go : adj[node]){
		if(go == p) continue;
		calc(go,node,val);
		cnt[node] += cnt[go];
	}
	int cur = n - val;
	vector<int> tmp = {cnt[node],cur - cnt[node],val};
	sort(tmp.begin(),tmp.end());
	ans = min(ans,tmp[2] - tmp[0]);
}

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];
	}
	calc(p,node,sz[node]);
}

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);
	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 2 ms 400 KB Output is correct
2 Correct 2 ms 400 KB Output is correct
3 Correct 3 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 3 ms 340 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 400 KB Output is correct
2 Correct 2 ms 400 KB Output is correct
3 Correct 3 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 210 ms 476 KB Output is correct
7 Correct 220 ms 492 KB Output is correct
8 Correct 151 ms 468 KB Output is correct
9 Correct 199 ms 488 KB Output is correct
10 Correct 204 ms 480 KB Output is correct

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 400 KB Output is correct
2 Correct 2 ms 400 KB Output is correct
3 Correct 3 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 210 ms 476 KB Output is correct
7 Correct 220 ms 492 KB Output is correct
8 Correct 151 ms 468 KB Output is correct
9 Correct 199 ms 488 KB Output is correct
10 Correct 204 ms 480 KB Output is correct
11 Runtime error 1 ms 596 KB Execution killed with signal 11
12 Halted 0 ms 0 KB -