Submission #1151532

#	Time	Username	Problem	Language	Result	Execution time	Memory
1151532		MuhammadSaram	Bikeparking (EGOI24_bikeparking)	C++20	25 / 100	148 ms	16664 KiB

Main

#include <bits/stdc++.h>

using namespace std;

#define all(v) v.begin(), v.end()
#define dis(x,y) min(abs(x-y),2*n-abs(x-y))

int main()
{
	int n;
	cin>>n;
	int a[n],b[n];
	for (int i=0;i<n;i++)
		cin>>a[i];
	set<pair<int,int>> se;
	for (int i=0;i<n;i++)
	{
		cin>>b[i];
		if (b[i]) se.insert({i,b[i]});
	}
	int ans=0;
	for (int i=0;i<n;i++)
	{
		while (a[i] && !se.empty())
		{
			auto it=se.lower_bound({i+1,0});
			if (it==se.end())
			{
				it=se.lower_bound({i,0});
				if (it==se.end())
				{
					it=se.begin();
					pair<int,int> p=*it;
					int mn=min(a[i],p.second);
					a[i]-=mn,ans-=mn;
					se.erase(p);p.second-=mn;
					if (p.second) se.insert(p);
				}
				else
				{
					pair<int,int> p=*it;
					int mn=min(a[i],p.second);
					a[i]-=mn;
					se.erase(p);p.second-=mn;
					if (p.second) se.insert(p);
				}
			}
			else
			{
				pair<int,int> p=*it;
				int mn=min(a[i],p.second);
				a[i]-=mn,ans+=mn;
				se.erase(p);p.second-=mn;
				if (p.second)
					se.insert(p);
			}
		}
	}
	cout<<ans<<endl;
	
	return 0;
}

• Subtask 1: 16 / 16
• Subtask 2: 9 / 9
• Subtask 3: 0 / 19
• Subtask 4: 0 / 24
• Subtask 5: 0 / 32