oj.uz

답안 #1078701

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1078701 2024-08-28T04:42:06 Z Icelast Bali Sculptures (APIO15_sculpture) C++17
100 / 100
 82 ms 680 KB 
#include <iostream>
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll maxn = 2005, INF = 4e18+9;
bool dp[maxn][maxn];
void sub4(ll n, ll A, ll B, vector<ll> a){
    vector<ll> pf(n+1, 0);
    for(int i = 1; i <= n; i++) pf[i] = pf[i-1]+a[i];
    auto sum = [&](int i, int j) -> ll{
        return pf[j]-pf[i-1];
    };
    vector<bool> possible_j(n+1, 1);
    ll ans = (1LL<<51)-1;
    for(int it = 50; it >= 0; it--){
        ans ^= (1LL<<it);
        for(int i = 1; i <= n; i++){
            for(int j = 1; j <= n; j++){
                dp[i][j] = 0;
            }
        }
        dp[0][0] = 1;
        for(int i = 1; i <= n; i++){
            for(int j = 1; j <= i; j++){
                bool trs = 0;
                for(int k = 1; k <= i; k++){
                    if((ans|sum(k, i)) == ans){
                        trs |= dp[k-1][j-1];
                    }
                }
                dp[i][j] = trs;
            }
        }
        bool ok = false;
        for(int j = A; j <= B; j++){
            if(dp[n][j]&&possible_j[j]){
                ok = true;
            }
        }
        if(!ok){
            ans ^= (1LL<<it);
            continue;
        }
        for(int j = A; j <= B; j++){
            if(dp[n][j]&&possible_j[j]){
                possible_j[j] = 1;
            }else{
                possible_j[j] = 0;
            }
        }
    }
    cout << ans;
}
ll f[maxn];
void sub5(ll n, ll A, ll B, vector<ll> a){
    vector<ll> pf(n+1, 0);
    for(int i = 1; i <= n; i++) pf[i] = pf[i-1]+a[i];
    auto sum = [&](int i, int j) -> ll{
        return pf[j]-pf[i-1];
    };
    ll ans = (1LL<<51)-1;
    for(int it = 50; it >= 0; it--){
        ans ^= (1LL<<it);
        for(int i = 1; i <= n; i++){
            f[i] = INF;
        }
        f[0] = 0;
        for(int i = 1; i <= n; i++){
            for(int k = 1; k <= i; k++){
                if((ans|sum(k, i)) == ans){
                    f[i] = min(f[i], f[k-1]+1);
                }
            }
        }
        bool ok = false;
        if(f[n] <= B) ok = true;
        if(!ok){
            ans ^= (1LL<<it);
            continue;
        }
    }
    cout << ans;
}
void solve(){
    ll n, A, B;
    cin >> n >> A >> B;
    vector<ll> a(n+1);
    for(int i = 1; i <= n; i++){
        cin >> a[i];
    }
    if(n <= 100){
        sub4(n, A, B, a);
    }else{
        sub5(n, A, B, a);
    }

}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    solve();
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 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 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 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 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 1 ms 600 KB Output is correct
21 Correct 0 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 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 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
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 0 ms 348 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 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 344 KB Output is correct
7 Correct 0 ms 348 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 348 KB Output is correct
12 Correct 1 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 1 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 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 344 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 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 3 ms 348 KB Output is correct
32 Correct 2 ms 348 KB Output is correct
33 Correct 2 ms 348 KB Output is correct
34 Correct 2 ms 348 KB Output is correct
35 Correct 2 ms 348 KB Output is correct
36 Correct 2 ms 568 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 348 KB Output is correct
3 Correct 1 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 344 KB Output is correct
7 Correct 1 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 0 ms 348 KB Output is correct
12 Correct 0 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 348 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 2 ms 344 KB Output is correct
18 Correct 3 ms 348 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 3 ms 348 KB Output is correct
22 Correct 2 ms 468 KB Output is correct
23 Correct 2 ms 344 KB Output is correct
24 Correct 2 ms 348 KB Output is correct
25 Correct 4 ms 348 KB Output is correct
26 Correct 15 ms 624 KB Output is correct
27 Correct 18 ms 604 KB Output is correct
28 Correct 28 ms 604 KB Output is correct
29 Correct 13 ms 604 KB Output is correct
30 Correct 15 ms 672 KB Output is correct
31 Correct 28 ms 600 KB Output is correct
32 Correct 12 ms 676 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 352 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 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 464 KB Output is correct
7 Correct 1 ms 348 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 1 ms 468 KB Output is correct
12 Correct 1 ms 352 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 352 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 472 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 464 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 480 KB Output is correct
25 Correct 0 ms 352 KB Output is correct
26 Correct 0 ms 352 KB Output is correct
27 Correct 1 ms 352 KB Output is correct
28 Correct 1 ms 352 KB Output is correct
29 Correct 1 ms 352 KB Output is correct
30 Correct 0 ms 364 KB Output is correct
31 Correct 0 ms 352 KB Output is correct
32 Correct 1 ms 352 KB Output is correct
33 Correct 1 ms 352 KB Output is correct
34 Correct 1 ms 352 KB Output is correct
35 Correct 0 ms 352 KB Output is correct
36 Correct 1 ms 352 KB Output is correct
37 Correct 1 ms 352 KB Output is correct
38 Correct 1 ms 352 KB Output is correct
39 Correct 3 ms 348 KB Output is correct
40 Correct 3 ms 352 KB Output is correct
41 Correct 4 ms 352 KB Output is correct
42 Correct 2 ms 572 KB Output is correct
43 Correct 2 ms 352 KB Output is correct
44 Correct 2 ms 352 KB Output is correct
45 Correct 2 ms 352 KB Output is correct
46 Correct 2 ms 472 KB Output is correct
47 Correct 2 ms 352 KB Output is correct
48 Correct 4 ms 352 KB Output is correct
49 Correct 8 ms 624 KB Output is correct
50 Correct 10 ms 668 KB Output is correct
51 Correct 14 ms 680 KB Output is correct
52 Correct 13 ms 676 KB Output is correct
53 Correct 14 ms 676 KB Output is correct
54 Correct 25 ms 676 KB Output is correct
55 Correct 13 ms 676 KB Output is correct
56 Correct 2 ms 344 KB Output is correct
57 Correct 8 ms 604 KB Output is correct
58 Correct 10 ms 604 KB Output is correct
59 Correct 14 ms 600 KB Output is correct
60 Correct 13 ms 600 KB Output is correct
61 Correct 13 ms 604 KB Output is correct
62 Correct 13 ms 676 KB Output is correct
63 Correct 18 ms 668 KB Output is correct
64 Correct 10 ms 604 KB Output is correct
65 Correct 3 ms 404 KB Output is correct
66 Correct 4 ms 348 KB Output is correct
67 Correct 7 ms 624 KB Output is correct
68 Correct 11 ms 656 KB Output is correct
69 Correct 17 ms 676 KB Output is correct
70 Correct 13 ms 460 KB Output is correct
71 Correct 15 ms 604 KB Output is correct
72 Correct 13 ms 676 KB Output is correct
73 Correct 17 ms 604 KB Output is correct
74 Correct 25 ms 468 KB Output is correct

Subtask #5
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 1 ms 348 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 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 472 KB Output is correct
14 Correct 1 ms 436 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 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 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 1 ms 348 KB Output is correct
26 Correct 2 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 2 ms 348 KB Output is correct
29 Correct 2 ms 568 KB Output is correct
30 Correct 4 ms 344 KB Output is correct
31 Correct 2 ms 348 KB Output is correct
32 Correct 2 ms 348 KB Output is correct
33 Correct 2 ms 564 KB Output is correct
34 Correct 2 ms 348 KB Output is correct
35 Correct 4 ms 476 KB Output is correct
36 Correct 6 ms 604 KB Output is correct
37 Correct 10 ms 604 KB Output is correct
38 Correct 13 ms 680 KB Output is correct
39 Correct 13 ms 600 KB Output is correct
40 Correct 13 ms 604 KB Output is correct
41 Correct 12 ms 604 KB Output is correct
42 Correct 12 ms 680 KB Output is correct
43 Correct 2 ms 348 KB Output is correct
44 Correct 6 ms 604 KB Output is correct
45 Correct 10 ms 656 KB Output is correct
46 Correct 13 ms 604 KB Output is correct
47 Correct 14 ms 604 KB Output is correct
48 Correct 13 ms 676 KB Output is correct
49 Correct 13 ms 604 KB Output is correct
50 Correct 13 ms 604 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 7 ms 468 KB Output is correct
53 Correct 11 ms 496 KB Output is correct
54 Correct 21 ms 344 KB Output is correct
55 Correct 20 ms 344 KB Output is correct
56 Correct 74 ms 348 KB Output is correct
57 Correct 74 ms 528 KB Output is correct
58 Correct 73 ms 348 KB Output is correct
59 Correct 75 ms 344 KB Output is correct
60 Correct 78 ms 348 KB Output is correct
61 Correct 1 ms 348 KB Output is correct
62 Correct 11 ms 492 KB Output is correct
63 Correct 23 ms 344 KB Output is correct
64 Correct 19 ms 344 KB Output is correct
65 Correct 37 ms 348 KB Output is correct
66 Correct 57 ms 348 KB Output is correct
67 Correct 82 ms 528 KB Output is correct
68 Correct 81 ms 348 KB Output is correct
69 Correct 74 ms 344 KB Output is correct