# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
373496 | eulerdesoja | Traffic (IOI10_traffic) | C++14 | 1352 ms | 163564 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 ll long long
#define pb push_back
#define sz(x) int(x.size())
typedef pair<int,int>ii;
typedef vector<int> vi;
const int mxn=1e6+6;
//maximum of congestion in a road
vi g[mxn];
int ma[mxn],sum[mxn];
void dfs(int i,int p,int a[]){
for(int j:g[i])if(j!=p){
dfs(j,i,a);
sum[i]+=sum[j];
}
sum[i]+=a[i];
}
void dfs1(int i,int p){
for(int j:g[i])if(j!=p){
ma[i]=max(ma[i],sum[j]);
dfs1(j,i);
}
ma[i]=max(ma[i],sum[0]-sum[i]);
}
# | 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... |