Submission #1133659

#	Time	Username	Problem	Language	Result	Execution time	Memory
1133659		pan	Closing Time (IOI23_closing)	C++20	75 / 100	295 ms	7492 KiB

closing

#include <bits/stdc++.h>
//#include "includeall.h"
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define endl '\n'
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define input(x) scanf("%lld", &x);
#define input2(x, y) scanf("%lld%lld", &x, &y);
#define input3(x, y, z) scanf("%lld%lld%lld", &x, &y, &z);
#define input4(x, y, z, a) scanf("%lld%lld%lld%lld", &x, &y, &z, &a);
#define print(x, y) printf("%lld%c", x, y);
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define all(x) x.begin(), x.end()
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define FOR(i, x, n) for (ll i =x; i<=n; ++i) 
#define RFOR(i, x, n) for (ll i =x; i>=n; --i) 
using namespace std;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
//using namespace __gnu_pbds;
//#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
//#define ordered_multiset tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
typedef long double ld;
typedef pair<ld, ll> pd;
typedef pair<string, ll> psl;
typedef pair<ll, ll> pi;
typedef pair<ll, pi> pii;
typedef pair<pi, pi> piii;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

ll n, x, y;
vector<pi> adj[100005];
vector<ll> distx, disty;


void dfs(ll x, ll p, ll root, vector<ll> & dist)
{
	for (pi u: adj[x])
	{
		if (u.f==p) continue;
		dist[u.f] = dist[x] + u.s;
		dfs(u.f, x, root, dist);
	}
}

int max_score(int N, int X, int Y, long long K, std::vector<int> U, std::vector<int> V, std::vector<int> W)
{
	n = ll(N), x  = X, y = Y;
	for (ll i=0; i<n; ++i) adj[i].clear();
	for (ll i=0; i<n-1; ++i) {adj[U[i]].pb(mp(V[i], W[i])); adj[V[i]].pb(mp(U[i], W[i]));}
	distx.assign(n, 0); disty.assign(n, 0);
	distx[x] = disty[y] = 0;
	dfs(x, -1, x, distx); dfs(y, -1, y, disty);
	vector<ll> dp(2*n + 5, 1e18);
	ll sum = 0, siz = 0;
	for (ll i=0; i<n; ++i) if (distx[i] + disty[i] == distx[y]) siz++, sum += min(distx[i], disty[i]); 
	dp[siz] = sum;
	for (ll j=0; j<n; ++j)
	{
		//show(j);
		vector<ll> newdp = dp;
		for (ll i=1; i<=2*n; ++i) 
		{
			if (distx[j] + disty[j] == distx[y])
			{
				if (i > 0) newdp[i] = min(newdp[i], dp[i-1] + max(distx[j], disty[j]) - min(distx[j], disty[j]));
			}
			else
			{
				if (i > 0) newdp[i] = min(newdp[i], dp[i-1] + min(distx[j], disty[j]));
				if  (i > 1) newdp[i] = min(newdp[i], dp[i-2] + max(distx[j],  disty[j]));
			}
		}
		swap(dp, newdp);
		//for (ll i=0; i<2*n; ++i) show2(i, dp[i]);
	}
	sum = 0, siz = 0;
	vector<ll> v;
	for (ll i=0; i<n; ++i) v.pb(min(distx[i], disty[i]));
	sort(all(v));
	for (ll i=0; i<n; ++i) if (sum + v[i] <= K) {sum += v[i], siz++;}
	dp[siz] = min(dp[siz], sum);
	//show(siz);
	for (ll i=2*n; i>=0; --i) {if (K >= dp[i]) return i;}
	return 0;
}

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