oj.uz

Submission #743460

# Submission time Handle Problem Language Result Execution time Memory
743460 2023-05-17T12:00:42 Z Magikarp4000 Bali Sculptures (APIO15_sculpture) C++17
100 / 100
 706 ms 4308 KB 
#include <bits/stdc++.h>
using namespace std;
#define OPTM ios_base::sync_with_stdio(0); cin.tie(0);
#define INF int(1e9+7)
#define ln '\n' 
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define us unsigned short
#define FOR(i,s,n) for (int i = s; i < n; i++)
#define FORR(i,n,s) for (int i = n; i > s; i--)
#define FORX(u, arr) for (auto u : arr)
#define PB push_back
#define in(v,x) (v.find(x) != v.end())
#define F first
#define S second
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define UM unordered_map
#define US unordered_set
#define PQ priority_queue
#define ALL(v) v.begin(), v.end()
const ll LLINF = 1e18+1;
#define int long long

const int MAXN = 2e3+1, LOG = 45;
int n,A,B;
int a[MAXN], p[MAXN], res[LOG];
bool dp[MAXN][MAXN], valid[MAXN][MAXN];
int dp1[MAXN];

void lolwhat() {
    dp[0][0] = 1;
    FOR(i,0,n) FOR(j,i,n) valid[i][j] = 1;
    FORR(k,LOG-1,-1) {
        FOR(i,0,n+1) {
            FOR(j,1,n+1) dp[i][j] = 0;
        }
        FOR(j,0,n) {
            FOR(i,0,n+1) {
                FOR(l,i+1,n+1) {
                    int sum = p[l]-p[i];
                    bool val = sum&(1LL<<(k));
                    dp[l][j+1] = dp[l][j+1] || (dp[i][j] && valid[i][l-1] && !val);
                }
            }
        }
        res[k] = 1;
        FOR(x,A,B+1) {
            if (dp[n][x]) res[k] = 0;
        }
        FOR(i,0,n) {
            FOR(j,i,n) {
                int sum = p[j+1]-p[i];
                bool val = sum&(1LL<<(k));
                if (val && !res[k]) valid[i][j] = 0;
            }
        }
    }
    int ans = 0, cur = 1;
    FOR(k,0,LOG+1) {
        ans += cur*res[k];
        cur *= 2;
    }
    cout << ans;
}

void lolbruh() {
    dp1[0] = 0;
    FOR(i,0,n) FOR(j,i,n) valid[i][j] = 1;
    FORR(k,LOG-1,-1) {
        FOR(i,1,n+1) dp1[i] = LLINF;
        FOR(i,0,n+1) {
            FOR(l,i+1,n+1) {
                int sum = p[l]-p[i];
                bool val = sum&(1LL<<(k));
                if (valid[i][l-1] && !val) {
                    dp1[l] = min(dp1[l], dp1[i]+1);
                }
            }
        }
        res[k] = dp1[n] <= B ? 0 : 1;
        FOR(i,0,n) {
            FOR(j,i,n) {
                int sum = p[j+1]-p[i];
                bool val = sum&(1LL<<(k));
                if (val && !res[k]) valid[i][j] = 0;
            }
        }
    }
    int ans = 0, cur = 1;
    FOR(k,0,LOG+1) {
        ans += cur*res[k];
        cur *= 2;
    }
    cout << ans;
}

signed main() {
    OPTM;
    cin >> n >> A >> B;
    FOR(i,0,n) cin >> a[i];
    FOR(i,1,n+1) p[i] = p[i-1]+a[i-1];
    if (A == 1) lolbruh();
    else lolwhat();
}

Compilation message

sculpture.cpp: In function 'void lolwhat()':
sculpture.cpp:62:25: warning: iteration 45 invokes undefined behavior [-Waggressive-loop-optimizations]
   62 |         ans += cur*res[k];
      |                    ~~~~~^
sculpture.cpp:10:38: note: within this loop
   10 | #define FOR(i,s,n) for (int i = s; i < n; i++)
......
   61 |     FOR(k,0,LOG+1) {
      |         ~~~~~~~~~                     
sculpture.cpp:61:5: note: in expansion of macro 'FOR'
   61 |     FOR(k,0,LOG+1) {
      |     ^~~
sculpture.cpp: In function 'void lolbruh()':
sculpture.cpp:93:25: warning: iteration 45 invokes undefined behavior [-Waggressive-loop-optimizations]
   93 |         ans += cur*res[k];
      |                    ~~~~~^
sculpture.cpp:10:38: note: within this loop
   10 | #define FOR(i,s,n) for (int i = s; i < n; i++)
......
   92 |     FOR(k,0,LOG+1) {
      |         ~~~~~~~~~                     
sculpture.cpp:92:5: note: in expansion of macro 'FOR'
   92 |     FOR(k,0,LOG+1) {
      |     ^~~

Subtask #1
9.0 / 9.0

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

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 368 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 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 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 316 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 264 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 516 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 1 ms 468 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 312 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 3 ms 416 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 2 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 1 ms 468 KB Output is correct
50 Correct 1 ms 468 KB Output is correct
51 Correct 2 ms 468 KB Output is correct
52 Correct 1 ms 468 KB Output is correct
53 Correct 1 ms 468 KB Output is correct
54 Correct 1 ms 468 KB Output is correct
55 Correct 1 ms 468 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 3 ms 472 KB Output is correct
58 Correct 2 ms 468 KB Output is correct
59 Correct 3 ms 468 KB Output is correct
60 Correct 2 ms 472 KB Output is correct
61 Correct 2 ms 480 KB Output is correct
62 Correct 2 ms 480 KB Output is correct
63 Correct 2 ms 476 KB Output is correct
64 Correct 26 ms 676 KB Output is correct
65 Correct 6 ms 536 KB Output is correct
66 Correct 11 ms 596 KB Output is correct
67 Correct 25 ms 596 KB Output is correct
68 Correct 28 ms 684 KB Output is correct
69 Correct 35 ms 724 KB Output is correct
70 Correct 34 ms 724 KB Output is correct
71 Correct 47 ms 724 KB Output is correct
72 Correct 37 ms 732 KB Output is correct
73 Correct 38 ms 724 KB Output is correct
74 Correct 44 ms 724 KB Output is correct

Subtask #5
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 352 KB Output is correct
11 Correct 1 ms 352 KB Output is correct
12 Correct 0 ms 352 KB Output is correct
13 Correct 1 ms 352 KB Output is correct
14 Correct 0 ms 352 KB Output is correct
15 Correct 1 ms 352 KB Output is correct
16 Correct 1 ms 352 KB Output is correct
17 Correct 1 ms 352 KB Output is correct
18 Correct 1 ms 352 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 372 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 2 ms 468 KB Output is correct
37 Correct 1 ms 468 KB Output is correct
38 Correct 2 ms 468 KB Output is correct
39 Correct 1 ms 468 KB Output is correct
40 Correct 1 ms 468 KB Output is correct
41 Correct 1 ms 468 KB Output is correct
42 Correct 1 ms 468 KB Output is correct
43 Correct 1 ms 372 KB Output is correct
44 Correct 2 ms 468 KB Output is correct
45 Correct 2 ms 516 KB Output is correct
46 Correct 3 ms 468 KB Output is correct
47 Correct 1 ms 468 KB Output is correct
48 Correct 1 ms 468 KB Output is correct
49 Correct 2 ms 468 KB Output is correct
50 Correct 2 ms 468 KB Output is correct
51 Correct 3 ms 468 KB Output is correct
52 Correct 57 ms 1460 KB Output is correct
53 Correct 96 ms 1792 KB Output is correct
54 Correct 172 ms 2312 KB Output is correct
55 Correct 172 ms 2308 KB Output is correct
56 Correct 690 ms 4288 KB Output is correct
57 Correct 706 ms 4308 KB Output is correct
58 Correct 385 ms 4308 KB Output is correct
59 Correct 230 ms 4300 KB Output is correct
60 Correct 244 ms 4308 KB Output is correct
61 Correct 2 ms 468 KB Output is correct
62 Correct 83 ms 1812 KB Output is correct
63 Correct 164 ms 2384 KB Output is correct
64 Correct 147 ms 2260 KB Output is correct
65 Correct 272 ms 3124 KB Output is correct
66 Correct 404 ms 3796 KB Output is correct
67 Correct 537 ms 4308 KB Output is correct
68 Correct 511 ms 4308 KB Output is correct
69 Correct 509 ms 4308 KB Output is correct