# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
231729 | AlexLuchianov | Traffic (IOI10_traffic) | C++14 | 0 ms | 0 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 "grader.h"
#include "traffic.h"
#include <vector>
#include <iostream>
using namespace std;
int const nmax = 1000000;
char v[1 + nmax * 2];
int v[1 + nmax], sum[1 + nmax];
int far[1 + nmax];
vector<int> g[1 + nmax];
void dfs(int node, int parent){
far[node] = parent;
sum[node] = v[node];
for(int h = 0; h < g[node].size(); h++){
int to = g[node][h];
if(to != parent) {
dfs(to, node);
sum[node] += sum[to];
}
}
}
int eval(int node){
int result = sum[1] - sum[node];
for(int h = 0; h < g[node].size(); h++){
int to = g[node][h];
if(to != far[node])