oj.uz

답안 #345273

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

#define ll long long
#define pb push_back

using namespace std;
vector<ll> v;
ll mn = LONG_MAX;
ll sum = 0;
ll razm = 0;

void solve(ll start, ll t) {
    //cout << start << " " << t << " " << sum << "\n";
    if (t > 0) {
        ll mx = 0;
        for (int i = start; i < razm - t + 1; i++) {
            mx = max(mx, v[i]);
            sum += mx;
            //cout << mx << " ";
            solve(i + 1, t - 1);
            sum -= mx;
        }
    }
    else {
        ll mx = 0;
        for (int i = start; i < razm; i++) {
            mx = max(mx, v[i]);
        }
        sum += mx;
        mn = min(sum, mn);
        sum -= mx;
    }
}

int main() {
    ll n, k, m, x;
    cin >> n >> k;
    razm = n;
    for (int i = 0; i < n; i++) {
        cin >> x;
        v.pb(x);
    }
    solve(0, k);
    cout << mn;
    return 0;
}

Compilation message

blocks.cpp: In function 'int main()':
blocks.cpp:36:14: warning: unused variable 'm' [-Wunused-variable]
   36 |     ll n, k, m, x;
      |              ^

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 0 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 Execution timed out 1086 ms 364 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 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 4 ms 364 KB Output is correct
15 Correct 4 ms 364 KB Output is correct
16 Correct 2 ms 364 KB Output is correct
17 Correct 2 ms 364 KB Output is correct
18 Correct 5 ms 364 KB Output is correct
19 Correct 2 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 0 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 Execution timed out 1086 ms 364 KB Time limit exceeded
14 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 0 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 Execution timed out 1086 ms 364 KB Time limit exceeded
14 Halted 0 ms 0 KB -