oj.uz

Submission #713686

# Submission time Handle Problem Language Result Execution time Memory
713686 2023-03-22T19:58:31 Z mtxas Potatoes and fertilizers (LMIO19_bulves) C++14
24 / 100
 101 ms 8148 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> acopy = a, bcopy = b;
        /// calc pref
        int bid = 1;
        for(int i = 1; i <= n; ++i)
        {
            pref[i] = pref[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;
            }
        }
        a = acopy;
        b = bcopy;
        bid = n;
        /// calc suff
        for(int i = n; i >= 1; --i)
        {
            suff[i] = suff[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;
            }
        }
        int ans = suff[1];
        for(int i = 1; i <= n; ++i)
        {
            ans = min(ans, pref[i] + suff[i + 1]);
        }
        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 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 11 ms 1108 KB Output is correct
5 Correct 13 ms 1908 KB Output is correct
6 Correct 43 ms 4180 KB Output is correct
7 Correct 101 ms 8148 KB Output is correct
8 Correct 63 ms 8148 KB Output is correct
9 Correct 65 ms 8148 KB Output is correct
10 Correct 47 ms 8148 KB Output is correct
11 Correct 47 ms 8148 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 11 ms 1108 KB Output is correct
5 Correct 13 ms 1908 KB Output is correct
6 Correct 43 ms 4180 KB Output is correct
7 Correct 101 ms 8148 KB Output is correct
8 Correct 63 ms 8148 KB Output is correct
9 Correct 65 ms 8148 KB Output is correct
10 Correct 47 ms 8148 KB Output is correct
11 Correct 47 ms 8148 KB Output is correct
12 Incorrect 27 ms 6088 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

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

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Incorrect 0 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 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Incorrect 0 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -