oj.uz

답안 #713691

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
713691 2023-03-22T20:13:32 Z mtxas Potatoes and fertilizers (LMIO19_bulves) C++14
24 / 100
 110 ms 31756 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));
                }
            }
        }
        int ans = suff[1];
        int ferCnt = 0;
        for(int i = 1; i <= n; ++i)
        {
            ferCnt += a[i];
            if(ferCnt == 0 || ferCnt == A) continue;
            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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 8 ms 1108 KB Output is correct
5 Correct 14 ms 1908 KB Output is correct
6 Correct 41 ms 4180 KB Output is correct
7 Correct 80 ms 8148 KB Output is correct
8 Correct 62 ms 8148 KB Output is correct
9 Correct 64 ms 8148 KB Output is correct
10 Correct 47 ms 8156 KB Output is correct
11 Correct 52 ms 8148 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 8 ms 1108 KB Output is correct
5 Correct 14 ms 1908 KB Output is correct
6 Correct 41 ms 4180 KB Output is correct
7 Correct 80 ms 8148 KB Output is correct
8 Correct 62 ms 8148 KB Output is correct
9 Correct 64 ms 8148 KB Output is correct
10 Correct 47 ms 8156 KB Output is correct
11 Correct 52 ms 8148 KB Output is correct
12 Correct 31 ms 8140 KB Output is correct
13 Correct 66 ms 19084 KB Output is correct
14 Correct 110 ms 31640 KB Output is correct
15 Incorrect 85 ms 31756 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 -