oj.uz

답안 #970534

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
970534 2024-04-26T16:43:07 Z RandomUser Holding (COCI20_holding) C++17
22 / 110
 166 ms 262144 KB 
#include <bits/stdc++.h>

#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;

int32_t main() {
    int n, l, r, K;
    cin >> n >> l >> r >> K;

    vector<int> v(n+1);
    for(int i=1; i<=n; i++) cin >> v[i];

    ll sum = 0;
    for(int i=l; i<=r; i++) sum += v[i];

    ll dpL[l][n+1][K+1], dpR[n+2][n+2][K+1];
    memset(dpR, 0, sizeof(dpR));
    memset(dpL, 0, sizeof(dpL));

    for(int i=1; i<l; i++) {
        for(int j=l; j<=r; j++) {
            for(int k=0; k<=K; k++) {
                dpL[i][j][k] = min(dpL[i][j][k], dpL[i-1][j][k]);
                dpL[i][j][k] = min(dpL[i][j][k], dpL[i][j-1][k]);
                if(j - i <= k) dpL[i][j][k] = min(dpL[i][j][k], dpL[i-1][j-1][k-j+i] + v[i] - v[j]);
            }
        }
    }

    for(int i=r; i>=l; i--) {
        for(int j=n; j>=r+1; j--) {
            for(int k=0; k<=K; k++) {
                dpR[i][j][k] = min(dpR[i][j][k], dpR[i+1][j][k]);
                dpR[i][j][k] = min(dpR[i][j][k], dpR[i][j+1][k]);
                if(j - i <= k) dpR[i][j][k] = min(dpR[i][j][k], dpR[i-1][j-1][k-j+i] + v[j] - v[i]);
            }
        }
    }

    ll mn = min(dpL[l-1][r][K], dpR[l][r+1][K]);
    for(int i=l; i<r; i++)
        for(int j=0; j<=K; j++)
            mn = min(mn, dpL[l-1][i][j] + dpR[i+1][r+1][K-j]);

    cout << sum + mn << '\n';
    return 0;
}

Subtask #1
22.0 / 22.0

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

Subtask #2
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 14 ms 21852 KB Output is correct
8 Correct 1 ms 2140 KB Output is correct
9 Correct 3 ms 3164 KB Output is correct
10 Correct 2 ms 3164 KB Output is correct
11 Correct 4 ms 5976 KB Output is correct
12 Correct 2 ms 2652 KB Output is correct
13 Runtime error 166 ms 262144 KB Execution killed with signal 9
14 Halted 0 ms 0 KB -

Subtask #3
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 14 ms 21852 KB Output is correct
8 Correct 1 ms 2140 KB Output is correct
9 Correct 3 ms 3164 KB Output is correct
10 Correct 2 ms 3164 KB Output is correct
11 Correct 4 ms 5976 KB Output is correct
12 Correct 2 ms 2652 KB Output is correct
13 Runtime error 166 ms 262144 KB Execution killed with signal 9
14 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 14 ms 21852 KB Output is correct
8 Correct 1 ms 2140 KB Output is correct
9 Correct 3 ms 3164 KB Output is correct
10 Correct 2 ms 3164 KB Output is correct
11 Correct 4 ms 5976 KB Output is correct
12 Correct 2 ms 2652 KB Output is correct
13 Runtime error 166 ms 262144 KB Execution killed with signal 9
14 Halted 0 ms 0 KB -