Submission #979967

#	Time	Username	Problem	Language	Result	Execution time	Memory
979967		vjudge1	Closing Time (IOI23_closing)	C++17	0 / 100	73 ms	23376 KiB

closing

#include "closing.h"
#include <bits/stdc++.h>
#define ll long long
#define rep(a,b,c) for(int a=b; a<c; a++)
#define repa(a,b) for(auto a:b)
#define pll pair<ll, ll>
#define fi first
#define se second
#define pb push_back

using namespace std;

const int lim=2e5+5;
vector<pll> adj[lim];
bool vis[lim];
ll K2, a[lim];

int max_score(int N, int X, int Y, ll K, vector<int> U, vector<int> V, vector<int> W){
	ll ans=0, dis[N];
	rep(i,0,N) adj[i].clear();
        rep(i,0,N-1){
		adj[U[i]].pb({V[i],W[i]});
		adj[V[i]].pb({U[i],W[i]});
		dis[i]=1e18+5;
	}

	priority_queue<pll, vector<pll>, greater<pll>> pq;
	pq.push({0,X});
	pq.push({0,Y});
	while(pq.size()){
		pll act=pq.top();
		pq.pop();
		if(act.fi>dis[act.se]) continue;
		dis[act.se]=act.fi;
		if(K>=act.fi) ans++, K-=act.fi;
		else break;
		repa(e,adj[act.se]){
			if(dis[e.fi]>act.fi+e.se){
				pq.push({act.fi+e.se,e.fi});
				dis[e.fi]=act.fi+e.se;
			}
		}
	}
	return ans;
}

• 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