oj.uz

답안 #932501

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
932501 2024-02-23T14:09:05 Z vjudge1 Bali Sculptures (APIO15_sculpture) C++17
50 / 100
 80 ms 500 KB 
#include <bits/stdc++.h>
#define ll long long

using namespace std;

const int N = 2e3 + 5;

int n, u, v;
int a[N];
ll pre[N];

bool ck(ll a, ll b, ll c){
    return (a | b) < (b | c);
}

namespace sub1{
    int dp[N];

    void solve(){
        ll ans = 0;
        for (ll i = 45; i >= 0; -- i){
            ll cur = (1ll << i);
            for (int j = 1; j <= n; ++ j){
                dp[j] = n + 1;
                for (int k = j - 1; k >= 0; -- k){
                    if (ck(pre[j] - pre[k], ans, cur)) dp[j] = min(dp[j], dp[k] + 1);
                }
            }
            if (dp[n] > v) ans += cur;
        }
        cout << ans;
    }
}

namespace sub2{
    bool dp[105][105];

    void solve(){
        ll ans = 0;
        for (ll i = 45; i >= 0; -- i){
            ll cur = 1ll << i;
            dp[0][0] = 1;
            for (int j = 1; j <= n; ++ j){
                for (int t = 0; t <= j; ++ t) dp[j][t] = 0;
                for (int k = 0; k < j; ++ k){
                    if (ck(pre[j] - pre[k], ans, cur)){
                        for (int t = 0; t <= k; ++ t) dp[j][t + 1] |= dp[k][j];
                    }
                }
            }
            bool ck = false;
            for (int t = u; t <= v; ++ t) if (dp[n][t]) ck = true;
            if (!ck) ans += cur;
        }
        cout << ans;
    }
}

void solve(){
    cin >> n >> u >> v;
    for (int i = 1; i <= n; ++ i) cin >> a[i], pre[i] = pre[i - 1] + a[i];

    if (u == 1) sub1::solve();
    else sub2::solve();
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    solve();
    return 0;
}

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Incorrect 0 ms 348 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

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

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 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 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 360 KB Output is correct
11 Correct 0 ms 360 KB Output is correct
12 Correct 0 ms 360 KB Output is correct
13 Correct 0 ms 360 KB Output is correct
14 Correct 0 ms 360 KB Output is correct
15 Correct 0 ms 360 KB Output is correct
16 Correct 0 ms 360 KB Output is correct
17 Correct 0 ms 360 KB Output is correct
18 Correct 0 ms 360 KB Output is correct
19 Correct 0 ms 360 KB Output is correct
20 Correct 1 ms 360 KB Output is correct
21 Correct 0 ms 360 KB Output is correct
22 Correct 0 ms 360 KB Output is correct
23 Correct 1 ms 360 KB Output is correct
24 Correct 0 ms 360 KB Output is correct
25 Correct 0 ms 360 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 500 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 420 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 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Incorrect 0 ms 348 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #5
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 360 KB Output is correct
34 Correct 1 ms 356 KB Output is correct
35 Correct 1 ms 360 KB Output is correct
36 Correct 1 ms 360 KB Output is correct
37 Correct 1 ms 360 KB Output is correct
38 Correct 1 ms 360 KB Output is correct
39 Correct 1 ms 360 KB Output is correct
40 Correct 1 ms 360 KB Output is correct
41 Correct 1 ms 360 KB Output is correct
42 Correct 1 ms 360 KB Output is correct
43 Correct 0 ms 360 KB Output is correct
44 Correct 1 ms 360 KB Output is correct
45 Correct 1 ms 360 KB Output is correct
46 Correct 1 ms 360 KB Output is correct
47 Correct 1 ms 360 KB Output is correct
48 Correct 1 ms 360 KB Output is correct
49 Correct 1 ms 360 KB Output is correct
50 Correct 1 ms 360 KB Output is correct
51 Correct 1 ms 360 KB Output is correct
52 Correct 8 ms 360 KB Output is correct
53 Correct 10 ms 360 KB Output is correct
54 Correct 19 ms 360 KB Output is correct
55 Correct 20 ms 360 KB Output is correct
56 Correct 66 ms 360 KB Output is correct
57 Correct 75 ms 476 KB Output is correct
58 Correct 63 ms 348 KB Output is correct
59 Correct 73 ms 468 KB Output is correct
60 Correct 68 ms 348 KB Output is correct
61 Correct 1 ms 348 KB Output is correct
62 Correct 11 ms 484 KB Output is correct
63 Correct 19 ms 348 KB Output is correct
64 Correct 22 ms 348 KB Output is correct
65 Correct 36 ms 348 KB Output is correct
66 Correct 50 ms 348 KB Output is correct
67 Correct 71 ms 348 KB Output is correct
68 Correct 80 ms 464 KB Output is correct
69 Correct 64 ms 348 KB Output is correct