oj.uz

Submission #1106640

# Submission time Handle Problem Language Result Execution time Memory
1106640 2024-10-30T18:27:13 Z Canuc80k Potatoes and fertilizers (LMIO19_bulves) C++17
100 / 100
 99 ms 23240 KB 
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;

const ll N = 1e6 + 1;

ll n;
ll a[N], b[N];

namespace sub1 {
    const ll N = 1e6 + 1;
    ll f[N];

    void solve() {
        ll res = 0;
        for (int i = 1; i <= n; i ++) f[i] = f[i - 1] + (a[i] - b[i]);
        for (int i = 1; i <= n; i ++) res += abs(f[i]);
        cout << res;
    }
}

namespace sub3 {
    const ll N = 3e3 + 1;
    ll d[N];
    ll f[(ll)3e4 + 1], of[(ll)3e4 + 1];

    void solve() {
        for (int i = 1; i <= n; i ++) d[i] = d[i - 1] + a[i] - b[i];
        memset(f, 0x3f, sizeof f);
        
        of[0] = 0;
        for (int i = 1; i <= n; i ++) {
            for (int j = 0; j <= d[n]; j ++) {
                if (j != 0) f[j] = f[j - 1];
                f[j] = min(f[j], of[j] + abs(d[i] - j)); 
            }
            for (int j = 0; j <= d[n]; j ++) {
                of[j] = f[j];
                f[j] = 1e18;
            }
        }
        cout << of[d[n]];
    }
}

namespace sub5 {
    const ll N = 1e6 + 1;
    ll d[N];

    void solve() {
        for (int i = 1; i <= n; i ++) {
            d[i] = d[i - 1] + a[i] - b[i];
        }

        priority_queue<ll> pq; ll res = 0;
        for (int i = 1; i <= n; i ++) {
            if (d[i] < 0) res += -d[i], d[i] = 0;
            if (d[i] >= d[n]) res += d[i] - d[n], d[i] = d[n];
            
            pq.push(d[i]); ll top = pq.top();
            if (pq.top() > d[i]) {
                res += top - d[i];
                pq.pop(); pq.push(d[i]);
            }
        }
        cout << res;
    }
}

void doTest(ll testID) {
    cin >> n; ll sa = 0, sb = 0;
    for (int i = 1; i <= n; i ++) {
        cin >> a[i] >> b[i];
        sa += a[i], sb += b[i];
    }
    
    if (sa == sb) {sub1::solve(); return;}
    if (n <= 3e3 && max(sa, sb) <= 3e4) {sub3::solve(); return;}
    sub5::solve();
}

signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0);

    int test = 1; 
    // cin >> test;
    for (int _ = 1; _ <= test; _ ++) doTest(_);
}

Subtask #1
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4432 KB Output is correct
2 Correct 1 ms 4432 KB Output is correct
3 Correct 1 ms 4432 KB Output is correct
4 Correct 5 ms 6480 KB Output is correct
5 Correct 10 ms 8672 KB Output is correct
6 Correct 26 ms 10728 KB Output is correct
7 Correct 52 ms 16712 KB Output is correct
8 Correct 43 ms 16712 KB Output is correct
9 Correct 42 ms 16716 KB Output is correct
10 Correct 31 ms 16872 KB Output is correct
11 Correct 31 ms 16888 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4432 KB Output is correct
2 Correct 1 ms 4432 KB Output is correct
3 Correct 1 ms 4432 KB Output is correct
4 Correct 5 ms 6480 KB Output is correct
5 Correct 10 ms 8672 KB Output is correct
6 Correct 26 ms 10728 KB Output is correct
7 Correct 52 ms 16712 KB Output is correct
8 Correct 43 ms 16712 KB Output is correct
9 Correct 42 ms 16716 KB Output is correct
10 Correct 31 ms 16872 KB Output is correct
11 Correct 31 ms 16888 KB Output is correct
12 Correct 16 ms 11984 KB Output is correct
13 Correct 36 ms 19240 KB Output is correct
14 Correct 58 ms 23132 KB Output is correct
15 Correct 46 ms 23128 KB Output is correct
16 Correct 48 ms 23128 KB Output is correct
17 Correct 46 ms 23232 KB Output is correct
18 Correct 1 ms 4688 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4432 KB Output is correct
2 Correct 1 ms 4432 KB Output is correct
3 Correct 1 ms 4688 KB Output is correct
4 Correct 1 ms 4688 KB Output is correct
5 Correct 4 ms 4688 KB Output is correct
6 Correct 12 ms 4688 KB Output is correct
7 Correct 63 ms 4688 KB Output is correct
8 Correct 2 ms 4688 KB Output is correct
9 Correct 6 ms 4688 KB Output is correct
10 Correct 6 ms 4688 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4432 KB Output is correct
2 Correct 1 ms 4432 KB Output is correct
3 Correct 1 ms 4432 KB Output is correct
4 Correct 1 ms 4688 KB Output is correct
5 Correct 4 ms 4688 KB Output is correct
6 Correct 12 ms 4688 KB Output is correct
7 Correct 63 ms 4688 KB Output is correct
8 Correct 2 ms 4688 KB Output is correct
9 Correct 6 ms 4688 KB Output is correct
10 Correct 6 ms 4688 KB Output is correct
11 Correct 1 ms 4688 KB Output is correct
12 Correct 2 ms 4432 KB Output is correct
13 Correct 1 ms 4612 KB Output is correct
14 Correct 2 ms 4432 KB Output is correct
15 Correct 2 ms 4432 KB Output is correct
16 Correct 1 ms 4432 KB Output is correct
17 Correct 1 ms 4432 KB Output is correct
18 Correct 1 ms 4432 KB Output is correct

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4432 KB Output is correct
2 Correct 1 ms 4432 KB Output is correct
3 Correct 1 ms 4432 KB Output is correct
4 Correct 1 ms 4688 KB Output is correct
5 Correct 4 ms 4688 KB Output is correct
6 Correct 12 ms 4688 KB Output is correct
7 Correct 63 ms 4688 KB Output is correct
8 Correct 2 ms 4688 KB Output is correct
9 Correct 6 ms 4688 KB Output is correct
10 Correct 6 ms 4688 KB Output is correct
11 Correct 5 ms 6480 KB Output is correct
12 Correct 10 ms 8672 KB Output is correct
13 Correct 26 ms 10728 KB Output is correct
14 Correct 52 ms 16712 KB Output is correct
15 Correct 43 ms 16712 KB Output is correct
16 Correct 42 ms 16716 KB Output is correct
17 Correct 31 ms 16872 KB Output is correct
18 Correct 31 ms 16888 KB Output is correct
19 Correct 16 ms 11984 KB Output is correct
20 Correct 36 ms 19240 KB Output is correct
21 Correct 58 ms 23132 KB Output is correct
22 Correct 46 ms 23128 KB Output is correct
23 Correct 48 ms 23128 KB Output is correct
24 Correct 46 ms 23232 KB Output is correct
25 Correct 2 ms 4432 KB Output is correct
26 Correct 1 ms 4612 KB Output is correct
27 Correct 2 ms 4432 KB Output is correct
28 Correct 2 ms 4432 KB Output is correct
29 Correct 1 ms 4432 KB Output is correct
30 Correct 1 ms 4432 KB Output is correct
31 Correct 1 ms 4432 KB Output is correct
32 Correct 1 ms 4688 KB Output is correct
33 Correct 26 ms 11992 KB Output is correct
34 Correct 59 ms 19032 KB Output is correct
35 Correct 99 ms 23232 KB Output is correct
36 Correct 92 ms 23232 KB Output is correct
37 Correct 51 ms 23128 KB Output is correct
38 Correct 93 ms 23232 KB Output is correct
39 Correct 50 ms 23132 KB Output is correct
40 Correct 77 ms 23132 KB Output is correct
41 Correct 52 ms 23120 KB Output is correct
42 Correct 52 ms 23232 KB Output is correct
43 Correct 56 ms 23124 KB Output is correct
44 Correct 71 ms 23232 KB Output is correct
45 Correct 66 ms 23132 KB Output is correct
46 Correct 47 ms 23240 KB Output is correct
47 Correct 69 ms 23124 KB Output is correct