Submission #993142

#	Time	Username	Problem	Language	Result	Execution time	Memory
993142		vyshniak_n	Potatoes and fertilizers (LMIO19_bulves)	C++17	100 / 100	107 ms	25040 KiB

bulves

//#pragma optimize("Ofast")
//#pragma optimize("unroll-loops")
//#pragma traget("avx,avx2")

#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstdint>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <queue>
#include <ctime>
#include <stack>
#include <set>
#include <list>
#include <random>
#include <deque>
#include <functional>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <complex>
#include <numeric>
#include <cassert>
#include <array>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <thread>

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

#define el '\n'
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define point pair <ll, ll>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

using namespace std;

#include <random>
mt19937 rnd(time(0));

const ll INF = 1e18 + 10;
const ll inf = 1e9 + 10;
const ll maxn = 5e5 + 10;
const ll mod = 1e9 + 7;
const ll K = 7e6 + 100;
const ll LOG = 20;

ll a[maxn], b[maxn], pref[maxn];

void solve() {
    ll n;
    cin >> n;

    for (ll i = 1; i <= n; i++)
        cin >> a[i] >> b[i];

    for (ll i = 1; i <= n; i++)
        pref[i] = pref[i - 1] + a[i] - b[i];

    priority_queue <ll> pq;

    ll ans = 0;
    for (ll i = 1; i <= n; i++) {
        if (pref[i] < 0) {
            ans += abs(pref[i]);
            pref[i] = 0;
        } else if (pref[i] > pref[n]) {
            ans += pref[i] - pref[n];
            pref[i] = pref[n];
        }

        pq.push(pref[i]);
        pq.push(pref[i]);
        ans += pq.top() - pref[i];
        pq.pop();
    }

    cout << ans << el;
    return;
}
signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    int tests = 1;
    //cin >> tests;

    while (tests--) 
        solve();
    return 0;
}
/*
*/

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