oj.uz

답안 #971278

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
971278 2024-04-28T09:53:44 Z LOLOLO Bali Sculptures (APIO15_sculpture) C++17
100 / 100
 121 ms 860 KB 
#include <bits/stdc++.h>
#define ll long long
using namespace std;
 
#define           f     first
#define           s     second
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (int)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)
#define       len(x)    (int)(x.length())
 
const int N = 1e5 + 10;
int v[N];

ll solve() {
    int n, a, b;
    cin >> n >> a >> b;

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

    ll ans = 0, en = 0;
    if (n <= 100) {
        for (int j = 50; j >= 0; j--) {
            en |= ((ll)1 << j);
            vector < vector <bool>> dp(n + 1, vector <bool>(b + 1, 0));
            dp[0][0] = 1;
            for (int i = 1; i <= n; i++) {
                ll all = 0;
                for (int k = i; k >= 1; k--) {
                    all += v[k];
                    ll t = all & en;
                    if ((t & ans) == t) {
                        for (int f = 1; f <= b; f++) {
                            dp[i][f] = max(dp[i][f], dp[k - 1][f - 1]);
                        }
                    }
                }
            }

            bool is = 0;
            for (int i = a; i <= b; i++) {
                is |= dp[n][i];
            } 

            if (is == 0) {
                ans |= ((ll)1 << j);
            }
        }
    } else {
        for (int j = 50; j >= 0; j--) {
            en |= ((ll)1 << j);
            vector <int> dp(n + 1, 1e9);
            dp[0] = 0;
            for (int i = 1; i <= n; i++) {
                ll all = 0;
                for (int k = i; k >= 1; k--) {
                    all += v[k];
                    ll t = all & en;
                    if ((t & ans) == t) {
                        dp[i] = min(dp[i], dp[k - 1] + 1);
                    }
                }
            }

            if (dp[n] > b) {
                ans |= ((ll)1 << j);
            }
        }
    }

    return ans;
}

int main() {
    ios_base::sync_with_stdio(false); 
    cin.tie(0);
    cout.tie(0);

    cout << solve() << '\n';
    return 0;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 464 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 344 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 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 464 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 348 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 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 468 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 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 1 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 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 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 1 ms 464 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 2 ms 348 KB Output is correct
31 Correct 3 ms 348 KB Output is correct
32 Correct 3 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 4 ms 860 KB Output is correct
35 Correct 3 ms 348 KB Output is correct
36 Correct 2 ms 348 KB Output is correct

Subtask #3
21.0 / 21.0

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

Subtask #4
25.0 / 25.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 352 KB Output is correct
5 Correct 1 ms 352 KB Output is correct
6 Correct 1 ms 352 KB Output is correct
7 Correct 1 ms 360 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 464 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 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 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 464 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 460 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 460 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 596 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 0 ms 460 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 2 ms 468 KB Output is correct
41 Correct 3 ms 348 KB Output is correct
42 Correct 3 ms 464 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 3 ms 348 KB Output is correct
45 Correct 3 ms 348 KB Output is correct
46 Correct 2 ms 348 KB Output is correct
47 Correct 3 ms 348 KB Output is correct
48 Correct 3 ms 348 KB Output is correct
49 Correct 8 ms 468 KB Output is correct
50 Correct 25 ms 348 KB Output is correct
51 Correct 49 ms 600 KB Output is correct
52 Correct 48 ms 348 KB Output is correct
53 Correct 1 ms 468 KB Output is correct
54 Correct 26 ms 348 KB Output is correct
55 Correct 37 ms 600 KB Output is correct
56 Correct 2 ms 344 KB Output is correct
57 Correct 5 ms 348 KB Output is correct
58 Correct 12 ms 348 KB Output is correct
59 Correct 22 ms 476 KB Output is correct
60 Correct 23 ms 348 KB Output is correct
61 Correct 1 ms 348 KB Output is correct
62 Correct 26 ms 348 KB Output is correct
63 Correct 25 ms 348 KB Output is correct
64 Correct 39 ms 472 KB Output is correct
65 Correct 2 ms 348 KB Output is correct
66 Correct 2 ms 348 KB Output is correct
67 Correct 4 ms 472 KB Output is correct
68 Correct 11 ms 344 KB Output is correct
69 Correct 22 ms 468 KB Output is correct
70 Correct 20 ms 348 KB Output is correct
71 Correct 1 ms 344 KB Output is correct
72 Correct 26 ms 348 KB Output is correct
73 Correct 19 ms 348 KB Output is correct
74 Correct 18 ms 344 KB Output is correct

Subtask #5
29.0 / 29.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 1 ms 348 KB Output is correct
7 Correct 1 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 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 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 1 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 492 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 460 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 2 ms 460 KB Output is correct
28 Correct 3 ms 348 KB Output is correct
29 Correct 4 ms 600 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 4 ms 348 KB Output is correct
32 Correct 3 ms 464 KB Output is correct
33 Correct 2 ms 344 KB Output is correct
34 Correct 3 ms 348 KB Output is correct
35 Correct 3 ms 348 KB Output is correct
36 Correct 8 ms 344 KB Output is correct
37 Correct 26 ms 348 KB Output is correct
38 Correct 50 ms 448 KB Output is correct
39 Correct 50 ms 344 KB Output is correct
40 Correct 2 ms 344 KB Output is correct
41 Correct 26 ms 348 KB Output is correct
42 Correct 36 ms 348 KB Output is correct
43 Correct 2 ms 348 KB Output is correct
44 Correct 4 ms 348 KB Output is correct
45 Correct 11 ms 348 KB Output is correct
46 Correct 21 ms 348 KB Output is correct
47 Correct 19 ms 348 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 25 ms 348 KB Output is correct
50 Correct 25 ms 344 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 10 ms 348 KB Output is correct
53 Correct 15 ms 344 KB Output is correct
54 Correct 30 ms 728 KB Output is correct
55 Correct 36 ms 348 KB Output is correct
56 Correct 104 ms 476 KB Output is correct
57 Correct 103 ms 348 KB Output is correct
58 Correct 101 ms 348 KB Output is correct
59 Correct 106 ms 600 KB Output is correct
60 Correct 104 ms 344 KB Output is correct
61 Correct 1 ms 344 KB Output is correct
62 Correct 16 ms 480 KB Output is correct
63 Correct 30 ms 348 KB Output is correct
64 Correct 26 ms 348 KB Output is correct
65 Correct 52 ms 476 KB Output is correct
66 Correct 86 ms 344 KB Output is correct
67 Correct 121 ms 472 KB Output is correct
68 Correct 107 ms 476 KB Output is correct
69 Correct 104 ms 472 KB Output is correct