oj.uz

Submission #743446

# Submission time Handle Problem Language Result Execution time Memory
743446 2023-05-17T11:46:49 Z Magikarp4000 Bali Sculptures (APIO15_sculpture) C++17
71 / 100
 66 ms 3240 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 = 1e2+1, MAXN1 = 2e3+1, LOG = 41;
int n,A,B;
int a[MAXN], p[MAXN], res[LOG];
bool dp[MAXN][MAXN], valid[MAXN][MAXN];
vector<int> v[MAXN][MAXN];
int dp1[MAXN1];

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) {
                    dp[l][j+1] = dp[l][j+1] || (dp[i][j] && valid[i][l-1] && !v[i][l-1][k]);
                }
            }
        }
        res[k] = 1;
        FOR(x,A,B+1) {
            if (dp[n][x]) res[k] = 0;
        }
        FOR(i,0,n) {
            FOR(j,i,n) {
                if (v[i][j][k] && !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) {
                if (valid[i][l-1] && !v[i][l-1][k]) {
                    dp1[l] = min(dp1[l], dp1[i]+1);
                }
            }
        }
        res[k] = dp1[n] <= B ? 0 : 1;
        FOR(i,0,n) {
            FOR(j,i,n) {
                if (v[i][j][k] && !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];
    FOR(i,0,n) {
        FOR(j,i,n) {
            int x = p[j+1]-p[i];
            while (x > 0) {
                v[i][j].PB(x%2);
                x /= 2;
            }
            int vn = v[i][j].size();
            FOR(k,0,LOG-vn) v[i][j].PB(0);
        }
    }
    if (A == 1) lolbruh();
    else lolwhat();
}

Compilation message

sculpture.cpp: In function 'void lolwhat()':
sculpture.cpp:59:25: warning: iteration 41 invokes undefined behavior [-Waggressive-loop-optimizations]
   59 |         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++)
......
   58 |     FOR(k,0,LOG+1) {
      |         ~~~~~~~~~                     
sculpture.cpp:58:5: note: in expansion of macro 'FOR'
   58 |     FOR(k,0,LOG+1) {
      |     ^~~
sculpture.cpp: In function 'void lolbruh()':
sculpture.cpp:86:25: warning: iteration 41 invokes undefined behavior [-Waggressive-loop-optimizations]
   86 |         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++)
......
   85 |     FOR(k,0,LOG+1) {
      |         ~~~~~~~~~                     
sculpture.cpp:85:5: note: in expansion of macro 'FOR'
   85 |     FOR(k,0,LOG+1) {
      |     ^~~

Subtask #1
9.0 / 9.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 724 KB Output is correct
16 Correct 1 ms 852 KB Output is correct
17 Correct 1 ms 980 KB Output is correct
18 Correct 1 ms 1108 KB Output is correct
19 Correct 1 ms 1108 KB Output is correct
20 Correct 2 ms 1108 KB Output is correct
21 Correct 2 ms 1236 KB Output is correct
22 Correct 2 ms 1236 KB Output is correct
23 Correct 1 ms 1108 KB Output is correct
24 Correct 1 ms 1236 KB Output is correct
25 Correct 2 ms 1620 KB Output is correct
26 Correct 3 ms 2132 KB Output is correct
27 Correct 3 ms 2644 KB Output is correct
28 Correct 4 ms 3156 KB Output is correct
29 Correct 7 ms 3156 KB Output is correct
30 Correct 5 ms 3184 KB Output is correct
31 Correct 4 ms 3156 KB Output is correct
32 Correct 5 ms 3156 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 496 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 1 ms 596 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 2 ms 596 KB Output is correct
25 Correct 1 ms 596 KB Output is correct
26 Correct 2 ms 596 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 596 KB Output is correct
29 Correct 1 ms 596 KB Output is correct
30 Correct 1 ms 596 KB Output is correct
31 Correct 1 ms 596 KB Output is correct
32 Correct 1 ms 596 KB Output is correct
33 Correct 1 ms 596 KB Output is correct
34 Correct 1 ms 596 KB Output is correct
35 Correct 1 ms 596 KB Output is correct
36 Correct 1 ms 596 KB Output is correct
37 Correct 1 ms 596 KB Output is correct
38 Correct 1 ms 724 KB Output is correct
39 Correct 1 ms 852 KB Output is correct
40 Correct 1 ms 980 KB Output is correct
41 Correct 1 ms 1108 KB Output is correct
42 Correct 2 ms 1236 KB Output is correct
43 Correct 2 ms 1236 KB Output is correct
44 Correct 1 ms 1236 KB Output is correct
45 Correct 2 ms 1236 KB Output is correct
46 Correct 1 ms 1108 KB Output is correct
47 Correct 2 ms 1236 KB Output is correct
48 Correct 2 ms 1620 KB Output is correct
49 Correct 2 ms 2132 KB Output is correct
50 Correct 4 ms 2644 KB Output is correct
51 Correct 4 ms 3188 KB Output is correct
52 Correct 4 ms 3156 KB Output is correct
53 Correct 4 ms 3156 KB Output is correct
54 Correct 4 ms 3156 KB Output is correct
55 Correct 4 ms 3156 KB Output is correct
56 Correct 2 ms 1236 KB Output is correct
57 Correct 3 ms 2132 KB Output is correct
58 Correct 4 ms 2644 KB Output is correct
59 Correct 4 ms 3156 KB Output is correct
60 Correct 4 ms 3156 KB Output is correct
61 Correct 4 ms 3156 KB Output is correct
62 Correct 4 ms 3156 KB Output is correct
63 Correct 4 ms 3188 KB Output is correct
64 Correct 41 ms 2644 KB Output is correct
65 Correct 9 ms 1264 KB Output is correct
66 Correct 18 ms 1620 KB Output is correct
67 Correct 31 ms 2132 KB Output is correct
68 Correct 51 ms 2728 KB Output is correct
69 Correct 66 ms 3176 KB Output is correct
70 Correct 59 ms 3156 KB Output is correct
71 Correct 58 ms 3168 KB Output is correct
72 Correct 60 ms 3156 KB Output is correct
73 Correct 59 ms 3156 KB Output is correct
74 Correct 60 ms 3152 KB Output is correct

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 576 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 1 ms 708 KB Output is correct
20 Correct 1 ms 596 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 1 ms 596 KB Output is correct
25 Correct 1 ms 724 KB Output is correct
26 Correct 1 ms 852 KB Output is correct
27 Correct 1 ms 980 KB Output is correct
28 Correct 2 ms 1108 KB Output is correct
29 Correct 2 ms 1236 KB Output is correct
30 Correct 1 ms 1108 KB Output is correct
31 Correct 2 ms 1236 KB Output is correct
32 Correct 1 ms 1108 KB Output is correct
33 Correct 1 ms 1236 KB Output is correct
34 Correct 1 ms 1236 KB Output is correct
35 Correct 2 ms 1644 KB Output is correct
36 Correct 3 ms 2132 KB Output is correct
37 Correct 3 ms 2628 KB Output is correct
38 Correct 4 ms 3156 KB Output is correct
39 Correct 5 ms 3156 KB Output is correct
40 Correct 4 ms 3156 KB Output is correct
41 Correct 4 ms 3156 KB Output is correct
42 Correct 4 ms 3192 KB Output is correct
43 Correct 2 ms 1236 KB Output is correct
44 Correct 3 ms 2132 KB Output is correct
45 Correct 6 ms 2740 KB Output is correct
46 Correct 6 ms 3156 KB Output is correct
47 Correct 4 ms 3156 KB Output is correct
48 Correct 4 ms 3156 KB Output is correct
49 Correct 4 ms 3156 KB Output is correct
50 Correct 4 ms 3156 KB Output is correct
51 Correct 6 ms 3240 KB Output is correct
52 Runtime error 1 ms 852 KB Execution killed with signal 11
53 Halted 0 ms 0 KB -