제출 #334322

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
334322		limabeans	Potatoes and fertilizers (LMIO19_bulves)	C++17	24 / 100	103 ms	11244 KiB

bulves

#include <bits/stdc++.h>
using namespace std;

template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl





using ll = long long;


const int maxn = 1e6 + 5;


int n;
ll a[maxn];
ll b[maxn];

int main() {
    ios_base::sync_with_stdio(false); cin.tie(0);  cout.tie(0);

    cin>>n;
    ll A = 0;
    ll B = 0;
    for (int i=0; i<n; i++) {
	cin>>a[i]>>b[i];
	A += a[i];
	B += b[i];
    }

    assert(A==B);

    ll res = 0;
    int ptr = 0;
    for (int i=0; i<n; i++) {
	while (b[i]>0) {
	    while (a[ptr]==0) ++ptr;
	    ll cur = min(b[i],a[ptr]);
	    res += 1ll*abs(ptr-i)*cur;
	    a[ptr] -= cur;
	    b[i] -= cur;
	}
    }

    cout<<res<<endl;    
    return 0;
}

• Subtask 1: 24 / 24
• Subtask 2: 0 / 10
• Subtask 3: 0 / 20
• Subtask 4: 0 / 10
• Subtask 5: 0 / 36