제출 #366526

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
366526		VEGAnn	Papričice (COCI20_papricice)	C++14	50 / 110	1097 ms	13164 KiB

papricice

#include <bits/stdc++.h>
#define PB push_back
#define i2 array<int,2>
using namespace std;
typedef long long ll;
const int N = 200100;
const int oo = 2e9;
vector<int> g[N];
int tt = 1, n, siz[N];
int ans = oo, glob = -1, SIZ[N], PEPA;

void get_dfs(int v, int p){
    SIZ[v] = 1;

    for (int u : g[v]){
        if (u == p) continue;

        get_dfs(u, v);

        SIZ[v] += SIZ[u];
    }

    ans = min(ans, max(abs(PEPA - SIZ[v]), max(abs(PEPA - (glob - SIZ[v])), abs(SIZ[v] - (glob - SIZ[v])))));
}

void dfs(int v, int p){
    siz[v] = 1;

    for (int u : g[v]){
        if (u == p) continue;

        dfs(u, v);

        siz[v] += siz[u];
    }

    if (v == 0) return;

    if (siz[v] <= n - siz[v]){
        glob = n - siz[v];
        PEPA = siz[v];

        get_dfs(p, v);
    }

    if (siz[v] >= n - siz[v]){
        glob = siz[v];
        PEPA = n - siz[v];

        get_dfs(v, p);
    }
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);

#ifdef _LOCAL
    freopen("in.txt","r",stdin);
#endif // _LOCAL

    cin >> n;

    for (int i = 1; i < n; i++){
        int x, y; cin >> x >> y; x--; y--;

        g[x].PB(y);
        g[y].PB(x);
    }

    dfs(0, -1);

    cout << ans;

    return 0;
}

• Subtask 1: 15 / 15
• Subtask 2: 35 / 35
• Subtask 3: 0 / 60