Submission #1093062

#	Time	Username	Problem	Language	Result	Execution time	Memory
1093062		Seb	Potatoes and fertilizers (LMIO19_bulves)	C++17	0 / 100	222 ms	262144 KiB

bulves

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
template <typename T> //order_of_key = menores, find_by_order = consultar indexado en 0, regresa iterador
using ordered_set =  tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vll = vector<ll>;
using vii = vector<int>;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());

#define mid ((l+r)>>1)
#define f first
#define s second
#define pb push_back
#define MP make_pair
#define all(x) (x).begin(),(x).end()
#define inicio(x) (*(x).begin())
#define rinicio(x) (*(x).rbegin())
#define SZ(x) (int)(x.size())

const ll MAXN = (ll)3e3 + 5;
const ll MAXK = (ll)3e4 + 5;
const ll MOD = (ll)1e9 + 7;
const ll INF = (ll)1e12 + 5;
const ll OFFSET = (ll)1e6;

ll dp[MAXN][MAXK], sum;

void tc() {
    ll N; cin >> N;
    for (int i = 0; i < N; i++) {
        ll a, b; cin >> a >> b;
        a -= b;
        sum += a;

        for (int j = 0; j < MAXK; j++) {
            if (i) {
                dp[i][j] = dp[i - 1][j];
                if (j) dp[i][j] = min(dp[i][j], dp[i][j - 1]);
            }
        }
        for (int j = 0; j < MAXK; j++) dp[i][j] += abs(j - sum);
    }

    cout << dp[N - 1][sum] << "\n";
    return;
}

int main() {
    ios_base::sync_with_stdio(0);cin.tie(0);
    int t = 1;
    //cin >> t;
    for (int i = 1; i <= t; i++) {
        tc();
    }
    return 0;
}

//checa tus constantes, n = 1? overflow?

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