oj.uz

Submission #744894

# Submission time Handle Problem Language Result Execution time Memory
744894 2023-05-19T07:45:59 Z Nelt Bali Sculptures (APIO15_sculpture) C++17
71 / 100
 1000 ms 580 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

/* DEFINES */
#define S second
#define F first
#define ll long long
#define ull unsigned long long
#define ld long double
#define npos ULLONG_MAX
#define INF LLONG_MAX
#define vv(a) vector<a>
#define pp(a, b) pair<a, b>
#define pq(a) priority_queue<a>
#define qq(a) queue<a>
#define ss(a) set<a>
#define mm(a, b) map<a, b>
#define ump(a, b) unordered_map<a, b>
#define sync                      \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0);
#define elif else if
#define endl "\n"
#define allc(a) begin(a), end(a)
#define all(a) a, a + sizeof(a) / sizeof(a[0])
#define pb push_back
#define logi(a) __lg(a)
#define sqrt(a) sqrtl(a)
#define mpr make_pair
#define ins insert
using namespace std;
using namespace __gnu_pbds;
using namespace __cxx11;
typedef char chr;
typedef basic_string<chr> str;
template <typename T, typename key = less<T>>
using ordered_set = tree<T, null_type, key, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void solve()
{
    ll n, l, r;
    cin >> n >> l >> r;
    ll ans = (1ll << 41) - 1;
    ll a[n + 1];
    for (ll i = 1; i <= n; i++)
        cin >> a[i];
    bool dp[n + 1][n + 1];
    for (ll bit = 40; bit >= 0; bit--)
    {
        ans ^= (1ll << bit);
        for (ll i = 0; i <= n; i++)
        for (ll j = 0; j <= n; j++)
            dp[i][j] = 0;
        dp[0][0] = 1;
        for (ll i = 1; i <= n; i++)
        for (ll cnt = 1; cnt <= n; cnt++)
        for (ll j = i, sum = 0; j >= 1; j--)
            sum += a[j], dp[i][cnt] |= dp[j - 1][cnt - 1] and (sum | ans) == ans;
        bool ok = false;
        for (ll i = l; i <= r; i++)
            ok |= dp[n][i];
        if (!ok)
            ans ^= (1ll << bit);
    }
    cout << ans << endl;
}
/*

*/
int main()
{
    sync
        // precomp();
        ll t = 1;
    // cin >> t;
    for (ll i = 1; i <= t; i++)
        // cout << "Case #" << i << ": ",
        solve();
    cerr << "\nTime elapsed : " << clock() * 1000.0 / CLOCKS_PER_SEC << " ms\n";
}

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 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 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 320 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 1 ms 324 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 324 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 320 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 320 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 328 KB Output is correct
28 Correct 1 ms 324 KB Output is correct
29 Correct 1 ms 316 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

Subtask #2
16.0 / 16.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 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 316 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 320 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 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 324 KB Output is correct
27 Correct 1 ms 324 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 2 ms 212 KB Output is correct
30 Correct 3 ms 212 KB Output is correct
31 Correct 6 ms 212 KB Output is correct
32 Correct 3 ms 212 KB Output is correct
33 Correct 4 ms 324 KB Output is correct
34 Correct 3 ms 212 KB Output is correct
35 Correct 3 ms 212 KB Output is correct
36 Correct 4 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 1 ms 212 KB Output is correct
3 Correct 1 ms 324 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 2 ms 324 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 1 ms 328 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 212 KB Output is correct
17 Correct 3 ms 212 KB Output is correct
18 Correct 3 ms 212 KB Output is correct
19 Correct 3 ms 212 KB Output is correct
20 Correct 3 ms 212 KB Output is correct
21 Correct 4 ms 212 KB Output is correct
22 Correct 6 ms 212 KB Output is correct
23 Correct 4 ms 320 KB Output is correct
24 Correct 4 ms 212 KB Output is correct
25 Correct 6 ms 324 KB Output is correct
26 Correct 12 ms 324 KB Output is correct
27 Correct 15 ms 212 KB Output is correct
28 Correct 20 ms 332 KB Output is correct
29 Correct 20 ms 324 KB Output is correct
30 Correct 20 ms 324 KB Output is correct
31 Correct 20 ms 212 KB Output is correct
32 Correct 23 ms 212 KB Output is correct

Subtask #4
25.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 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 324 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 2 ms 328 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 324 KB Output is correct
19 Correct 1 ms 324 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 232 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 320 KB Output is correct
27 Correct 1 ms 320 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 256 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 320 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 324 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 2 ms 328 KB Output is correct
39 Correct 3 ms 212 KB Output is correct
40 Correct 3 ms 332 KB Output is correct
41 Correct 4 ms 212 KB Output is correct
42 Correct 5 ms 212 KB Output is correct
43 Correct 4 ms 328 KB Output is correct
44 Correct 4 ms 212 KB Output is correct
45 Correct 4 ms 212 KB Output is correct
46 Correct 4 ms 212 KB Output is correct
47 Correct 4 ms 328 KB Output is correct
48 Correct 7 ms 324 KB Output is correct
49 Correct 11 ms 324 KB Output is correct
50 Correct 17 ms 324 KB Output is correct
51 Correct 29 ms 328 KB Output is correct
52 Correct 22 ms 212 KB Output is correct
53 Correct 22 ms 324 KB Output is correct
54 Correct 24 ms 212 KB Output is correct
55 Correct 21 ms 212 KB Output is correct
56 Correct 3 ms 212 KB Output is correct
57 Correct 10 ms 328 KB Output is correct
58 Correct 15 ms 212 KB Output is correct
59 Correct 24 ms 212 KB Output is correct
60 Correct 31 ms 212 KB Output is correct
61 Correct 18 ms 332 KB Output is correct
62 Correct 18 ms 328 KB Output is correct
63 Correct 19 ms 212 KB Output is correct
64 Correct 15 ms 324 KB Output is correct
65 Correct 3 ms 212 KB Output is correct
66 Correct 6 ms 212 KB Output is correct
67 Correct 9 ms 212 KB Output is correct
68 Correct 13 ms 328 KB Output is correct
69 Correct 16 ms 328 KB Output is correct
70 Correct 18 ms 212 KB Output is correct
71 Correct 17 ms 332 KB Output is correct
72 Correct 18 ms 212 KB Output is correct
73 Correct 19 ms 328 KB Output is correct
74 Correct 26 ms 212 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 1 ms 328 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 1 ms 324 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 320 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 324 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 212 KB Output is correct
24 Correct 1 ms 324 KB Output is correct
25 Correct 2 ms 212 KB Output is correct
26 Correct 2 ms 212 KB Output is correct
27 Correct 3 ms 212 KB Output is correct
28 Correct 3 ms 212 KB Output is correct
29 Correct 4 ms 212 KB Output is correct
30 Correct 4 ms 212 KB Output is correct
31 Correct 4 ms 212 KB Output is correct
32 Correct 4 ms 212 KB Output is correct
33 Correct 3 ms 328 KB Output is correct
34 Correct 4 ms 320 KB Output is correct
35 Correct 11 ms 212 KB Output is correct
36 Correct 10 ms 328 KB Output is correct
37 Correct 15 ms 332 KB Output is correct
38 Correct 33 ms 320 KB Output is correct
39 Correct 20 ms 212 KB Output is correct
40 Correct 20 ms 212 KB Output is correct
41 Correct 33 ms 212 KB Output is correct
42 Correct 20 ms 320 KB Output is correct
43 Correct 3 ms 212 KB Output is correct
44 Correct 10 ms 328 KB Output is correct
45 Correct 13 ms 212 KB Output is correct
46 Correct 17 ms 212 KB Output is correct
47 Correct 19 ms 212 KB Output is correct
48 Correct 24 ms 324 KB Output is correct
49 Correct 18 ms 324 KB Output is correct
50 Correct 18 ms 324 KB Output is correct
51 Correct 21 ms 320 KB Output is correct
52 Execution timed out 1075 ms 580 KB Time limit exceeded
53 Halted 0 ms 0 KB -