Submission #314852

#	Time	Username	Problem	Language	Result	Execution time	Memory
314852		LethalPuppy	Traffic (IOI10_traffic)	C++17	100 / 100	1300 ms	126328 KiB

traffic

#include "traffic.h"
#include <bits/stdc++.h>
using namespace std;

const int N = 1e6+5;
vector<int> neighbours[N];
int fans[N], total = 0, res = 0, traffic[N], posans[N], nums = 2e9+1;

void dfs(int u, int v) {
    for (auto &x: neighbours[u]) {
        if (x == v)
            continue;
        dfs(x, u);
        traffic[u] += traffic[x];
        posans[u] = max(posans[u], traffic[x]);
    }
    posans[u] = max(posans[u], total - traffic[u] - fans[u]);
    traffic[u] += fans[u];
}
int LocateCentre(int n, int p[], int s[], int d[]) {
    for (int i = 0; i < n - 1; ++i) {
        neighbours[s[i]].push_back(d[i]), neighbours[d[i]].push_back(s[i]);
        fans[i] = p[i], total += p[i];
    }
    fans[n - 1] = p[n - 1], total += p[n - 1];
    dfs(0, -1);
    for (int i = 0; i < n; ++i) {
        if (nums > posans[i]) {
            nums = posans[i];
            res = i;
        }
    }
    return res;
}

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