Submission #928594

#	Time	Username	Problem	Language	Result	Execution time	Memory
928594		OAleksa	Traffic (IOI10_traffic)	C++14	0 / 100	7 ms	33368 KiB

traffic

#include "traffic.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 69;
int dp[N], a[N], ans = 2e9 + 69, gas = -1;
vector<int> g[N];
void dfs(int v, int p) {
   dp[v] = a[v];
   for (auto u : g[v]) {
      if (u == p)
         continue;
      dfs(u, v);
      dp[v] += dp[u];
   }
}
void solve(int v, int p) {
   int mx = 0, s = 0;
   for (auto u : g[v]) {
      if (u == p)
         continue;
      s += dp[u];
      mx = max(mx, dp[u]);
   }
   mx = max(mx, dp[1] - s);
   if (mx <= ans) {
      gas = v;
      ans = mx;
   }
   for (auto u : g[v]) {
      if (u == p)
         continue;
      solve(u, v);
   }
}
int LocateCentre(int n, int p[], int u[], int v[]) {
   for (int i = 0;i < n;i++)
      a[i] = p[i];
   for (int i = 0;i < n - 1;i++) {
      g[u[i]].push_back(v[i]);
      g[v[i]].push_back(u[i]);
   }
   dfs(0, -1);
   solve(0, -1);
   return gas;
}

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