Submission #745174

#	Time	Username	Problem	Language	Result	Execution time	Memory
745174		Desh03	Traffic (IOI10_traffic)	C++17	0 / 100	1 ms	212 KiB

traffic

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

vector<vector<int>> g;
vector<int> sz, a;
int ans = INT_MAX;

void dfs(int u, int p) {
    sz[u] = a[u];
    for (int v : g[u])
        if (v ^ p)
            dfs(v, u), sz[u] += sz[v];
}

void solve(int u, int p) {
    int x = sz[0] - sz[u];
    for (int v : g[u])
        if (v ^ p)
            solve(v, u), x = max(x, sz[v]);
    ans = min(ans, x);
}

int LocateCentre(int n, int p[], int s[], int d[]) {
    g.resize(n), sz.resize(n), a.resize(n);
    for (int i = 0; i < n; i++) a[i] = p[i];
    for (int i = 0; i < n - 1; i++) {
        g[s[i]].push_back(d[i]);
        g[d[i]].push_back(s[i]);
    }
    dfs(0, 0);
    solve(0, 0);
    return ans;
}

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