oj.uz

Submission #170873

# Submission time Handle Problem Language Result Execution time Memory
170873 2019-12-26T16:07:13 Z ne4eHbKa Bali Sculptures (APIO15_sculpture) C++17
25 / 100
 1000 ms 504 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>
const int N = 2e5 + 228;

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

    int g[n + 1][n]; clr(g, 0); int e[n + 1];
    int q[n]; int m;
    int h[n * n + 5]; int t;

    if(n > 100) {
        ll ans = 0;

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

            bool fail = false;

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

            m = 1; q[0] = 0;
            for(; m; ) {
                if(q[m - 1] == n) break;
                t = 0;
                for(int v = 0; v < m; ++v)
                    for(int u = 0; u < e[q[v]]; ++u)
                        h[t++] = g[q[v]][u];
                sort(h, h + t);
                t = unique(h, h + t) - h;
                m = 0;
                for(int v = 0; v < t; ++v)
                    q[m++] = h[v];
            }

            if(!m || q[m - 1] != n) fail = true;

            if(fail) ans ^= mx;
        }

        cout << ans << endl;
    } else {
        ll ans = OO;

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

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

                bool fail = false;

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

                m = 1; q[0] = 0;
                fo(x) {
                    if(!m) { fail = true; break; }
                    t = 0;
                    for(int v = 0; v < m; ++v)
                        for(int u = 0; u < e[q[v]]; ++u)
                            h[t++] = g[q[v]][u];
                    sort(h, h + t);
                    t = unique(h, h + t) - h;
                    m = 0;
                    for(int v = 0; v < t; ++v)
                        q[m++] = h[v];
                }

                if(!m || q[m - 1] != 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();
}

Compilation message

sculpture.cpp: In function 'void solve()':
sculpture.cpp:65:24: warning: operation on 'mx' may be undefined [-Wsequence-point]
             ll mx = mx = PW(bt);
                        ^
sculpture.cpp:105:28: warning: operation on 'mx' may be undefined [-Wsequence-point]
                 ll mx = mx = PW(bt);
                            ^

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 256 KB Output is correct
3 Correct 2 ms 380 KB Output is correct
4 Correct 2 ms 380 KB Output is correct
5 Correct 2 ms 380 KB Output is correct
6 Correct 4 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 380 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 10 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 256 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 3 ms 376 KB Output is correct
22 Correct 3 ms 376 KB Output is correct
23 Correct 3 ms 376 KB Output is correct
24 Correct 2 ms 256 KB Output is correct
25 Correct 3 ms 256 KB Output is correct
26 Correct 7 ms 256 KB Output is correct
27 Correct 2 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 2 ms 376 KB Output is correct
31 Correct 3 ms 376 KB Output is correct
32 Correct 2 ms 252 KB Output is correct
33 Correct 5 ms 256 KB Output is correct
34 Correct 10 ms 256 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 9 ms 256 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 4 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 380 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 404 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 10 ms 256 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 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 256 KB Output is correct
21 Correct 3 ms 256 KB Output is correct
22 Correct 3 ms 424 KB Output is correct
23 Correct 3 ms 256 KB Output is correct
24 Correct 2 ms 256 KB Output is correct
25 Correct 4 ms 376 KB Output is correct
26 Correct 7 ms 256 KB Output is correct
27 Correct 15 ms 256 KB Output is correct
28 Correct 9 ms 256 KB Output is correct
29 Correct 8 ms 420 KB Output is correct
30 Correct 108 ms 376 KB Output is correct
31 Correct 177 ms 376 KB Output is correct
32 Correct 175 ms 380 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 186 ms 376 KB Output is correct
35 Correct 136 ms 376 KB Output is correct
36 Correct 51 ms 416 KB Output is correct

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 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 5 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 10 ms 256 KB Output is correct
14 Correct 15 ms 256 KB Output is correct
15 Correct 9 ms 256 KB Output is correct
16 Correct 8 ms 256 KB Output is correct
17 Correct 101 ms 376 KB Output is correct
18 Correct 177 ms 376 KB Output is correct
19 Correct 176 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 183 ms 376 KB Output is correct
22 Correct 137 ms 376 KB Output is correct
23 Correct 50 ms 376 KB Output is correct
24 Correct 193 ms 376 KB Output is correct
25 Correct 89 ms 376 KB Output is correct
26 Correct 623 ms 388 KB Output is correct
27 Execution timed out 1079 ms 376 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #4
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 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 4 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 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 10 ms 256 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 252 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 3 ms 256 KB Output is correct
22 Correct 3 ms 256 KB Output is correct
23 Correct 3 ms 256 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 4 ms 376 KB Output is correct
26 Correct 6 ms 376 KB Output is correct
27 Correct 2 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 2 ms 376 KB Output is correct
31 Correct 3 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 5 ms 376 KB Output is correct
34 Correct 10 ms 376 KB Output is correct
35 Correct 3 ms 376 KB Output is correct
36 Correct 9 ms 376 KB Output is correct
37 Correct 15 ms 504 KB Output is correct
38 Correct 10 ms 256 KB Output is correct
39 Correct 7 ms 256 KB Output is correct
40 Correct 101 ms 476 KB Output is correct
41 Correct 177 ms 376 KB Output is correct
42 Correct 176 ms 380 KB Output is correct
43 Correct 2 ms 376 KB Output is correct
44 Correct 182 ms 504 KB Output is correct
45 Correct 136 ms 504 KB Output is correct
46 Correct 51 ms 412 KB Output is correct
47 Correct 185 ms 380 KB Output is correct
48 Correct 87 ms 428 KB Output is correct
49 Correct 613 ms 476 KB Output is correct
50 Execution timed out 1075 ms 376 KB Time limit exceeded
51 Halted 0 ms 0 KB -

Subtask #5
0 / 29.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 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 4 ms 376 KB Output is correct
7 Correct 2 ms 252 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 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 10 ms 256 KB Output is correct
14 Correct 2 ms 380 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 376 KB Output is correct
18 Correct 3 ms 376 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 5 ms 256 KB Output is correct
21 Correct 9 ms 256 KB Output is correct
22 Correct 2 ms 256 KB Output is correct
23 Correct 9 ms 376 KB Output is correct
24 Correct 15 ms 256 KB Output is correct
25 Correct 9 ms 376 KB Output is correct
26 Correct 8 ms 376 KB Output is correct
27 Correct 101 ms 376 KB Output is correct
28 Correct 178 ms 504 KB Output is correct
29 Correct 176 ms 480 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 182 ms 376 KB Output is correct
32 Correct 135 ms 376 KB Output is correct
33 Correct 50 ms 420 KB Output is correct
34 Correct 187 ms 412 KB Output is correct
35 Correct 87 ms 376 KB Output is correct
36 Correct 612 ms 404 KB Output is correct
37 Execution timed out 1073 ms 376 KB Time limit exceeded
38 Halted 0 ms 0 KB -