Submission #1233245

#	Time	Username	Problem	Language	Result	Execution time	Memory
1233245		MuhammadSaram	Closing Time (IOI23_closing)	C++20	0 / 100	114 ms	24688 KiB

closing

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

using namespace std;

#define ll long long

int max_score(int n, int x, int y, ll k,vector<int> u, vector<int> v, vector<int> w)
{
	int pre[n]={};
	for (int i=0;i<n-1;i++)
		pre[i+1]=pre[i]+w[i];
	set<pair<int,int>> se;
	map<int,int> sc;
	for (int i=0;i<n;i++)
	{
		int d=abs(pre[i]-pre[x]),d1=abs(pre[i]-pre[y]);
		if (d>d1) swap(d,d1);
		se.insert({d,i});
		sc[i]=d1-d;
	}
	int ans=0;
	while (se.size())
	{
		pair<int,int> p=*se.begin();se.erase(se.begin());
		if (k<p.first) break;
		k-=p.first,ans++;
		if (sc.count(p.second))
			se.insert({sc[p.second],p.second}),sc.erase(p.second);
	}
	return ans;
	
    return 0;
}

• 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