Submission #1236103

#TimeUsernameProblemLanguageResultExecution timeMemory
1236103islam_2010Traffic (IOI10_traffic)C++20
0 / 100
5093 ms35288 KiB
#include "traffic.h"
#include <bits/stdc++.h>
using namespace std;

const int sz = 1e6+6;

vector<int> g[sz];
vector<int> sub(sz);
int s = 0;
int mn = 2e9+5;
void dfs(int node, int p){

    int mx = 0;
    for(auto i: g[node]){
        if(i!=p){
            dfs(i, node);
        }sub[node] += sub[i];
        mx = max(mx, sub[i]);

    }
    mx=max(mx, s-sub[node]);
    mn = min(mn, mx);

}

int LocateCentre(int n, int P[], int S[], int D[]){
    for(int i = 0; i < n-1; i++){
        g[S[i]].push_back(D[i]);
        g[D[i]].push_back(S[i]);
    }for(int i = 0; i < n; i++){
        s += P[i];
        sub[i] = P[i];
    }dfs(0, -1);
    cout << mn << endl;
}

Compilation message (stderr)

traffic.cpp: In function 'int LocateCentre(int, int*, int*, int*)':
traffic.cpp:35:1: warning: no return statement in function returning non-void [-Wreturn-type]
   35 | }
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...