oj.uz

Submission #642094

# Submission time Handle Problem Language Result Execution time Memory
642094 2022-09-18T12:52:02 Z vovamr Transport (COCI19_transport) C++17
130 / 130
 779 ms 20612 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fi first
#define se second
#define ll long long
#define ld long double
#define sz(x) ((int)(x).size())
#define all(x) 	(x).begin(), (x).end()
#define pb push_back
#define mpp make_pair
#define ve vector
using namespace std;
using namespace __gnu_pbds;
template<class T> using oset = tree<T,null_type,less_equal<T>,rb_tree_tag,tree_order_statistics_node_update>;
const ll inf = 1e18; const int iinf = 1e9;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T> inline bool chmin(T& a, T b) { return (a > b ? a = b, 1 : 0); }
template <typename T> inline bool chmax(T& a, T b) { return (a < b ? a = b, 1 : 0); }

const int N = 1e5 + 10;
ve<pii> gr[N];
int sz[N], used[N], a[N];
inline void dfs1(int v, int p) {
	sz[v] = 1;
	for (auto &[to, w] : gr[v]) {
		if (used[to] || to == p) continue;
		dfs1(to, v); sz[v] += sz[to];
	}
}
inline int centroid(int v, int p, int n) {
	for (auto &[to, w] : gr[v]) {
		if (used[to] || to == p || sz[to] <= n / 2) continue;
		return centroid(to, v, n);
	} return v;
}

ll ans = 0;

int PTR = 0;
pll al[N];

inline void dfs(int v, int p, ll cur_sum, ll mn_sum) {

	if (mn_sum >= 0) ++ans;

	al[PTR++] = {cur_sum, mn_sum};
	for (auto &[to, w] : gr[v]) {
		if (to == p || used[to]) continue;

		ll s = cur_sum + a[v] - w;
		dfs(to, v, s, min(mn_sum, s));
	}
}

oset<ll> sums;

inline void dfs2(int v, int p, int pw, ll tot, ll mn_sum) {
	auto [A, B] = mpp(tot, mn_sum);

	tot += a[v] - pw;
	mn_sum += a[v] - pw;
	chmin(mn_sum, 0ll);

	if (mn_sum >= 0) {
		ans += 1 + sz(sums) - sums.order_of_key(-tot);
	}

	for (auto &[to, w] : gr[v]) {
		if (to == p || used[to]) continue;
		dfs2(to, v, w, tot, mn_sum);
	}

	tie(tot, mn_sum) = mpp(A, B);
}

inline void cd(int v, int p) {
	used[v] = 1; dfs1(v, p);

	PTR = 0;
	for (auto &[to, w] : gr[v]) {
		if (to == p || used[to]) continue;
		dfs(to, v, a[v] - w, a[v] - w);
	}

	sums.clear();
	for (int i = 0; i < PTR; ++i) {
		auto &[sum, mn_sum] = al[i];
		sums.insert(mn_sum);
	}

	int pos = 0;
	for (auto &[to, w] : gr[v]) {
		if (to == p || used[to]) continue;
		for (int i = pos; i < pos + sz[to]; ++i) {
			auto &[sum, mn_sum] = al[i];
			sums.erase(sums.lower_bound(mn_sum - 1));
		}

		dfs2(to, v, w, 0, 0);

		for (int i = pos; i < pos + sz[to]; ++i) {
			auto &[sum, mn_sum] = al[i];
			sums.insert(mn_sum);
		}
		pos += sz[to];
	}

	for (auto &[to, w] : gr[v]) {
		if (to == p || used[to]) continue;
		int c = centroid(to, v, sz[to]);
		cd(c, v);
	}
}

inline void solve() {
	int n;
	cin >> n;
	for (int i = 0; i < n; ++i) cin >> a[i];
	for (int i = 1; i < n; ++i) {
		int v, u, w;
		cin >> v >> u >> w, --v, --u;
		gr[v].pb({u, w}), gr[u].pb({v, w});
	}

	dfs1(0, 0);
	int c = centroid(0, 0, n);

	cd(c, c);
	cout << ans;
}

signed main() {
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	int q = 1; // cin >> q;
	while (q--) solve();
	cerr << fixed << setprecision(3) << "Time execution: " << (double)clock() / CLOCKS_PER_SEC << endl;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 3068 KB Output is correct
2 Correct 11 ms 3220 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 3284 KB Output is correct
2 Correct 26 ms 3540 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 276 ms 9276 KB Output is correct
2 Correct 280 ms 9044 KB Output is correct

Subtask #4
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 424 ms 11864 KB Output is correct
2 Correct 429 ms 13328 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 602 ms 15144 KB Output is correct
2 Correct 655 ms 20612 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 158 ms 6092 KB Output is correct
2 Correct 80 ms 5892 KB Output is correct

Subtask #7
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 146 ms 8656 KB Output is correct
2 Correct 256 ms 8216 KB Output is correct

Subtask #8
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 311 ms 10304 KB Output is correct
2 Correct 318 ms 10944 KB Output is correct

Subtask #9
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 429 ms 12444 KB Output is correct
2 Correct 483 ms 13232 KB Output is correct

Subtask #10
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 779 ms 15356 KB Output is correct
2 Correct 657 ms 16488 KB Output is correct