# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
373483 | eulerdesoja | 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<bits/stdc++.h>
#include<fstream>
using namespace std;
#define int long long
#define pb push_back
#define sz(x) int(x.size())
typedef pair<int,int>ii;
typedef vector<int> vi;
void setIO(string s) {
ios_base::sync_with_stdio(0); cin.tie(0);
freopen((s+".in").c_str(),"r",stdin);
freopen((s+".out").c_str(),"w",stdout);
}
const int mxn=1e6+6;
vi g[mxn];
int n,a[mxn],ma[mxn],sum[mxn];//maximum of congestion in a road
void dfs(int i,int p){
for(int j:g[i])if(j!=p){
dfs(j,i);
sum[i]+=sum[j];
ma[i]=max(ma[i],max(ma[j],sum[j]));
}
sum[i]+=a[i];
}
int32_t main(){
ios_base::sync_with_stdio(0);cin.tie(0);