oj.uz

Submission #366526

# Submission time Handle Problem Language Result Execution time Memory
366526 2021-02-14T10:34:33 Z VEGAnn Papričice (COCI20_papricice) C++14
50 / 110
 1000 ms 13164 KB 
#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.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5100 KB Output is correct
2 Correct 4 ms 5100 KB Output is correct
3 Correct 4 ms 5100 KB Output is correct
4 Correct 4 ms 5100 KB Output is correct
5 Correct 4 ms 5100 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5100 KB Output is correct
2 Correct 4 ms 5100 KB Output is correct
3 Correct 4 ms 5100 KB Output is correct
4 Correct 4 ms 5100 KB Output is correct
5 Correct 4 ms 5100 KB Output is correct
6 Correct 79 ms 5100 KB Output is correct
7 Correct 85 ms 5228 KB Output is correct
8 Correct 69 ms 5100 KB Output is correct
9 Correct 70 ms 5228 KB Output is correct
10 Correct 82 ms 5100 KB Output is correct

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5100 KB Output is correct
2 Correct 4 ms 5100 KB Output is correct
3 Correct 4 ms 5100 KB Output is correct
4 Correct 4 ms 5100 KB Output is correct
5 Correct 4 ms 5100 KB Output is correct
6 Correct 79 ms 5100 KB Output is correct
7 Correct 85 ms 5228 KB Output is correct
8 Correct 69 ms 5100 KB Output is correct
9 Correct 70 ms 5228 KB Output is correct
10 Correct 82 ms 5100 KB Output is correct
11 Execution timed out 1097 ms 13164 KB Time limit exceeded
12 Halted 0 ms 0 KB -