Submission #1233346

#	Time	Username	Problem	Language	Result	Execution time	Memory
1233346		MuhammadSaram	Closing Time (IOI23_closing)	C++20	8 / 100	143 ms	22964 KiB

closing

#include "closing.h"
#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define ff first
#define ss second

const int M = 2e5 + 1;
const ll inf = 1e18;

ll dis[M];
vector<pair<int,int>> nei[M];

void dijkstra(int u)
{
	set<pair<ll,int>> se;
	dis[u]=0;
	se.insert({0,u});
	while (!se.empty())
	{
		auto p=*se.begin();se.erase(p);
		for (auto [i,w]:nei[p.second])
			if (dis[i]>p.first+w)
			{
				se.erase({dis[i],i});
				dis[i]=p.first+w;
				se.insert({dis[i],i});
			}
	}
}

int max_score(int n, int x, int y, ll k,vector<int> u, vector<int> v, vector<int> w)
{
	for (int i=0;i<n;i++) nei[i].clear();
	for (int i=0;i<n-1;i++)
		nei[u[i]].push_back({v[i],w[i]}),
		nei[v[i]].push_back({u[i],w[i]});
	for (int i=0;i<n;i++) dis[i]=inf;
	dijkstra(x);
	vector<ll> a;
	for (int i=0;i<n;i++)
		a.push_back(dis[i]);
	for (int i=0;i<n;i++) dis[i]=inf;
	dijkstra(y);
	for (int i=0;i<n;i++)
		a.push_back(dis[i]);
	sort(a.begin(),a.end());
	int ans=0;
	for (int i=0;i<a.size();i++)
		if (a[i]>k)
			break;
		else
			ans++,k-=a[i];
	return ans;
}

• Subtask 0: 0 / 0
• Subtask 1: 8 / 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