Submission #713638

#	Time	Username	Problem	Language	Result	Execution time	Memory
713638		mtxas	Potatoes and fertilizers (LMIO19_bulves)	C++14	24 / 100	88 ms	14780 KiB

bulves

#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];
    }
    /// 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;
}
signed main()
{
#ifdef EVAL
    cin.tie(0);
    cout.tie(0);
    ios_base::sync_with_stdio(false);
#endif // EVAL
    solve();
}

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