169622025-05-19 17:31:31algoproAutózáscpp17Wrong answer 25/10082ms14720 KiB
// UUID: b14c7124-f1c8-44ea-a2cd-4410d5ac0dc9
// UUID: f9b27519-2e84-4482-8372-723d5a1506a8
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int n; cin>>n;
	int k; cin>>k;
	vector<int> kov(n+1),ar(n+1);
	for(int i=1; i<=n; i++)
		cin>>kov[i]>>ar[i];
	vector<int> pref(n+1);
	for(int i=1; i<=n; i++)
		pref[i]=pref[i-1]+kov[i];
	vector<int> hany(n+1),marad(n+1, k);
	int ans=0;
	deque<int> q;
	for(int i=1; i<=n; i++)
	{
		while(!q.empty() && ar[i]<=ar[q.front()]) q.pop_front();
		q.push_front(i);
		int kell=kov[i];
		int tart=pref[i-1];
		while(kell>0)
		{
			while(!q.empty() && pref[q.back()]<tart-k) q.pop_back();
			int ind=q.back();
			if(marad[ind]>kell)
			{
				hany[ind]+=kell;
				marad[ind]-=kell;
				tart+=kell;
				ans+=kell*ar[ind];
				kell=0;
			}
			else
			{
				hany[ind]+=marad[ind];
				kell-=marad[ind];
				ans+=marad[ind]*ar[ind];
				tart+=marad[ind];
				marad[ind]=0;
				q.pop_back();
			}
		}
	}
	vector<array<int, 2>> s;
	for(int i=1; i<=n; i++)
		if(hany[i]>0) s.push_back({i,hany[i]});
	cout<<ans<<" "<<s.size()<<"\n";
	for(auto &[a,b]:s)
		cout<<a<<" "<<b<<"\n";
}
SubtaskSumTestVerdictTimeMemory
base25/100
1Accepted0/01ms316 KiB
2Wrong answer0/064ms12084 KiB
3Accepted5/51ms316 KiB
4Accepted5/51ms316 KiB
5Accepted5/51ms316 KiB
6Accepted5/51ms316 KiB
7Accepted5/51ms316 KiB
8Wrong answer0/51ms508 KiB
9Wrong answer0/51ms316 KiB
10Wrong answer0/51ms316 KiB
11Wrong answer0/514ms2904 KiB
12Wrong answer0/524ms4304 KiB
13Wrong answer0/519ms3916 KiB
14Wrong answer0/539ms7476 KiB
15Wrong answer0/552ms9072 KiB
16Wrong answer0/548ms8676 KiB
17Wrong answer0/552ms8992 KiB
18Wrong answer0/546ms8364 KiB
19Wrong answer0/575ms13232 KiB
20Wrong answer0/581ms13640 KiB
21Wrong answer0/582ms14064 KiB
22Wrong answer0/582ms14720 KiB