oj.uz

Submission #656316

# Submission time Handle Problem Language Result Execution time Memory
656316 2022-11-06T23:34:40 Z Ronin13 Bali Sculptures (APIO15_sculpture) C++14
71 / 100
 1000 ms 4300 KB 
#include <iostream>
#include <math.h>
#define ll long long
#define ull unsigned ll
#define f first
#define s second
#define pb push_back
#define epb empalce_back
#define pii pair<int,int>
#define pll pair<ll,ll>
using namespace std;


int main(){
    int n; cin >> n;
    int a; cin >> a;
    int b; cin >> b;
    ll x[n + 1];
    for(int i= 1; i <= n; i++) cin >> x[i];
    ll pref[n + 1];
    pref[0] = 0;
    for(int i = 1; i <= n; i++)
        pref[i] = pref[i - 1] + x[i];
    if(n <= 100){
        ll ans = 0;
        ll cnt[n + 1][n + 1];
        for(int j = 0; j <= n; j++){
            for(int i = j + 1; i <= n; i++){
                cnt[j][i] = 0;
            }
        }
        int C = 0;
        for(int u = 50; u >= 1; u--){
            ll mod = (1LL << u);
            bool dp[n + 1][n + 1];
            for(int i= 0; i <= n; i++){
                for(int j = 0; j <= n; j++){
                    dp[i][j] = false;
                }
            }

            dp[0][0] = true;

            for(int i = 1; i <= n; i++){
                for(int j = i - 1; j >= 0; j--){
                    ll val = pref[i] - pref[j];
                    if((val % mod) >= (mod / 2)) continue;
                    if(cnt[j][i] == C){
                        for(int x = 0; x < n; x++){
                            dp[i][x + 1] |= dp[j][x];
                        }
                    }
                }
            }
            //cout << dp[n][1] << "\n";
            bool ind = false;
            for(int i = a; i <= b; i++){
                if(dp[n][i]) ind = true;
            }
            if(ind){
                C++;
                for(int i= 1; i <= n; i++){
                    for(int j = i - 1; j >= 0; j--){
                        ll val = pref[i] - pref[j];
                        if((val % mod) < (mod / 2)) cnt[j][i]++;
                    }
                }
            }
            else ans += (1LL << (u - 1));
        }
        cout << ans;
        return 0;
    }
    ll ans = 0;
        bool cnt[n + 1][n + 1];
        for(int j = 0; j <= n; j++){
            for(int i = j + 1; i <= n; i++){
                cnt[j][i] = 1;
            }
        }
        int C = 0;
        for(int u = 40; u >= 1; u--){
            ll mod = (1LL << u);
            int dp[n + 1];
            for(int i= 0; i <= n; i++){
                dp[i] = b + 1;
            }

            dp[0] = 0;

            for(int i = 1; i <= n; i++){
                for(int j = i - 1; j >= 0; j--){
                    ll val = pref[i] - pref[j];
                    val %= mod;
                    if(2 * val >= mod) continue;
                    if(cnt[j][i]){
                       dp[i] = min(dp[i], dp[j] + 1);
                    }
                }
            }
            //cout << dp[n][1] << "\n";
            bool ind = false;
            if(dp[n] <= b) ind = true;
            if(ind){
                C++;
                for(int i= 1; i <= n; i++){
                    for(int j = i - 1; j >= 0; j--){
                        ll val = pref[i] - pref[j];
                        val %= mod;
                        if(2 * val >= mod) cnt[j][i] = false;
                    }
                }
            }
            else ans += (1LL << (u - 1));
        }
        cout << ans;
    return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 280 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 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 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 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 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 212 KB Output is correct
22 Correct 1 ms 212 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 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 0 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 0 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 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 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 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 0 ms 212 KB Output is correct
22 Correct 1 ms 212 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 212 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 212 KB Output is correct
29 Correct 3 ms 212 KB Output is correct
30 Correct 3 ms 212 KB Output is correct
31 Correct 4 ms 312 KB Output is correct
32 Correct 4 ms 212 KB Output is correct
33 Correct 3 ms 212 KB Output is correct
34 Correct 3 ms 212 KB Output is correct
35 Correct 3 ms 212 KB Output is correct
36 Correct 3 ms 212 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 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 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 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 2 ms 288 KB Output is correct
17 Correct 2 ms 212 KB Output is correct
18 Correct 3 ms 316 KB Output is correct
19 Correct 4 ms 212 KB Output is correct
20 Correct 4 ms 212 KB Output is correct
21 Correct 4 ms 212 KB Output is correct
22 Correct 3 ms 212 KB Output is correct
23 Correct 6 ms 212 KB Output is correct
24 Correct 4 ms 212 KB Output is correct
25 Correct 7 ms 336 KB Output is correct
26 Correct 12 ms 352 KB Output is correct
27 Correct 16 ms 340 KB Output is correct
28 Correct 20 ms 340 KB Output is correct
29 Correct 19 ms 380 KB Output is correct
30 Correct 20 ms 380 KB Output is correct
31 Correct 20 ms 372 KB Output is correct
32 Correct 20 ms 340 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 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 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 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 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 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 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 1 ms 212 KB Output is correct
39 Correct 2 ms 212 KB Output is correct
40 Correct 2 ms 212 KB Output is correct
41 Correct 3 ms 212 KB Output is correct
42 Correct 4 ms 212 KB Output is correct
43 Correct 4 ms 212 KB Output is correct
44 Correct 3 ms 212 KB Output is correct
45 Correct 3 ms 212 KB Output is correct
46 Correct 3 ms 212 KB Output is correct
47 Correct 4 ms 212 KB Output is correct
48 Correct 9 ms 328 KB Output is correct
49 Correct 17 ms 348 KB Output is correct
50 Correct 19 ms 340 KB Output is correct
51 Correct 31 ms 340 KB Output is correct
52 Correct 21 ms 340 KB Output is correct
53 Correct 22 ms 380 KB Output is correct
54 Correct 23 ms 384 KB Output is correct
55 Correct 19 ms 384 KB Output is correct
56 Correct 2 ms 320 KB Output is correct
57 Correct 6 ms 340 KB Output is correct
58 Correct 9 ms 364 KB Output is correct
59 Correct 10 ms 340 KB Output is correct
60 Correct 9 ms 384 KB Output is correct
61 Correct 17 ms 380 KB Output is correct
62 Correct 12 ms 340 KB Output is correct
63 Correct 12 ms 340 KB Output is correct
64 Correct 17 ms 368 KB Output is correct
65 Correct 3 ms 212 KB Output is correct
66 Correct 4 ms 212 KB Output is correct
67 Correct 5 ms 340 KB Output is correct
68 Correct 8 ms 364 KB Output is correct
69 Correct 11 ms 340 KB Output is correct
70 Correct 10 ms 384 KB Output is correct
71 Correct 11 ms 384 KB Output is correct
72 Correct 12 ms 340 KB Output is correct
73 Correct 11 ms 380 KB Output is correct
74 Correct 11 ms 340 KB Output is correct

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 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 232 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 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 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 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 2 ms 212 KB Output is correct
27 Correct 4 ms 212 KB Output is correct
28 Correct 4 ms 212 KB Output is correct
29 Correct 4 ms 212 KB Output is correct
30 Correct 3 ms 212 KB Output is correct
31 Correct 4 ms 212 KB Output is correct
32 Correct 3 ms 212 KB Output is correct
33 Correct 4 ms 212 KB Output is correct
34 Correct 3 ms 320 KB Output is correct
35 Correct 6 ms 212 KB Output is correct
36 Correct 10 ms 348 KB Output is correct
37 Correct 15 ms 340 KB Output is correct
38 Correct 21 ms 380 KB Output is correct
39 Correct 19 ms 376 KB Output is correct
40 Correct 22 ms 340 KB Output is correct
41 Correct 22 ms 340 KB Output is correct
42 Correct 22 ms 380 KB Output is correct
43 Correct 2 ms 212 KB Output is correct
44 Correct 6 ms 340 KB Output is correct
45 Correct 8 ms 368 KB Output is correct
46 Correct 10 ms 384 KB Output is correct
47 Correct 11 ms 384 KB Output is correct
48 Correct 10 ms 340 KB Output is correct
49 Correct 11 ms 380 KB Output is correct
50 Correct 11 ms 340 KB Output is correct
51 Correct 3 ms 212 KB Output is correct
52 Correct 69 ms 596 KB Output is correct
53 Correct 125 ms 852 KB Output is correct
54 Correct 214 ms 1268 KB Output is correct
55 Correct 215 ms 1356 KB Output is correct
56 Correct 882 ms 4232 KB Output is correct
57 Correct 903 ms 4300 KB Output is correct
58 Correct 885 ms 4228 KB Output is correct
59 Execution timed out 1014 ms 4232 KB Time limit exceeded
60 Halted 0 ms 0 KB -