# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
503194 | Hacv16 | Traffic (IOI10_traffic) | C++17 | 402 ms | 152736 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 "traffic.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int MAX = 1e6 + 15;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
#define pb push_back
#define sz(x) (int) x.size()
#define fr first
#define sc second
#define mp make_pair
#define all(x) x.begin(), x.end()
int fans = 0;
vector<int> adj[MAX], child(MAX), cong(MAX), fan(MAX);
//child keeps number of children, cong worst congestion, fan number of fans in ith city
void dfs(int x, int p){
for(auto v : adj[x]){
if(v == p) continue;
dfs(v, x);
child[x] += child[v];
cong[x] = max(cong[x], child[v]); //maximum congestion
Compilation message (stderr)
# | 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... |