Submission #799553

#	Time	Username	Problem	Language	Result	Execution time	Memory
799553		vjudge1	Potatoes and fertilizers (LMIO19_bulves)	C++17	24 / 100	298 ms	14816 KiB

bulves

#include <iostream>
using namespace std;
long long int a[500005], b[500005];
int main() {
    long long int n, c = 0, d = 0;
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i] >> b[i];
        c += a[i];
        d += b[i];
    }
    if (c == d) {
        long long int res = 0;
        for (int i = 1; i <= n; i++) {
            if (a[i] > b[i]) {
                res += a[i] - b[i];
                a[i + 1] += a[i] - b[i];
            }
            else if (a[i] < b[i]) {
                a[i + 1] -= b[i] - a[i];
                res += b[i] - a[i];
                a[i] = b[i];
            }
        }
        cout << res;
    }
}

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