Submission #406536

#	Time	Username	Problem	Language	Result	Execution time	Memory
406536		benk	Traffic (IOI10_traffic)	C++14	100 / 100	1176 ms	156484 KiB

traffic

#include "traffic.h"
#include <bits/stdc++.h>
 
using namespace std;
const int MX = 1e6;
const int INF = 2e9 + 1;
 
int fans = 0;
 
vector<int> adj[MX], nodes(MX), people(MX), children(MX);
 
void dfs (int v, int parent) {
 
	for (auto x: adj[v]) {
		if (x == parent) continue;
		dfs(x, v);
		children[v] += children[x];
		people[v] = max(people[v], children[x]);
	}
 
	people[v] = max(people[v], fans - children[v] - nodes[v]);
 
	children[v] += nodes[v];
}
 
int LocateCentre (int n, int p[], int d[], int s[]) {
	for (int i = 0; i < n; i++) {
		fans += p[i];
		nodes[i] = p[i];
	}
 
	for (int i = 0; i < n - 1; i++) {
		adj[s[i]].push_back(d[i]);
		adj[d[i]].push_back(s[i]);
	}
 
	dfs(0, -1);
 
	int sol = INF, res = -1;
 
	for (int i = 0; i < n; i++) {
		if (people[i] < sol) {
			res = i;
			sol = people[i];
		}
	}
 
	return res;
}

• Subtask 1: 25 / 25
• Subtask 2: 25 / 25
• Subtask 3: 25 / 25
• Subtask 4: 25 / 25