oj.uz

Submission #1073900

# Submission time Handle Problem Language Result Execution time Memory
1073900 2024-08-25T02:38:52 Z ngrace Bali Sculptures (APIO15_sculpture) C++14
46 / 100
 76 ms 1196 KB 
#include <bits/stdc++.h>
using namespace std;
#define v vector
#define ll long long
#define ii pair<int,int>
#define fi first
#define se second
#define on(i,mask) ((bool)((1<<(i)) & (mask)))

int main(){
    int N,A,B;
    cin>>N>>A>>B;
    v<ll> Y(N+1,0);
    v<ll> psum(N+1, 0);
    ll maxY = 0;
    for(int i=1; i<=N; i++){
        cin>>Y[i];
        maxY = max(maxY, Y[i]);
        psum[i] = psum[i-1]+Y[i];
    }

    if(true && N<=20){//sub1
        ll ans = 1e18;
        for(int div = (1<<N); div<(1<<(N+1)); div++){
            int g = 1;
            int l=0;
            ll res = 0;
            for(int i=1; i<=N; i++){
                if(i!=1 && on(i-2,div)!=on(i-1,div)){
                    g++;
                    res = res | (psum[i-1] - psum[l]);
                    l=i-1;
                }
            }
            res = res | (psum[N]-psum[l]);

            if(A<=g && g<=B) ans = min(ans, res);
        }
        cout<<ans<<endl;
    }
    else if(true && N<=50 && B<=20 && maxY<=10){//sub2
        v<v<v<bool>>> dp(B+1, v<v<bool>>(N+1, v<bool>(maxY*N+1, false)));
        dp[0][0][0] = true;
        for(int b=0; b<B; b++){
            for(int n=0; n<=N; n++){
                for(int o=0;o<=maxY*N;o++){
                    if(dp[b][n][o]){//can cover first n in b groups with or sum o
                        for(int i=n+1; i<=N; i++){
                            dp[b+1][i][o | (psum[i]-psum[n])] = true;
                        }
                    }
                }
            }
        }

        int ans = maxY*N;
        for(int b=A; b<=B; b++){
            for(int o=0; o<=ans; o++){
                if(dp[b][N][o]){
                    ans=o;
                    break;
                }
            }
        }
        cout<<ans<<endl;
    }
    else if(N<=100 && A==1 && maxY<=20){//sub3
        v<v<int>> dp(N+1, v<int>(maxY*N+1, 1e9));
        dp[0][0] = 0;
        for(int n=0; n<=N; n++){
            for(int o=0;o<=maxY*N;o++){
                if(dp[n][o] !=1e9){//min groups to cover first n with or sum o
                    for(int i=n+1; i<=N; i++){
                        dp[i][o | (psum[i]-psum[n])] = min(dp[i][o | (psum[i]-psum[n])], dp[n][o]+1);
                    }
                }
            }
        }

        int ans = maxY*N;
        for(int o=0; o<=ans; o++){
            if(dp[N][o]<=B){
                ans=o;
                break;
            }
        }
        cout<<ans<<endl;
    }
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory 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 2 ms 348 KB Output is correct
7 Correct 8 ms 432 KB Output is correct
8 Correct 70 ms 348 KB Output is correct
9 Correct 70 ms 344 KB Output is correct
10 Correct 70 ms 344 KB Output is correct
11 Correct 70 ms 348 KB Output is correct
12 Correct 70 ms 344 KB Output is correct
13 Correct 68 ms 412 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 344 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 8 ms 432 KB Output is correct
21 Correct 71 ms 408 KB Output is correct
22 Correct 65 ms 348 KB Output is correct
23 Correct 65 ms 348 KB Output is correct
24 Correct 75 ms 348 KB Output is correct
25 Correct 66 ms 348 KB Output is correct
26 Correct 64 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 34 ms 348 KB Output is correct
31 Correct 67 ms 348 KB Output is correct
32 Correct 71 ms 348 KB Output is correct
33 Correct 66 ms 344 KB Output is correct
34 Correct 76 ms 348 KB Output is correct
35 Correct 72 ms 412 KB Output is correct
36 Correct 68 ms 348 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 432 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 388 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 3 ms 436 KB Output is correct
7 Correct 9 ms 436 KB Output is correct
8 Correct 70 ms 344 KB Output is correct
9 Correct 71 ms 348 KB Output is correct
10 Correct 70 ms 412 KB Output is correct
11 Correct 74 ms 344 KB Output is correct
12 Correct 70 ms 344 KB Output is correct
13 Correct 68 ms 348 KB Output is correct
14 Correct 0 ms 344 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 2 ms 348 KB Output is correct
20 Correct 8 ms 432 KB Output is correct
21 Correct 65 ms 416 KB Output is correct
22 Correct 65 ms 348 KB Output is correct
23 Correct 65 ms 344 KB Output is correct
24 Correct 69 ms 412 KB Output is correct
25 Correct 65 ms 348 KB Output is correct
26 Correct 64 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 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 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory 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 1 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 9 ms 348 KB Output is correct
8 Correct 70 ms 408 KB Output is correct
9 Correct 70 ms 412 KB Output is correct
10 Correct 71 ms 344 KB Output is correct
11 Correct 70 ms 344 KB Output is correct
12 Correct 70 ms 348 KB Output is correct
13 Correct 68 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 1 ms 344 KB Output is correct
17 Correct 1 ms 520 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 604 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 1 ms 600 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 860 KB Output is correct
27 Correct 1 ms 860 KB Output is correct
28 Correct 1 ms 1116 KB Output is correct
29 Correct 1 ms 1116 KB Output is correct
30 Correct 1 ms 1116 KB Output is correct
31 Correct 1 ms 1116 KB Output is correct
32 Correct 1 ms 1116 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory 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 2 ms 348 KB Output is correct
7 Correct 8 ms 348 KB Output is correct
8 Correct 74 ms 428 KB Output is correct
9 Correct 71 ms 348 KB Output is correct
10 Correct 70 ms 344 KB Output is correct
11 Correct 70 ms 344 KB Output is correct
12 Correct 73 ms 348 KB Output is correct
13 Correct 74 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 2 ms 348 KB Output is correct
20 Correct 8 ms 348 KB Output is correct
21 Correct 64 ms 416 KB Output is correct
22 Correct 65 ms 348 KB Output is correct
23 Correct 65 ms 348 KB Output is correct
24 Correct 69 ms 348 KB Output is correct
25 Correct 65 ms 412 KB Output is correct
26 Correct 64 ms 348 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 436 KB Output is correct
30 Correct 34 ms 348 KB Output is correct
31 Correct 66 ms 412 KB Output is correct
32 Correct 70 ms 412 KB Output is correct
33 Correct 65 ms 348 KB Output is correct
34 Correct 68 ms 344 KB Output is correct
35 Correct 70 ms 348 KB Output is correct
36 Correct 68 ms 348 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 2 ms 344 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 1 ms 504 KB Output is correct
47 Correct 0 ms 604 KB Output is correct
48 Correct 1 ms 600 KB Output is correct
49 Correct 1 ms 860 KB Output is correct
50 Correct 1 ms 860 KB Output is correct
51 Correct 1 ms 1116 KB Output is correct
52 Correct 1 ms 1116 KB Output is correct
53 Correct 1 ms 1196 KB Output is correct
54 Correct 1 ms 1116 KB Output is correct
55 Correct 1 ms 1116 KB Output is correct
56 Incorrect 0 ms 348 KB Output isn't correct
57 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory 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 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 8 ms 348 KB Output is correct
8 Correct 70 ms 416 KB Output is correct
9 Correct 70 ms 348 KB Output is correct
10 Correct 70 ms 348 KB Output is correct
11 Correct 70 ms 348 KB Output is correct
12 Correct 70 ms 348 KB Output is correct
13 Correct 71 ms 592 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 34 ms 344 KB Output is correct
18 Correct 74 ms 348 KB Output is correct
19 Correct 72 ms 348 KB Output is correct
20 Correct 66 ms 348 KB Output is correct
21 Correct 71 ms 348 KB Output is correct
22 Correct 70 ms 348 KB Output is correct
23 Correct 68 ms 344 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 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 1 ms 348 KB Output is correct
30 Correct 0 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 0 ms 604 KB Output is correct
35 Correct 1 ms 600 KB Output is correct
36 Correct 1 ms 860 KB Output is correct
37 Correct 1 ms 860 KB Output is correct
38 Correct 1 ms 1112 KB Output is correct
39 Correct 1 ms 1116 KB Output is correct
40 Correct 1 ms 1116 KB Output is correct
41 Correct 1 ms 1116 KB Output is correct
42 Correct 2 ms 1116 KB Output is correct
43 Incorrect 0 ms 348 KB Output isn't correct
44 Halted 0 ms 0 KB -