oj.uz

Submission #713717

# Submission time Handle Problem Language Result Execution time Memory
713717 2023-03-22T22:48:44 Z mtxas Potatoes and fertilizers (LMIO19_bulves) C++14
34 / 100
 114 ms 31848 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define int long long
#define DISABLE_PRINTF
#ifdef DISABLE_PRINTF
#define printf(...)
#endif // DISABLE_PRINTF
using namespace std;
void solve()
{
    int n;
    cin >> n;
    vector<int> a(n + 1), b(n + 1);
    for(int i = 1; i <= n; ++i)
    {
        cin >> a[i] >> b[i];
    }
    int A = 0;
    int B = 0;
    for(int i = 1; i <= n; ++i)
    {
        A += a[i], B += b[i];
    }
    if(A == B)
    {
        /// solve it
        int ans = 0;
        int aid = 1, bid = 1;
        for(; bid <= n; ++bid)
        {
            for(; b[bid] > 0; ++aid)
            {
                int take = min(a[aid], b[bid]);
                b[bid] -= take;
                a[aid] -= take;
                ans += take * abs(bid - aid);
                if(b[bid] == 0)
                {
                    break;
                }
            }
        }
        cout << ans;
    }
    else if(A == B + 1)
    {
        vector<int> pref(n + 1), suff(n + 2);
        vector<int> prefLastDelta(n + 1), suffLastDelta(n + 2);
        vector<int> acopy = a, bcopy = b;
        /// calc pref
        int bid = 1;
        for(int i = 1; i <= n; ++i)
        {
            pref[i] = pref[i - 1];
//            prefLastDelta[i] = prefLastDelta[i - 1];
            for(; a[i] > 0; bid += (b[bid] == 0) )
            {
                if(bid == n + 1) break;
                int take = min(a[i], b[bid]);
                a[i] -= take;
                b[bid] -= take;
                pref[i] += abs(i - bid) * take;
                if(take > 0)
                {
                    prefLastDelta[i] = (abs(i - bid));
                }
            }
        }
        a = acopy;
        b = bcopy;
        bid = n;
        /// calc suff
        for(int i = n; i >= 1; --i)
        {
            suff[i] = suff[i + 1];
//            suffLastDelta[i] = suffLastDelta[i + 1];
            for(; a[i] > 0; bid -= (b[bid] == 0) )
            {
                if(bid == 0) break;
                int take = min(a[i], b[bid]);
                a[i] -= take;
                b[bid] -= take;
                suff[i] += abs(i - bid) * take;
                if(take > 0)
                {
                    suffLastDelta[i] = (abs(i - bid));
                }
            }
        }
        a = acopy;
        b = bcopy;
        int ans = min(suff[1], pref[n]);
        printf("suff[1] = %lld\npref[n] = %lld\n", suff[1], pref[n]);
        int ferCnt = 0;
        for(int i = 1; i <= n; ++i)
        {
            ferCnt += a[i];
            if(ferCnt == 0 || ferCnt == A) continue;
            printf("i = %d\n", i);
            ans = min(ans, pref[i] + suff[i + 1] -
                      max(prefLastDelta[i],
                          suffLastDelta[i + 1]));
        }
        cerr << "the case" << endl;
        cout << ans << '\n';
    }
}
signed main()
{
#ifdef EVAL
    cin.tie(0);
    cout.tie(0);
    ios_base::sync_with_stdio(false);
#else
    freopen("input_00.txt", "r", stdin);
#endif // EVAL

    solve();
}

Subtask #1
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 316 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 9 ms 1088 KB Output is correct
5 Correct 15 ms 1988 KB Output is correct
6 Correct 45 ms 4324 KB Output is correct
7 Correct 89 ms 8240 KB Output is correct
8 Correct 64 ms 8268 KB Output is correct
9 Correct 65 ms 8244 KB Output is correct
10 Correct 50 ms 8200 KB Output is correct
11 Correct 50 ms 8256 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 316 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 9 ms 1088 KB Output is correct
5 Correct 15 ms 1988 KB Output is correct
6 Correct 45 ms 4324 KB Output is correct
7 Correct 89 ms 8240 KB Output is correct
8 Correct 64 ms 8268 KB Output is correct
9 Correct 65 ms 8244 KB Output is correct
10 Correct 50 ms 8200 KB Output is correct
11 Correct 50 ms 8256 KB Output is correct
12 Correct 29 ms 8260 KB Output is correct
13 Correct 64 ms 19188 KB Output is correct
14 Correct 114 ms 31664 KB Output is correct
15 Correct 106 ms 31664 KB Output is correct
16 Correct 92 ms 31848 KB Output is correct
17 Correct 68 ms 31848 KB Output is correct
18 Correct 1 ms 468 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 316 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Incorrect 1 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 316 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Incorrect 1 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 316 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Incorrect 1 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -