| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1106625 | Canuc80k | Potatoes and fertilizers (LMIO19_bulves) | C++17 | 77 ms | 1272 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
const ll N = 3e3 + 1;
const ll M = 1e9 + 7;
ll n;
ll a[N], b[N], d[N];
ll f[(ll)3e4 + 1], of[(ll)3e4 + 1];
void doTest(ll testID) {
    cin >> n; ll sum = 0;
    for (int i = 1; i <= n; i ++) {
        cin >> a[i] >> b[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)); 
            // cout << "Debug: " << i << ' ' << j << ' ' << f[j] << ' ' <<  << endl; 
        }
        for (int j = 0; j <= d[n]; j ++) {
            of[j] = f[j];
            f[j] = 1e18;
        }
    }
    cout << of[d[n]];
}
signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    int test = 1; 
    // cin >> test;
    for (int _ = 1; _ <= test; _ ++) doTest(_);
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
