oj.uz

답안 #879477

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
879477 2023-11-27T14:08:45 Z TAhmed33 Papričice (COCI20_papricice) C++
0 / 110
 2 ms 7260 KB 
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 25;
vector <int> adj[MAXN];
int sze[MAXN], n, in[MAXN], out[MAXN], t;
typedef long long ll;
int mn = 1e9;
void dfs (int pos, int par) {
	sze[pos] = 1;
	in[pos] = ++t;
	int mx = 0;
	for (auto j : adj[pos]) {
		if (j == par) continue;
		dfs(j, pos);
		sze[pos] += sze[j]; mx = max(mx, sze[j]);
	}
	out[pos] = t;
	if (sze[pos] != 1) {
		int x = n - sze[pos];
		mn = min(mn, max({x, sze[pos] - mx, mx}) - min({x, sze[pos] - mx, mx}));
	}
}
bool check (int x, int y) {
	return in[y] < in[x] && in[x] <= out[y];
}
int main () {
	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, -1);
	for (int i = 2; i <= n; i++) {
		for (int j = i + 1; j <= n; j++) {
			if (check(i, j) || check(j, i)) continue;
			int x = n - sze[j] - sze[i];
			mn = min(mn, max({sze[i], sze[j], x}) - min({sze[i], sze[j], x}));
		}
	}
	cout << mn << '\n';
}

Subtask #1
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7256 KB Output is correct
2 Incorrect 1 ms 7260 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7256 KB Output is correct
2 Incorrect 1 ms 7260 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7256 KB Output is correct
2 Incorrect 1 ms 7260 KB Output isn't correct
3 Halted 0 ms 0 KB -