Submission #414576

#	Time	Username	Problem	Language	Result	Execution time	Memory
414576		Aldas25	Potatoes and fertilizers (LMIO19_bulves)	C++14	54 / 100	153 ms	32716 KiB

bulves

#pragma GCC target ("avx2")
#pragma GCC optimize ("O2")
#pragma GCC optimize ("unroll-loops")

#include <bits/stdc++.h>

using namespace std;

#define FAST_IO ios_base::sync_with_stdio(0); cin.tie(0)
#define FOR(i, a, b) for(int i = (a); i <= (b); i++)
#define REP(n) FOR(O, 1, (n))
#define pb push_back
#define f first
#define s second
typedef long double ld;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<ll> vl;
typedef vector<piii> viii;

const int MAXN = 500100, MAXK = 30;
//const ll MOD = 998244353;
const ll INF = 4e18;
const ld PI = asin(1) * 2;

int n;
ll a[MAXN], b[MAXN], dif[MAXN], pref[MAXN];

ll dp[2][31000];

int main()
{
    FAST_IO;

    cin >> n;
    FOR(i, 1, n) cin >> a[i] >> b[i];

    FOR(i, 1, n) {
        dif[i] = a[i]-b[i];
        pref[i] = pref[i-1] + dif[i];
    }

    ll mx = pref[n];

    FOR(i, 1, n) FOR(j, 0, mx) {
        bool b = i%2;
        if (j > 0) dp[b][j] = dp[b][j-1];
        else dp[b][j] = INF;

        dp[b][j] = min(dp[b][j], dp[!b][j] + abs(j - pref[i]));
    }

    cout << dp[n%2][mx] << "\n";

    return 0;
}

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