Submission #312150

#TimeUsernameProblemLanguageResultExecution timeMemory
312150AmineTrabelsiTraffic (IOI10_traffic)C++14
50 / 100
5100 ms28460 KiB
#include "bits/stdc++.h" using namespace std; using ll = long long; #define pb push_back #define mp make_pair #define f first #define s second #define sz(x) ((int)x.size()) #define all(x) x.begin(),x.end() #define rall(x) x.rbegin(),x.rend() // Hi const int M = 1e6; vector<int> gr[M]; int *people; ll dfs(int i,int par){ ll res = people[i]; for(auto u:gr[i]){ if(u != par){ res += dfs(u,i); } } return res; } ll LocateCentre(int n,int p[],int ff[],int d[]){ for(int i=0;i<n-1;i++){ gr[ff[i]].pb(d[i]); gr[d[i]].pb(ff[i]); } people = p; ll res = 1e18; int city = 0; for(int i=0;i<n;i++){ ll x = 0; for(auto u:gr[i]){ x = max(x,dfs(u,i)); } if(x < res){ city = i; res = x; } } return city; } /* int main(){ int p[5] = {10,10,10,10,50},s[4] = {1,2,3,4},d[4] = {0,0,0,0}; cout<<LocateCentre(5,p,s,d)<<'\n'; return 0; } */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...