Submission #1065383

#	Time	Username	Problem	Language	Result	Execution time	Memory
1065383		Gromp15	Closing Time (IOI23_closing)	C++17	0 / 100	82 ms	24572 KiB

closing

#include <bits/stdc++.h>
#include "closing.h"
#define ar array
#define ll long long
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using namespace std;
template<typename T> bool ckmin(T &a, const T &b) { return a > b ? a = b, 1 : 0; }
template<typename T> bool ckmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; }
 
const ll INF = 1e18;
 
int max_score(int n, int X, int Y, long long K,
              std::vector<int> U, std::vector<int> V, std::vector<int> W) {
	vector<vector<ar<int, 2>>> adj(n+1);
	for (int i = 0; i < n-1; i++) {
		adj[U[i]].push_back({V[i], W[i]});
		adj[V[i]].push_back({U[i], W[i]});
	}
	vector<vector<ll>> d(2, vector<ll>(n, INF));
	vector<int> p(n, -1);
	auto dfs = [&](auto&& s, int v, vector<ll>& dist) -> void {
		for (auto [u, w] : adj[v]) if (u != p[v]) {
			p[u] = v, dist[u] = dist[v] + w;
			s(s, u, dist);
		}
	};
	d[0][X] = 0, d[1][Y] = 0;
	dfs(dfs, X, d[0]);
	fill(all(p), -1);
	dfs(dfs, Y, d[1]);
	priority_queue<ar<ll, 3>, vector<ar<ll, 3>>, greater<ar<ll, 3>>> q;
	vector<int> ans(n);
	ans[X] = 1, ans[Y] = 2;
	for (auto [u, w] : adj[X]) q.push({d[0][u] - d[0][X], u, 0});
	for (auto [u, w] : adj[Y]) q.push({d[0][u] - d[0][Y], u, 1});
	ll used = 0;
	while (q.size()) {
		auto [cost, v, u] = q.top(); q.pop();
		if (used + cost > K) break;
		used += cost;
		ans[v] |= 1 << u;
		for (auto [u2, w2] : adj[u]) if (!(ans[u2] >> u & 1)) q.push({d[u][u2] - d[u][v], u2, u});
	}
	int ans2 = 0;
	for (int x : ans) ans2 += __builtin_popcount(x);
	return ans2;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 8
• Subtask 2: 0 / 9
• Subtask 3: 0 / 12
• Subtask 4: 0 / 14
• Subtask 5: 0 / 9
• Subtask 6: 0 / 11
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 17