oj.uz

Submission #170883

# Submission time Handle Problem Language Result Execution time Memory
170883 2019-12-26T16:22:11 Z ne4eHbKa Bali Sculptures (APIO15_sculpture) C++17
71 / 100
 381 ms 1016 KB 
//{ <defines>
#ifndef _LOCAL
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#pragma GCC optimize("Ofast")
#endif

#include <bits/stdc++.h>
using namespace std;

#define fr(i, n) for(int i = 0; i < n; ++i)
#define fo(n) fr(i, n)

#define re return
#define ef else if
#define ifn(x) if(!(x))
#define _  << ' ' <<

#define ft first
#define sd second
#define ve vector
#define pb push_back
#define eb emplace_back

#define sz(x) int(x.size())
#define pw(x) (1 << (x))
#define PW(x) (1ll << (x))
#define bnd(x) x.begin(), x.end()
#define clr(x, y) memset(x, y, sizeof x)

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef ve<int> vi;

const int oo = 2e9;
const ll OO = 4e18;
//const ld pi = arg(complex<ld>(-1, 0));
//const ld pi2 = pi + pi;
const int md = 0x3b800001;
const int MD = 1e9 + 7;

inline ll time() {re chrono :: system_clock().now().time_since_epoch().count();}
mt19937 rnd(time());
mt19937_64 RND(time());

template<typename t> inline void umin(t &a, t b) {a = min(a, b);}
template<typename t> inline void umax(t &a, t b) {a = max(a, b);}
//} </defines>

void solve() {
    int n, a, b; cin >> n >> a >> b;
    ll y[n]; fo(n) cin >> y[i];

    if(n > 100) {
        const int N = 2000;
        typedef bitset<N + 1> bi;

        bi g[n + 1];
        ll ans = 0;

        for(char bt = 38; ~bt; --bt) {
            ll mx = PW(bt);

            bool fail = false;

            for(int l = 0; l < n; ++l) {
                ll sum = 0;
                for(int r = l; r < n; ++r) {
                    sum += y[r];
                    g[l][r + 1] = (sum & ~ans) < mx;
                }
            }

            bi q; q[0] = 1;
            fo(b) {
                if(q[n]) break;
                bi t;
                fo(n) if(q[i]) t |= g[i];
                q = t;
            }

            if(!q[n]) fail = true;

            if(fail) ans ^= mx;
        }

        cout << ans << endl;
    } else {
        const int N = 100;
        typedef bitset<N + 1> bi;
        bi g[n + 1];

        ll ans = OO;

        for(int x = a; x <= b; ++x) {
            ll f = 0;

            for(char bt = 38; ~bt; --bt) {
                ll mx = PW(bt);

                bool fail = false;

                for(int l = 0; l < n; ++l) {
                    ll sum = 0;
                    for(int r = l; r < n; ++r) {
                        sum += y[r];
                        g[l][r + 1] = (sum & ~f) < mx;
                    }
                }

                bi q; q[0] = 1;
                fo(x) {
                    bi t;
                    fo(n) if(q[i]) t |= g[i];
                    q = t;
                }

                if(!q[n]) fail = true;

                if(fail) f ^= mx;
            }

            umin(ans, f);
        }

        cout << ans << endl;
    }
}

/*
6 1 3
8 1 2 1 5 4
*/

int main() {
    solve();
}

Subtask #1
9.0 / 9.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 3 ms 256 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 4 ms 376 KB Output is correct
18 Correct 5 ms 256 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 4 ms 376 KB Output is correct
23 Correct 3 ms 376 KB Output is correct
24 Correct 5 ms 256 KB Output is correct
25 Correct 4 ms 376 KB Output is correct
26 Correct 10 ms 252 KB Output is correct
27 Correct 33 ms 256 KB Output is correct
28 Correct 77 ms 376 KB Output is correct
29 Correct 76 ms 376 KB Output is correct
30 Correct 3 ms 376 KB Output is correct
31 Correct 30 ms 376 KB Output is correct
32 Correct 53 ms 252 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 380 KB Output is correct
10 Correct 2 ms 296 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 256 KB Output is correct
22 Correct 2 ms 252 KB Output is correct
23 Correct 2 ms 256 KB Output is correct
24 Correct 2 ms 256 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 256 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 256 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 256 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 256 KB Output is correct
33 Correct 2 ms 256 KB Output is correct
34 Correct 3 ms 376 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 3 ms 376 KB Output is correct
37 Correct 3 ms 376 KB Output is correct
38 Correct 2 ms 376 KB Output is correct
39 Correct 2 ms 376 KB Output is correct
40 Correct 4 ms 376 KB Output is correct
41 Correct 5 ms 256 KB Output is correct
42 Correct 5 ms 376 KB Output is correct
43 Correct 2 ms 256 KB Output is correct
44 Correct 5 ms 376 KB Output is correct
45 Correct 5 ms 368 KB Output is correct
46 Correct 3 ms 376 KB Output is correct
47 Correct 5 ms 376 KB Output is correct
48 Correct 4 ms 256 KB Output is correct
49 Correct 10 ms 256 KB Output is correct
50 Correct 32 ms 256 KB Output is correct
51 Correct 77 ms 256 KB Output is correct
52 Correct 77 ms 256 KB Output is correct
53 Correct 2 ms 256 KB Output is correct
54 Correct 31 ms 360 KB Output is correct
55 Correct 53 ms 256 KB Output is correct
56 Correct 6 ms 376 KB Output is correct
57 Correct 11 ms 376 KB Output is correct
58 Correct 34 ms 376 KB Output is correct
59 Correct 81 ms 376 KB Output is correct
60 Correct 78 ms 368 KB Output is correct
61 Correct 3 ms 376 KB Output is correct
62 Correct 84 ms 476 KB Output is correct
63 Correct 86 ms 400 KB Output is correct
64 Correct 35 ms 376 KB Output is correct
65 Correct 4 ms 376 KB Output is correct
66 Correct 5 ms 380 KB Output is correct
67 Correct 11 ms 256 KB Output is correct
68 Correct 25 ms 380 KB Output is correct
69 Correct 42 ms 400 KB Output is correct
70 Correct 42 ms 256 KB Output is correct
71 Correct 3 ms 256 KB Output is correct
72 Correct 82 ms 376 KB Output is correct
73 Correct 26 ms 376 KB Output is correct
74 Correct 30 ms 376 KB Output is correct

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 400 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 380 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 3 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 3 ms 376 KB Output is correct
24 Correct 3 ms 376 KB Output is correct
25 Correct 3 ms 376 KB Output is correct
26 Correct 3 ms 376 KB Output is correct
27 Correct 4 ms 380 KB Output is correct
28 Correct 5 ms 376 KB Output is correct
29 Correct 5 ms 256 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 5 ms 256 KB Output is correct
32 Correct 5 ms 380 KB Output is correct
33 Correct 4 ms 256 KB Output is correct
34 Correct 6 ms 396 KB Output is correct
35 Correct 5 ms 376 KB Output is correct
36 Correct 30 ms 256 KB Output is correct
37 Correct 32 ms 252 KB Output is correct
38 Correct 78 ms 376 KB Output is correct
39 Correct 76 ms 256 KB Output is correct
40 Correct 3 ms 256 KB Output is correct
41 Correct 31 ms 256 KB Output is correct
42 Correct 53 ms 376 KB Output is correct
43 Correct 6 ms 256 KB Output is correct
44 Correct 11 ms 252 KB Output is correct
45 Correct 34 ms 376 KB Output is correct
46 Correct 81 ms 376 KB Output is correct
47 Correct 79 ms 360 KB Output is correct
48 Correct 3 ms 376 KB Output is correct
49 Correct 85 ms 408 KB Output is correct
50 Correct 86 ms 404 KB Output is correct
51 Correct 3 ms 376 KB Output is correct
52 Correct 25 ms 604 KB Output is correct
53 Correct 56 ms 504 KB Output is correct
54 Correct 58 ms 632 KB Output is correct
55 Correct 67 ms 632 KB Output is correct
56 Correct 299 ms 892 KB Output is correct
57 Correct 379 ms 888 KB Output is correct
58 Correct 380 ms 892 KB Output is correct
59 Correct 381 ms 888 KB Output is correct
60 Incorrect 198 ms 1016 KB Output isn't correct
61 Halted 0 ms 0 KB -