oj.uz

답안 #915009

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
915009 2024-01-23T07:34:54 Z Whisper K개의 묶음 (IZhO14_blocks) C++17
53 / 100
 1000 ms 162640 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;
using T = tuple<ll, ll, ll>;

#define int long long
#define Base 41
#define sz(a) (int)a.size()
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define all(x) x.begin() , x.end()
#define pii pair<int , int>
#define fi first
#define se second
#define Lg(x) 31 - __builtin_clz(x)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)

constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 2e5 + 5;
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void setupIO(){
    #define name "Whisper"
    //Phu Trong from Nguyen Tat Thanh High School for gifted student
    srand(time(NULL));
    cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    cout << fixed << setprecision(10);
}

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }

int N, K;
int a[MAX];

int dp[MAX][101];
const int Log = 18;
int st[MAX][Log];

int cost (int l, int r){
    int k = Lg(r - l + 1);
    return max(st[l][k], st[r - MASK(k) + 1][k]);
}
void Whisper(){
    cin >> N >> K;
    for (int i = 1; i <= N; ++i) cin >> a[i];

    for (int i = 1; i <= N; ++i) st[i][0] = a[i];
    for (int k = 1; MASK(k) <= N; ++k){
        for (int i = 1; i + MASK(k) - 1 <= N; ++i){
            st[i][k] = max(st[i][k - 1], st[i + MASK(k - 1)][k - 1]);
        }
    }


    memset(dp, 0x3f, sizeof dp);
    for (int i = 1; i <= N; ++i) dp[i][1] = cost(1, i);

    for (int k = 2; k <= N; ++k){
        for (int i = 1; i <= N; ++i){
            for (int j = 0; j < i; ++j){
                dp[i][k] = min(dp[i][k], dp[j][k - 1] + cost(j + 1, i));
            }
        }
    }
    cout << dp[N][K];
}


signed main(){
    setupIO();
    int Test = 1;
//    cin >> Test;
    for ( int i = 1 ; i <= Test ; i++ ){
        Whisper();
        if (i < Test) cout << '\n';
    }
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 160340 KB Output is correct
2 Correct 27 ms 160340 KB Output is correct
3 Correct 27 ms 160496 KB Output is correct
4 Correct 27 ms 160492 KB Output is correct
5 Correct 27 ms 160480 KB Output is correct
6 Correct 27 ms 160428 KB Output is correct
7 Correct 27 ms 160448 KB Output is correct
8 Correct 28 ms 160504 KB Output is correct
9 Correct 27 ms 160336 KB Output is correct
10 Correct 29 ms 160340 KB Output is correct
11 Correct 28 ms 160380 KB Output is correct
12 Correct 29 ms 160348 KB Output is correct
13 Correct 29 ms 160348 KB Output is correct
14 Correct 28 ms 160348 KB Output is correct
15 Correct 29 ms 160464 KB Output is correct
16 Correct 29 ms 160416 KB Output is correct
17 Correct 29 ms 160668 KB Output is correct
18 Correct 29 ms 160332 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 160348 KB Output is correct
2 Correct 27 ms 160520 KB Output is correct
3 Correct 27 ms 160444 KB Output is correct
4 Correct 27 ms 160472 KB Output is correct
5 Correct 28 ms 160312 KB Output is correct
6 Correct 28 ms 160436 KB Output is correct
7 Correct 27 ms 160392 KB Output is correct
8 Correct 29 ms 160340 KB Output is correct
9 Correct 27 ms 160344 KB Output is correct
10 Correct 26 ms 160344 KB Output is correct
11 Correct 27 ms 160344 KB Output is correct
12 Correct 27 ms 160420 KB Output is correct
13 Correct 27 ms 160328 KB Output is correct
14 Correct 28 ms 160296 KB Output is correct
15 Correct 28 ms 160340 KB Output is correct
16 Correct 27 ms 160452 KB Output is correct
17 Correct 27 ms 160348 KB Output is correct
18 Correct 28 ms 160488 KB Output is correct
19 Correct 27 ms 160340 KB Output is correct
20 Correct 26 ms 160340 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 160340 KB Output is correct
2 Correct 27 ms 160340 KB Output is correct
3 Correct 27 ms 160496 KB Output is correct
4 Correct 27 ms 160492 KB Output is correct
5 Correct 27 ms 160480 KB Output is correct
6 Correct 27 ms 160428 KB Output is correct
7 Correct 27 ms 160448 KB Output is correct
8 Correct 28 ms 160504 KB Output is correct
9 Correct 27 ms 160336 KB Output is correct
10 Correct 29 ms 160340 KB Output is correct
11 Correct 28 ms 160380 KB Output is correct
12 Correct 29 ms 160348 KB Output is correct
13 Correct 29 ms 160348 KB Output is correct
14 Correct 28 ms 160348 KB Output is correct
15 Correct 29 ms 160464 KB Output is correct
16 Correct 29 ms 160416 KB Output is correct
17 Correct 29 ms 160668 KB Output is correct
18 Correct 29 ms 160332 KB Output is correct
19 Correct 29 ms 160348 KB Output is correct
20 Correct 27 ms 160520 KB Output is correct
21 Correct 27 ms 160444 KB Output is correct
22 Correct 27 ms 160472 KB Output is correct
23 Correct 28 ms 160312 KB Output is correct
24 Correct 28 ms 160436 KB Output is correct
25 Correct 27 ms 160392 KB Output is correct
26 Correct 29 ms 160340 KB Output is correct
27 Correct 27 ms 160344 KB Output is correct
28 Correct 26 ms 160344 KB Output is correct
29 Correct 27 ms 160344 KB Output is correct
30 Correct 27 ms 160420 KB Output is correct
31 Correct 27 ms 160328 KB Output is correct
32 Correct 28 ms 160296 KB Output is correct
33 Correct 28 ms 160340 KB Output is correct
34 Correct 27 ms 160452 KB Output is correct
35 Correct 27 ms 160348 KB Output is correct
36 Correct 28 ms 160488 KB Output is correct
37 Correct 27 ms 160340 KB Output is correct
38 Correct 26 ms 160340 KB Output is correct
39 Correct 31 ms 160720 KB Output is correct
40 Correct 28 ms 160340 KB Output is correct
41 Correct 28 ms 160336 KB Output is correct
42 Correct 27 ms 160468 KB Output is correct
43 Correct 27 ms 160348 KB Output is correct
44 Correct 26 ms 160480 KB Output is correct
45 Correct 26 ms 160340 KB Output is correct
46 Correct 29 ms 160336 KB Output is correct
47 Correct 27 ms 160344 KB Output is correct
48 Correct 27 ms 160388 KB Output is correct
49 Correct 29 ms 160344 KB Output is correct
50 Correct 28 ms 160504 KB Output is correct
51 Correct 30 ms 160340 KB Output is correct
52 Correct 28 ms 160336 KB Output is correct
53 Correct 31 ms 160488 KB Output is correct
54 Correct 31 ms 160380 KB Output is correct
55 Correct 29 ms 160340 KB Output is correct
56 Correct 29 ms 160348 KB Output is correct
57 Correct 27 ms 160388 KB Output is correct

Subtask #4
0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 160340 KB Output is correct
2 Correct 27 ms 160340 KB Output is correct
3 Correct 27 ms 160496 KB Output is correct
4 Correct 27 ms 160492 KB Output is correct
5 Correct 27 ms 160480 KB Output is correct
6 Correct 27 ms 160428 KB Output is correct
7 Correct 27 ms 160448 KB Output is correct
8 Correct 28 ms 160504 KB Output is correct
9 Correct 27 ms 160336 KB Output is correct
10 Correct 29 ms 160340 KB Output is correct
11 Correct 28 ms 160380 KB Output is correct
12 Correct 29 ms 160348 KB Output is correct
13 Correct 29 ms 160348 KB Output is correct
14 Correct 28 ms 160348 KB Output is correct
15 Correct 29 ms 160464 KB Output is correct
16 Correct 29 ms 160416 KB Output is correct
17 Correct 29 ms 160668 KB Output is correct
18 Correct 29 ms 160332 KB Output is correct
19 Correct 29 ms 160348 KB Output is correct
20 Correct 27 ms 160520 KB Output is correct
21 Correct 27 ms 160444 KB Output is correct
22 Correct 27 ms 160472 KB Output is correct
23 Correct 28 ms 160312 KB Output is correct
24 Correct 28 ms 160436 KB Output is correct
25 Correct 27 ms 160392 KB Output is correct
26 Correct 29 ms 160340 KB Output is correct
27 Correct 27 ms 160344 KB Output is correct
28 Correct 26 ms 160344 KB Output is correct
29 Correct 27 ms 160344 KB Output is correct
30 Correct 27 ms 160420 KB Output is correct
31 Correct 27 ms 160328 KB Output is correct
32 Correct 28 ms 160296 KB Output is correct
33 Correct 28 ms 160340 KB Output is correct
34 Correct 27 ms 160452 KB Output is correct
35 Correct 27 ms 160348 KB Output is correct
36 Correct 28 ms 160488 KB Output is correct
37 Correct 27 ms 160340 KB Output is correct
38 Correct 26 ms 160340 KB Output is correct
39 Correct 31 ms 160720 KB Output is correct
40 Correct 28 ms 160340 KB Output is correct
41 Correct 28 ms 160336 KB Output is correct
42 Correct 27 ms 160468 KB Output is correct
43 Correct 27 ms 160348 KB Output is correct
44 Correct 26 ms 160480 KB Output is correct
45 Correct 26 ms 160340 KB Output is correct
46 Correct 29 ms 160336 KB Output is correct
47 Correct 27 ms 160344 KB Output is correct
48 Correct 27 ms 160388 KB Output is correct
49 Correct 29 ms 160344 KB Output is correct
50 Correct 28 ms 160504 KB Output is correct
51 Correct 30 ms 160340 KB Output is correct
52 Correct 28 ms 160336 KB Output is correct
53 Correct 31 ms 160488 KB Output is correct
54 Correct 31 ms 160380 KB Output is correct
55 Correct 29 ms 160340 KB Output is correct
56 Correct 29 ms 160348 KB Output is correct
57 Correct 27 ms 160388 KB Output is correct
58 Execution timed out 1016 ms 162640 KB Time limit exceeded
59 Halted 0 ms 0 KB -