oj.uz

Submission #577868

# Submission time Handle Problem Language Result Execution time Memory
577868 2022-06-15T10:45:07 Z MohamedFaresNebili Bali Sculptures (APIO15_sculpture) C++14
100 / 100
 90 ms 468 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("Ofast")
#pragma GCC target ("avx2")
#include <ext/pb_ds/assoc_container.hpp>

        using namespace std;
        using namespace __gnu_pbds;

        using ll = long long;
        using ii = pair<int, int>;
        using vi = vector<int>;
        using pi = array<int, 3>;

        #define pb push_back
        #define pp pop_back
        #define ff first
        #define ss second
        #define all(x) (x).begin(), (x).end()
        #define int ll
        #define lb lower_bound
        #define ub upper_bound

        typedef tree<int, null_type, less<int>, rb_tree_tag,
            tree_order_statistics_node_update> indexed_set;

        const int oo = 1e15 + 7;

        int N, A, B, res;
        int arr[2001], DP[101][101], dp[2001], P[50];
        int solve(int i, int j) {
            if(i == N) {
                if(j >= A && j <= B) return 1;
                return 0;
            }
            if(DP[i][j] != -1) return DP[i][j];
            int best = 0; int curr = 0;
            for(int l = i; l < N; l++) {
                curr += arr[l];
                if(curr & res) continue;
                best |= solve(l + 1, j + 1);
            }
            return DP[i][j] = best;
        }
        int solve(int i) {
            if(i == N) return 0;
            if(dp[i] != -1) return dp[i];
            int best = oo, curr = 0;
            for(int l = i; l < N; l++) {
                curr += arr[l];
                if(curr & res) continue;
                best = min(best, 1 + solve(l + 1));
            }
            return dp[i] = best;
        }

        int32_t main() {
            ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
            cin >> N >> A >> B;
            for(int l = 0; l < N; l++)
                cin >> arr[l];
            int curr = 1;
            for(int l = 0; l <= 50; l++)
                P[l] = curr, curr *= 2;
            for(int l = 49; l >= 0; l--) {
                res += P[l];
                if(N <= 100) {
                    memset(DP, - 1, sizeof DP);
                    if(!solve(0, 0)) res -= P[l];
                }
                if(N > 100) {
                    memset(dp, -1, sizeof dp);
                    if(solve(0) > B) res -= P[l];
                }
            }
            cout << P[50] - 1 - res << "\n";
            return 0;
        }

Compilation message

sculpture.cpp: In function 'int32_t main()':
sculpture.cpp:63:22: warning: iteration 50 invokes undefined behavior [-Waggressive-loop-optimizations]
   63 |                 P[l] = curr, curr *= 2;
      |                 ~~~~~^~~~~~
sculpture.cpp:62:30: note: within this loop
   62 |             for(int l = 0; l <= 50; l++)
      |                            ~~^~~~~
sculpture.cpp:75:25: warning: array subscript 50 is above array bounds of 'll [50]' {aka 'long long int [50]'} [-Warray-bounds]
   75 |             cout << P[50] - 1 - res << "\n";
      |                     ~~~~^
sculpture.cpp:29:48: note: while referencing 'P'
   29 |         int arr[2001], DP[101][101], dp[2001], P[50];
      |                                                ^

Subtask #1
9.0 / 9.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 340 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 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 340 KB Output is correct
27 Correct 0 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 0 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 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 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 0 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 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 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 2 ms 340 KB Output is correct
31 Correct 2 ms 340 KB Output is correct
32 Correct 2 ms 340 KB Output is correct
33 Correct 2 ms 340 KB Output is correct
34 Correct 3 ms 340 KB Output is correct
35 Correct 2 ms 340 KB Output is correct
36 Correct 2 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 340 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 2 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 2 ms 340 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 3 ms 340 KB Output is correct
25 Correct 4 ms 340 KB Output is correct
26 Correct 8 ms 400 KB Output is correct
27 Correct 10 ms 408 KB Output is correct
28 Correct 15 ms 408 KB Output is correct
29 Correct 12 ms 468 KB Output is correct
30 Correct 12 ms 340 KB Output is correct
31 Correct 11 ms 404 KB Output is correct
32 Correct 12 ms 404 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 340 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 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 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
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 2 ms 340 KB Output is correct
41 Correct 2 ms 340 KB Output is correct
42 Correct 2 ms 340 KB Output is correct
43 Correct 2 ms 340 KB Output is correct
44 Correct 2 ms 404 KB Output is correct
45 Correct 4 ms 340 KB Output is correct
46 Correct 2 ms 340 KB Output is correct
47 Correct 3 ms 340 KB Output is correct
48 Correct 4 ms 340 KB Output is correct
49 Correct 6 ms 408 KB Output is correct
50 Correct 8 ms 340 KB Output is correct
51 Correct 11 ms 404 KB Output is correct
52 Correct 11 ms 340 KB Output is correct
53 Correct 12 ms 408 KB Output is correct
54 Correct 12 ms 408 KB Output is correct
55 Correct 11 ms 340 KB Output is correct
56 Correct 2 ms 340 KB Output is correct
57 Correct 3 ms 340 KB Output is correct
58 Correct 4 ms 340 KB Output is correct
59 Correct 5 ms 408 KB Output is correct
60 Correct 6 ms 340 KB Output is correct
61 Correct 5 ms 340 KB Output is correct
62 Correct 7 ms 408 KB Output is correct
63 Correct 6 ms 340 KB Output is correct
64 Correct 9 ms 408 KB Output is correct
65 Correct 1 ms 340 KB Output is correct
66 Correct 4 ms 340 KB Output is correct
67 Correct 3 ms 340 KB Output is correct
68 Correct 4 ms 400 KB Output is correct
69 Correct 5 ms 412 KB Output is correct
70 Correct 5 ms 340 KB Output is correct
71 Correct 6 ms 340 KB Output is correct
72 Correct 9 ms 340 KB Output is correct
73 Correct 7 ms 340 KB Output is correct
74 Correct 6 ms 408 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 0 ms 340 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 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 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 4 ms 340 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 2 ms 340 KB Output is correct
32 Correct 2 ms 340 KB Output is correct
33 Correct 3 ms 340 KB Output is correct
34 Correct 2 ms 340 KB Output is correct
35 Correct 4 ms 340 KB Output is correct
36 Correct 5 ms 340 KB Output is correct
37 Correct 8 ms 340 KB Output is correct
38 Correct 11 ms 404 KB Output is correct
39 Correct 10 ms 404 KB Output is correct
40 Correct 11 ms 340 KB Output is correct
41 Correct 10 ms 340 KB Output is correct
42 Correct 11 ms 340 KB Output is correct
43 Correct 2 ms 340 KB Output is correct
44 Correct 5 ms 340 KB Output is correct
45 Correct 5 ms 408 KB Output is correct
46 Correct 6 ms 408 KB Output is correct
47 Correct 5 ms 340 KB Output is correct
48 Correct 6 ms 340 KB Output is correct
49 Correct 6 ms 404 KB Output is correct
50 Correct 6 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 7 ms 340 KB Output is correct
53 Correct 7 ms 340 KB Output is correct
54 Correct 23 ms 412 KB Output is correct
55 Correct 20 ms 408 KB Output is correct
56 Correct 44 ms 468 KB Output is correct
57 Correct 40 ms 468 KB Output is correct
58 Correct 50 ms 468 KB Output is correct
59 Correct 69 ms 452 KB Output is correct
60 Correct 62 ms 468 KB Output is correct
61 Correct 1 ms 340 KB Output is correct
62 Correct 7 ms 340 KB Output is correct
63 Correct 25 ms 340 KB Output is correct
64 Correct 11 ms 408 KB Output is correct
65 Correct 24 ms 340 KB Output is correct
66 Correct 32 ms 340 KB Output is correct
67 Correct 43 ms 468 KB Output is correct
68 Correct 90 ms 468 KB Output is correct
69 Correct 48 ms 468 KB Output is correct