Submission #507061

#	Time	Username	Problem	Language	Result	Execution time	Memory
507061		CyberSleeper	Potatoes and fertilizers (LMIO19_bulves)	C++14	24 / 100	90 ms	9296 KiB

bulves

#include <bits/stdc++.h>
#define fastio      ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define debug(x)    cout << "Line " << __LINE__ << ", " << #x << " is " << x << endl
#define fi          first
#define se          second
#define mp          make_pair
#define pb          push_back
#define ll          long long
#define ull         unsigned long long
#define pii         pair<int, int>
#define pll         pair<ll, ll>
#define ld          long double
#define nl          '\n'
#define tb          '\t'
#define sp          ' '
using namespace std;

const int MX=1005, MOD=998244353, BLOCK=327, INF=1e9+7;
const ll INFF=1e18+7;
const ld ERR=1e-7, pi=3.14159265358979323846;

ll N, ans=0, A, B, tot;

int main(){
    fastio;
    cin >> N;
    queue<pll> pos, neg;
    for(int i=1; i<=N; i++){
        cin >> A >> B;
        tot=B-A;
        if(tot<0){
            tot=-tot;
            while(pos.size() && tot){
                ll &idx=pos.front().fi, &val=pos.front().se;
                if(val<=tot){
                    ans+=(i-idx)*val;
                    tot-=val;
                    pos.pop();
                }else{
                    ans+=(i-idx)*tot;
                    val-=tot;
                    tot=0;
                }
            }
            if(tot)
                neg.push({i, tot});
        }else if(tot>0){
            while(neg.size() && tot){
                ll &idx=neg.front().fi, &val=neg.front().se;
                if(val<=tot){
                    ans+=(i-idx)*val;
                    tot-=val;
                    neg.pop();
                }else{
                    ans+=(i-idx)*tot;
                    val-=tot;
                    tot=0;
                }
            }
            if(tot)
                pos.push({i, tot});
        }
    }
    cout << ans;
}

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