# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
991079 | borisAngelov | Traffic (IOI10_traffic) | C++17 | 5 ms | 33112 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "traffic.h"
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000005;
const long long inf = (1LL << 60);
int n;
int a[maxn];
vector<int> g[maxn];
long long ans[maxn];
long long subtreeSum[maxn];
long long down[maxn];
void dfs(int node, int par, int dep)
{
down[node] = 0;
subtreeSum[node] = a[node];
for (int i = 0; i < g[node].size(); ++i)
{
int to = g[node][i];
if (to != par)
{
dfs(to, node, dep + 1);
subtreeSum[node] += subtreeSum[to];
down[node] = max(down[node], subtreeSum[to]);
}
}
}
int LocateCentre(int N, int pp[], int S[], int D[])
{
n = N;
for (int i = 1; i <= n; ++i)
{
a[i] = pp[i - 1];
}
for (int i = 1; i <= n - 1; ++i)
{
int x = S[i - 1];
int y = D[i - 1];
++x;
++y;
g[x].push_back(y);
g[y].push_back(x);
}
long long ans = inf;
int node = -1;
for (int i = 1; i <= n; ++i)
{
dfs(i, -1, 0);
if (ans > down[i])
{
node = i;
ans = down[i];
}
}
return node;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |