170592025-05-20 18:02:59algoproAutózáscpp17Wrong answer 50/100180ms13108 KiB
// UUID: 56122bd1-088c-4a2d-81e2-be83a33aceb9
#include <bits/stdc++.h>
using namespace std;

#define int long long

signed main() {
	int n, k;
	cin >> n >> k;
	vector<int> d(n), c(n), dp(n), prefix(n+1);
	for(int i=0;i<n;i++) cin >> d[i] >> c[i];
	for(int i=1;i<=n;i++) prefix[i]=prefix[i-1]+d[i-1];
	deque<int> dq;
	int gas=0,  cost=0;
	vector<int> capacity(n, k);
	for(int i=0;i<n;i++){
		while(!dq.empty() && c[i]<=c[dq.back()]) dq.pop_back();
		while(!dq.empty() && k<prefix[i]-prefix[dq.front()]) dq.pop_front();
		dq.push_back(i);
		int dist=d[i];
		gas-=dist;
		for(int j=0;j<dq.size();j++){
			int amount=min(min(k-(prefix[i]-prefix[dq[j]]), capacity[dq[j]]), min(k-gas, dist));
			dist-=amount;
			capacity[dq[j]]-=amount;
			cost+=amount*c[dq[j]];
			gas+=amount;
			//cout << dq.front() << ' ' << amount << '\n';
			if(0==dist) break;
		}
	}
	int tankNum=0;
	for(int x : capacity) tankNum+=(x<k);
	cout << cost << ' ' << tankNum << '\n';
	for(int i=0;i<n;i++) if(capacity[i]<k) cout << i+1 << ' ' << k-capacity[i] << '\n';
}
SubtaskSumTestVerdictTimeMemory
base50/100
1Accepted0/01ms496 KiB
2Accepted0/0155ms12084 KiB
3Accepted5/51ms316 KiB
4Accepted5/51ms500 KiB
5Accepted5/51ms316 KiB
6Accepted5/51ms316 KiB
7Accepted5/51ms316 KiB
8Accepted5/51ms316 KiB
9Accepted5/51ms316 KiB
10Accepted5/51ms364 KiB
11Wrong answer0/530ms2796 KiB
12Wrong answer0/550ms4040 KiB
13Accepted5/546ms3996 KiB
14Accepted5/589ms7416 KiB
15Wrong answer0/5108ms7952 KiB
16Wrong answer0/5104ms7732 KiB
17Wrong answer0/5108ms7732 KiB
18Wrong answer0/5101ms7476 KiB
19Wrong answer0/5160ms11700 KiB
20Wrong answer0/5165ms12084 KiB
21Wrong answer0/5172ms12596 KiB
22Wrong answer0/5180ms13108 KiB