oj.uz

답안 #336823

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
336823 2020-12-17T00:08:08 Z thecodingwizard Potatoes and fertilizers (LMIO19_bulves) C++11
0 / 100
 380 ms 262148 KB 
#include <bits/stdc++.h>

using namespace std;

using ll = long long;
#define ii pair<int, int>
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define F0R(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define inf 1000000010

int dp[3000][30001];
int diff[3000];

int main() {
    cin.tie(0)->sync_with_stdio(0);

    int n; cin >> n; assert(n <= 3000);

    ll totA = 0, totB = 0;
    F0R(i, n) {
        int a, b; cin >> a >> b;
        totA += a; totB += b;
        diff[i] = totA - totB;
    }
    assert(totA <= 30000 && totB <= 30000);

    F0R(i, n) {
        F0R(j, 30001) {
            dp[i][j] = min((i>0 ? dp[i-1][j] : 0) + abs(diff[i]-j), (j>0 ? dp[i][j-1] : inf));
        }
    }

    cout << dp[n-1][diff[n-1]] << endl;

    return 0;
}

Subtask #1
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1004 KB Output is correct
2 Runtime error 380 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1004 KB Output is correct
2 Runtime error 380 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1004 KB Output is correct
2 Runtime error 380 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1004 KB Output is correct
2 Runtime error 380 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)

Subtask #5
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1004 KB Output is correct
2 Runtime error 380 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)