# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
360239 | sumit_kk10 | 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>
#define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
using namespace std;
const int N = 100000 + 5;
const int MOD = 1e9 + 7;
vector<int> graph[N];
int dis[N];
bool vis[N];
void dfs(int source, long long int p[]){
vis[source] = 1;
dis[source] = p[source];
for(auto k : graph[source]){
if(!vis[k]) {
dfs(k, p);
dis[source] += dis[k];
}
}
}
int LocateCentre(int n, long long int p[], int s[], int d[]){
for(int i = 0; i < n - 1; ++i){
graph[s[i]].push_back(d[i]);
graph[d[i]].push_back(s[i]);
}
int mn = INT_MAX;
for(int i = 0; i < n; ++i){
dfs(i, p);
int mx = 0;
for(auto k : graph[i])
mx = max(mx, dis[k]);
mn = min(mn, mx);
for(int j = 0; j < n; ++j)
vis[j] = 0;
}
return mn;
}