제출 #312165

#제출 시각아이디문제언어결과실행 시간메모리
312165AmineTrabelsiTraffic (IOI10_traffic)C++14
50 / 100
578 ms137316 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 sum[M]; void dfs(int i,int par){ sum[i] = people[i]; for(auto u:gr[i]){ if(u!=par){ dfs(u,i); sum[i]+=sum[u]; } } } ll df(int i,int par){ ll res = people[i]; for(auto u:gr[i]){ if(u != par){ res += df(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; dfs(0,0); ll res = 1e18; int city = 0; ll x = 0; for(auto i:gr[0]){ x = max(x,df(i,0)); res = x; } for(int i=1;i<n;i++){ x = max(sum[0]-sum[i],sum[i]-p[i]); if(x < res){ city = i; res = x; } } return city; } /* int main(){ int p[6] = {10,10,10,10,10,10},s[5] = {1,2,3,4,0},d[5] = {5,1,2,1,4}; cout<<LocateCentre(6,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...