#include "traffic.h"
#include <bits/stdc++.h>
using namespace std;
int mxN = 1e6;
int fans = 0;
vector<vector<int>> g(mxN);
vector<int> citySize(mxN), subTreeSize(mxN), maxTraffic(mxN), people(mxN);
void dfs(int cur, int par){
for(auto e: g[cur]) {
if(e == par) return;
dfs(e,cur);
subTreeSize[cur] += subTreeSize[e];
people[cur] = max(people[cur], subTreeSize[e]);
}
people[cur] = max(people[cur], fans - subTreeSize[cur] - citySize[cur]);
subTreeSize[cur] += citySize[cur];
}
int LocateCentre(int n, int p[], int d[], int s[]){
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++) {
fans += p[i];
citySize[i] = p[i];
}
dfs(0,0);
int ans = 0, minPeople = 1e9;
for(int i=0; i<n; i++){
if(people[i] < minPeople) {
minPeople = people[i];
ans = i;
}
}
return ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
28 ms |
39532 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
28 ms |
39532 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
28 ms |
39532 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
28 ms |
39532 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |