Submission #142650

#	Time	Username	Problem	Language	Result	Execution time	Memory
142650		RafaelSus	Transport (COCI19_transport)	C++14	78 / 130	1055 ms	16828 KiB

Main

#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>

using namespace std;
const int maxn = 1e5 + 5;

int n, a[maxn], w[maxn];
vector <pair<int, int>> g[maxn];
int used[maxn];

long long dp1[maxn], ben1[maxn];
long long dp2[maxn], ben2[maxn];
int sz[maxn];
long long answ;

void sizeCounter(int v, int p) {
	sz[v] = 1;
	dp1[v] = dp2[v] = 0;
	ben1[v] = ben2[v] = 0;
	for (size_t i = 0; i < g[v].size(); i++) {
		int to = g[v][i].first;
		if (to == p || used[to]) continue;
		sizeCounter(to, v);
		sz[v] += sz[to];
	}
}


int center = 0;
void findCen(int v, int p) {
	int cnt = sz[v] / 2 + 1;
	for (size_t i = 0; i < g[v].size(); i++) {
		int to = g[v][i].first;
		if (to == p || used[to]) continue;
		if (sz[to] > cnt) {
			center = to;
			findCen(to, v);
		}
	}
}

vector <long long> G;

void push_DP(int v, int p) {
	sz[v] = 1;
	for (size_t i = 0; i < g[v].size(); i++) {
		int to = g[v][i].first;
		int len = g[v][i].second;
		if (to == p || used[to]) continue;

		ben1[to] = ben1[v] + a[v] - len;
		dp1[to] = dp1[v];
		if (ben1[to] < 0) {
			dp1[to] -= ben1[to];
			ben1[to] = 0;
		}

		int d = a[to] - len;
		dp2[to] = dp2[v] + d;
		ben2[to] = min(1ll * d, ben2[v] + d);

		push_DP(to, v);
		sz[v] += sz[to];
	}

	if (ben2[v] >= 0) {
		G.push_back(dp2[v]);
	}
}

int findCenter(int v) {
	sizeCounter(v, -1);
	center = v;
	findCen(v, -1);
	push_DP(center, -1);
	return center;
}


vector <long long> P;
vector <int> ver;

void solve(int v, int p) {

	if (p != -1) {
		ver.push_back(v);
		if (ben2[v] >= 0) {
			P.push_back(dp2[v]);
		}
	}

	int idx = lower_bound(G.begin(), G.end(), dp1[v]) - G.begin();
	answ += (int)G.size() - idx;
	if (p == -1) answ--;

	for (size_t i = 0; i < g[v].size(); i++) {
		int to = g[v][i].first;
		if (to == p || used[to]) continue;
		solve(to, v);
		if (p == -1) {
			sort(P.begin(), P.end());
			for (size_t j = 0; j < ver.size(); j++) {
				int u = ver[j];
				int id = lower_bound(P.begin(), P.end(), dp1[u]) - P.begin();
				answ -= (int)P.size() - id;
			}
			P.clear();
			ver.clear();
		}
	}
}

void centroidDecomposition() {
	queue <int> q;
	q.push(1);
	while (!q.empty()) {
		int v = q.front();
		q.pop();
		v = findCenter(v);
		sort(G.begin(), G.end());
		solve(v, -1);
		G.clear();

		for (size_t i = 0; i < g[v].size(); i++) {
			int to = g[v][i].first;
			if (used[to] || sz[to] == 1) continue;
			q.push(to);
		}
		used[v] = 1;
	}
}



int main() {

	ios_base::sync_with_stdio(false);
	cin.tie(0);

	scanf("%d", &n);
	for (size_t i = 1; i <= n; i++)
		scanf("%d", &a[i]);
	for (size_t i = 0; i < n - 1; i++) {
		int x, y, z;
		scanf("%d%d%d", &x, &y, &z);
		g[x].push_back({ y, z });
		g[y].push_back({ x, z });
	}

	centroidDecomposition();
	printf("%lld\n", answ);
	return 0;
}

Compilation message (stderr)

transport.cpp: In function 'int main()':
transport.cpp:143:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (size_t i = 1; i <= n; i++)
                     ~~^~~~
transport.cpp:145:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (size_t i = 0; i < n - 1; i++) {
                     ~~^~~~~~~
transport.cpp:142:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
  ~~~~~^~~~~~~~~~
transport.cpp:144:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &a[i]);
   ~~~~~^~~~~~~~~~~~~
transport.cpp:147:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d", &x, &y, &z);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 13 / 13
• Subtask 2: 13 / 13
• Subtask 3: 0 / 13
• Subtask 4: 0 / 13
• Subtask 5: 0 / 13
• Subtask 6: 13 / 13
• Subtask 7: 13 / 13
• Subtask 8: 13 / 13
• Subtask 9: 13 / 13
• Subtask 10: 0 / 13