Submission #912376

#	Time	Username	Problem	Language	Result	Execution time	Memory
912376		vjudge1	Potatoes and fertilizers (LMIO19_bulves)	C++17	0 / 100	787 ms	51424 KiB

bulves

#include <bits/stdc++.h>

using namespace std;

int main() {
    int n;
    cin >> n;
    int a[n], b[n];
    map <int, int> mp;
    map <int, int> mp1;
    map <int, int> mp2;
    map <int, int> mp3;
    int p = 0;
    int g = 0;
    int ok = 0;
    int okk = 0;
    long long cnt = 0;
    for (int i = 0; i < n; i++) {
        cin >> a[i] >> b[i];
        if (a[i] > 0 && b[i] > 0) {
            if (a[i] >= b[i]) {
                a[i] -= b[i];
                b[i] = 0;
            }
            else {
                b[i] -= a[i];
                a[i] = 0;
            }
        }
        if (a[i] > 0) {
            mp2[okk] = a[i];
            mp3[okk] = i;
            okk++;
        }
        if (b[i] > 0) {
            mp[ok] = b[i];
            mp1[ok] = i;
            ok++;
        }
    }
    for (int j = 0; j < ok; j++) {
        for (int i = g; i < okk; i++) {
            if (mp[j] < mp2[i]) {
                cnt += mp[j]*abs(mp1[j]-mp3[i]);
                mp2[i] -= mp[j];
                mp[j] = 0;
                break;
            }
            else {
                cnt += mp2[i]*abs(mp1[j]-mp3[i]);
                mp[j] -= mp2[i];
                mp2[i] = 0;
                p++;
                if (mp[j] == mp2[i]) {
                    break;
                }
            }
        }
        g += p;
        p = 0;
    }
    cout << cnt;
}

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