# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
287911 | Bill_00 | 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 <traffic.h>
#include <bits/stdc++.h>
#define ll long long
using namespace std;
vector<long long>adj[1000001];
vector<long long>leaf;
long long p[1000001];
long long sum[1000001];
long long dp[1000001],vis[1000001];
ll b[1000001];
void dfs(ll j){
if(adj[j].size()==1 && p[j]==adj[j][0]){
leaf.push_back(j);
return;
}
for(ll i=0;i<adj[j].size();i++){
if(adj[j][i]!=p[j]){
p[adj[j][i]]=j;
dfs(adj[j][i]);
}
}
}
long long calc(ll j){
sum[j]=(long long)b[j];
for(ll i=0;i<adj[j].size();i++){
if(adj[j][i]!=p[j]){
sum[j]+=calc(adj[j][i]);
}
}
return sum[j];