oj.uz

답안 #345406

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
345406 2021-01-07T09:14:05 Z bachaquer K개의 묶음 (IZhO14_blocks) C++14
18 / 100
 1 ms 620 KB 
#include <bits/stdc++.h>

#define ll long long
#define pb push_back

using namespace std;

const int N = 100;
const int INF = 1e8;

ll dp[N][N];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    ll n, k, x;
    cin >> n >> k;
    vector<ll> v;
    v.pb(0);
    for (int i = 1; i <= n; i++) {
        cin >> x;
        v.pb(x);
    }
    for (int i = 0; i <= n; i++) {
        for (int j = 1; j <= N; j++) {
            dp[i][j] = INF;
        }
    }
    dp[0][0] = 0;
    for (int t = 1; t <= k; t++) {
        for (int i = 1; i <= n; i++) {
            ll mx = 0;
            for (int j = i; j > 0; j--) {
                mx = max(mx, v[j]);
                dp[i][t] = min(dp[i][t], dp[j - 1][t - 1] + mx);
            }
        }
    }
    cout << dp[n][k];
    return 0;
}

Compilation message

blocks.cpp: In function 'int main()':
blocks.cpp:26:22: warning: iteration 99 invokes undefined behavior [-Waggressive-loop-optimizations]
   26 |             dp[i][j] = INF;
      |             ~~~~~~~~~^~~~~
blocks.cpp:25:27: note: within this loop
   25 |         for (int j = 1; j <= N; j++) {
      |                         ~~^~~~

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Runtime error 1 ms 620 KB Execution killed with signal 11 (could be triggered by violating memory limits)
13 Halted 0 ms 0 KB -

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 492 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Runtime error 1 ms 620 KB Execution killed with signal 11 (could be triggered by violating memory limits)
13 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Runtime error 1 ms 620 KB Execution killed with signal 11 (could be triggered by violating memory limits)
13 Halted 0 ms 0 KB -