oj.uz

Submission #551389

# Submission time Handle Problem Language Result Execution time Memory
551389 2022-04-20T14:36:46 Z ala2 Bali Sculptures (APIO15_sculpture) C++14
46 / 100
 75 ms 16076 KB 
    #include <bits/stdc++.h>
    #define owo(i,a, b) for(int i=(a); i<(b); ++i)
    #define uwu(i,a, b) for(int i=(a)-1; i>=(b); --i)
    #define senpai push_back
    #define ttgl pair<int, int> 
    #define ayaya cout<<"debug"<<endl
     
    using namespace std;
    using ll = long long;
    using ld = long double;
    const ll MOD = 1e9+7;
    const int INF = 0x3f3f3f3f;
    const ll INFLL = 0x3f3f3f3f3f3f3f3f;
    vector<ll> arr;
    vector<ll> psum;
    int dp[2002][2002];
    int n, a, b;
    ll currbest = 0;
    bool solve(ll bit) {
        ll mx = currbest+(1LL<<bit);
        if(a==1) {
            owo(i, 0, n+1) {
                dp[0][i] = INF;
            }
            dp[0][0] = 0;
            owo(i, 0, n) {
                owo(j, 0, i+1) {
                    //cout<<currbest<<" "<<(psum[i+1]-psum[j])<<" "<<(currbest|(psum[i+1]-psum[j]))<<" "<<mx<<"\n";
                    if((currbest|(psum[i+1]-psum[j]))<mx) {
                        dp[0][i+1] = min(dp[0][i+1] , dp[0][j] + 1);
                    }
                }
            }
            return dp[0][n]>b;
            
        }else {
            owo(i, 0, 2002) {
                owo(j, 0, 2002) {
                    dp[i][j] = 0;
                }
            }
            dp[0][0] = 1;
            owo(i, 0, n) {
                owo(j, 0, i+1) {
                    if((currbest|(psum[i+1]-psum[j]))<mx) {
                        owo(k, 0, b) {
                            if(dp[j][k]) {
                                dp[i+1][k+1] = 1;
                            }
                        }
                    }
                }
            }
            for(int i=a; i<=b; ++i) {
                if(dp[n][i]) {
                    return false;
                }
            }
            return true;
        }
    }
    int main()
    {
        //freopen("filename.in", "r", stdin);
        //freopen("filename.out", "w", stdout);
        cin.tie(0)->sync_with_stdio(0);
        cin>>n>>a>>b;
        arr.resize(n);
        psum.resize(n+1);
        psum[0] = 0;
        owo(i, 0, n) {
            cin>>arr[i];
            psum[i+1] = psum[i] + arr[i];
        }
        for(ll i = 35; i>=0; --i) {
            if(solve(i)) {
                currbest+=(1LL<<i);
            }
        }
        cout<<currbest<<"\n";
        return 0;
    }

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 324 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 328 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 63 ms 15912 KB Output is correct
15 Correct 65 ms 15956 KB Output is correct
16 Correct 64 ms 15988 KB Output is correct
17 Correct 68 ms 15992 KB Output is correct
18 Correct 70 ms 16068 KB Output is correct
19 Correct 67 ms 15956 KB Output is correct
20 Correct 64 ms 15956 KB Output is correct
21 Correct 63 ms 15892 KB Output is correct
22 Correct 64 ms 16076 KB Output is correct
23 Correct 68 ms 15956 KB Output is correct
24 Correct 68 ms 15992 KB Output is correct
25 Correct 72 ms 15956 KB Output is correct
26 Correct 68 ms 15956 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 324 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 320 KB Output is correct
36 Correct 1 ms 212 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 67 ms 15956 KB Output is correct
15 Correct 66 ms 15956 KB Output is correct
16 Correct 75 ms 15988 KB Output is correct
17 Correct 68 ms 15984 KB Output is correct
18 Correct 69 ms 15988 KB Output is correct
19 Correct 66 ms 15988 KB Output is correct
20 Correct 65 ms 15980 KB Output is correct
21 Correct 67 ms 16076 KB Output is correct
22 Correct 66 ms 15984 KB Output is correct
23 Correct 73 ms 15944 KB Output is correct
24 Correct 66 ms 15992 KB Output is correct
25 Correct 67 ms 15932 KB Output is correct
26 Correct 75 ms 15988 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 320 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 324 KB Output is correct
36 Correct 1 ms 324 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 324 KB Output is correct
22 Correct 1 ms 328 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 328 KB Output is correct
28 Correct 1 ms 328 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 65 ms 15984 KB Output is correct
15 Correct 68 ms 15956 KB Output is correct
16 Correct 70 ms 15988 KB Output is correct
17 Correct 69 ms 16064 KB Output is correct
18 Correct 67 ms 16000 KB Output is correct
19 Correct 72 ms 15984 KB Output is correct
20 Correct 64 ms 15996 KB Output is correct
21 Correct 66 ms 15984 KB Output is correct
22 Correct 71 ms 15988 KB Output is correct
23 Correct 67 ms 16076 KB Output is correct
24 Correct 64 ms 15988 KB Output is correct
25 Correct 64 ms 15984 KB Output is correct
26 Correct 65 ms 15992 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 328 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 1 ms 332 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 332 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 1 ms 324 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 1 ms 212 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 1 ms 212 KB Output is correct
56 Correct 1 ms 212 KB Output is correct
57 Correct 1 ms 212 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 1 ms 216 KB Output is correct
61 Incorrect 1 ms 212 KB Output isn't correct
62 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 224 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 324 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 328 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 320 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 328 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 328 KB Output is correct
36 Correct 1 ms 216 KB Output is correct
37 Correct 1 ms 216 KB Output is correct
38 Correct 1 ms 216 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 328 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 1 ms 324 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Incorrect 1 ms 212 KB Output isn't correct
49 Halted 0 ms 0 KB -