| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 342000 | freshmintt | Traffic (IOI10_traffic) | C++11 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <iostream>
#include <fstream>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <cstdio>
#include <fstream>
#include <string.h>
#include <iterator>
#include <list>
#include <cmath>
#include <math.h>
#include <unordered_map>
#include <numeric>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pi;
vector<int> adj[5]; // change
ll people[5]; // change
multiset<ll> sums[5]; // change
ll subtree[5]; // change
void dfsSubtree(ll node, ll parent, ll parentSum) {
// sums[node].insert(parentSum); // record the cumulative sum from root
subtree[node] += people[node];
for (auto u: adj[node]) {
if (u != parent) { // traverse to the next node, adding on the parentSum
// the subtree sum of the next node must be returned and added
dfsSubtree(u, node, parentSum + people[node]);
subtree[node] += subtree[u]; // subtree u is the sum for the child
sums[node].insert(subtree[u]);
}
}
}
void dfsParents(ll node, ll parent, ll parentSum) {
sums[node].insert(parentSum);
for (auto u : adj[node]) {
if (u != parent) {
ll res = subtree[0]-subtree[u];
// cout << "going from: "<< node << " to " << u << ", parentsum: " << res << endl;
// must send parentSum = entire tree sum - dest node subtree
dfsParents(u, node, res);
// subtree[node] += subtree[u]; // subtree u is the sum for the child
// sums[node].insert(subtree[u]);
}
}
}
int LocateCentre(int N,int P[N],int S[N-1], int D[N-1]) {
for (int i = 0; i <N-1; i ++) {
adj[S[i]].push_back(D[i]);
adj[D[i]].push_back(S[i]);
}
for (int i = 0; i < N; i ++) {
people[i] = P[i];
}
// for (auto i : people) {
// cout << i << " ";
// }
// cout << endl;
// for (auto item : adj) {
// for (auto i : item) {
// cout << i << " ";
// }
// cout << endl;
// }
dfsSubtree(0, -1, 0);
// for (auto item : subtree) {
// cout << item << " " << endl;
// }
// cout << "now for all sums" << endl;
dfsParents(0, -1, 0);
// for (auto item : sums) {
// for (auto i : item) {
// cout << i << " ";
// }
// cout << endl;
// }
ll minRoad = 1E12;
ll city = -1;
for (int i = 0; i < N; i++) {
if (*sums[i].rbegin() < minRoad) {
minRoad = *sums[i].rbegin();
city = i;
}
}
return city;
}
// int main() {
// int P[5] = {10,10,10,20,20};
// int S[4] = {1, 2, 2, 3};
// int D[4] = {2, 0, 3, 4};
// cout << LocateCentre(5, P, S, D);
// }