oj.uz

답안 #464850

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
464850 2021-08-14T10:18:32 Z TheScrasse Holding (COCI20_holding) C++17
22 / 110
 6 ms 2124 KB 
#include <bits/stdc++.h>
using namespace std;

#define nl "\n"
#define nf endl
#define ll long long
#define pb push_back
#define _ << ' ' <<

#define INF (ll)1e18
#define mod 998244353
#define maxn 110
#define maxm 10010

ll i, i1, j, k, k1, t, n, m, res, flag[10], a[maxn], b;
ll l, r, dp[2][maxn][maxm];

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    #if !ONLINE_JUDGE && !EVAL
        ifstream cin("input.txt");
        ofstream cout("output.txt");
    #endif

    cin >> n >> l >> r >> m;
    for (i = 1; i <= n; i++) {
        cin >> a[i];
    }

    for (i = l; i <= r; i++) {
        for (j = 1; j <= n; j++) {
            for (k = abs(j - i); k <= m; k++) {
                dp[1][j][k] = max(dp[0][j][k], dp[1][j - 1][k]);
                if (k >= 1) dp[1][j][k] = max(dp[1][j][k], dp[1][j][k - 1]);
                if (j >= l && j <= r) continue;
                dp[1][j][k] = max(dp[1][j][k], dp[0][j - 1][k - abs(j - i)] + a[i] - a[j]);
            }
        }

        for (j = 1; j <= n; j++) {
            for (k = 0; k <= m; k++) {
                dp[0][j][k] = dp[1][j][k];
                dp[1][j][k] = 0;
                // cout << dp[0][j][k] << ' ';
            }
            // cout << nl;
        }
        // cout << nl;
    }

    for (i = l; i <= r; i++) res += a[i];
    res -= dp[0][n][m];

    cout << res << nl;

    return 0;
}

Subtask #1
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 6 ms 2124 KB Output is correct

Subtask #2
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 6 ms 2124 KB Output is correct
8 Correct 1 ms 716 KB Output is correct
9 Correct 1 ms 716 KB Output is correct
10 Correct 1 ms 716 KB Output is correct
11 Incorrect 2 ms 844 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 6 ms 2124 KB Output is correct
8 Correct 1 ms 716 KB Output is correct
9 Correct 1 ms 716 KB Output is correct
10 Correct 1 ms 716 KB Output is correct
11 Incorrect 2 ms 844 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 6 ms 2124 KB Output is correct
8 Correct 1 ms 716 KB Output is correct
9 Correct 1 ms 716 KB Output is correct
10 Correct 1 ms 716 KB Output is correct
11 Incorrect 2 ms 844 KB Output isn't correct
12 Halted 0 ms 0 KB -