Submission #895969

#	Time	Username	Problem	Language	Result	Execution time	Memory
895969		omsincoconut	Potatoes and fertilizers (LMIO19_bulves)	C++17	0 / 100	7 ms	2396 KiB

bulves

#include <bits/stdc++.h>

using namespace std;

typedef long long int lli;
typedef long double ld;
typedef pair<ld, ld> pld;
typedef pair<lli, lli> pll;
#define mp(x, y) make_pair(x, y)

const lli MAXN = 5e5+5;

lli N;
lli a[MAXN], b[MAXN];

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

    cin >> N;
    for (lli i = 0; i < N; i++) cin >> a[i] >> b[i];
    lli c[N];
    for (lli i = 0; i < N; i++) c[i] = a[i] - b[i];

    lli ans = 0;
    for (lli j = 1; j < N; j++) {
        for (lli i = 0; i < N-j; i++) {
            if (c[i] > 0 && c[i+j] < 0) {
                lli val = min(c[i], -c[i+j]);
                ans += j*val;
                c[i] -= val;
                c[i+j] += val;
            }
        }
        for (lli i = N-j-1; i >= 0; i--) {
            if (c[i] < 0 && c[i+j] > 0) {
                lli val = min(-c[i], c[i+j]);
                ans += j*val;
                c[i] += val;
                c[i+j] -= val;
            }
        }
    }

    cout << ans;

    return 0;
}

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