# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
270269 | shinjan | 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 <iostream>
#include <bits/stdc++.h>
#define maxN 1000001
using namespace std;
vector<int> drvo[maxN];
int subtree[maxN];
int fans[maxN];
pair<int,int> ans={-1,INT_MAX};
int dfs(int v,int par)
{
int sz=fans[v];
for(int x:drvo[v])
{
if(x!=par)
{
sz+=dfs(x,v);
}
}
subtree[v]=sz;
return sz;
}
void reshi(int v,int par)
{
int lokal=0;
if(par!=-1)
{
lokal=subtree[par]-subtree[v];
}
for(int x:drvo[v])
{