Submission #1288059

#	Time	Username	Problem	Language	Result	Execution time	Memory
1288059		BlockOG	Traffic (IOI10_traffic)	C++20	100 / 100	502 ms	192184 KiB

traffic

#include <bits/stdc++.h>

// mrrrow meeow :3
// go play vivid/stasis now! https://vividstasis.gay

#define fo(i, a, b) for (auto i = (a); i < (b); i++)
#define of(i, a, b) for (auto i = (b); i-- > (a);)
#define f first
#define s second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define be(a) a.begin(), a.end()
using namespace std;

int ____init = [] {
    ios::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    return 0;
}();

int sum;
vector<int> adj[1000000];

pair<int, pair<int, int>> dfs(int i, int m[], int p=-1) {
    int this_sum = m[i];
    int max_sum = 0;

    int mi = 0;
    int ms = INT_MAX;
    for (int j : adj[i]) {
        if (j == p) continue;
        auto [sub_sum, sub_min] = dfs(j, m, i);
        this_sum += sub_sum, max_sum = max(max_sum, sub_sum);
        if (sub_min.s < ms) mi = sub_min.f, ms = sub_min.s;
    }

    if (max(max_sum, sum - this_sum) < ms) mi = i, ms = max(max_sum, sum - this_sum);
    return {this_sum, {mi, ms}};
}

int LocateCentre(int n, int m[], int a[], int b[]) {
    sum = 0;
    fo(i, 0, n) sum += m[i];
    fo(i, 0, n - 1) adj[a[i]].pb(b[i]), adj[b[i]].pb(a[i]);
    return dfs(0, m).s.f;
}

• Subtask 1: 25 / 25
• Subtask 2: 25 / 25
• Subtask 3: 25 / 25
• Subtask 4: 25 / 25