oj.uz

Submission #56867

# Submission time Handle Problem Language Result Execution time Memory
56867 2018-07-13T00:50:58 Z Benq Bali Sculptures (APIO15_sculpture) C++14
100 / 100
 184 ms 1104 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;

int N,A,B;
vi Y;
bitset<2001> posi[2001];

bool sat(ll sum, ll cur, int pos) {
    sum ^= (sum&cur);
    return sum<(1LL<<pos);
}


bool ok(ll cur, int pos) {
    if (A == 1) {
        int mn[2001]; mn[0] = 0;
        FOR(i,1,N+1) {
            mn[i] = MOD;
            ll sum = 0;
            F0Rd(j,i) {
                sum += Y[j];
                if (sat(sum,cur,pos)) mn[i] = min(mn[i],mn[j]+1);
            }
        }
        return mn[N] <= B;
    } else {
        posi[0][0] = 1;
        FOR(i,1,N+1) {
            posi[i].reset();
            ll sum = 0;
            F0Rd(j,i) {
                sum += Y[j];
                if (sat(sum,cur,pos)) posi[i] |= (posi[j]<<1);
            }
        }
        FOR(i,A,B+1) if (posi[N][i]) return 1;
        return 0;
    }
}

void solve() {
    ll cur = 0;
    F0Rd(i,45) if (!ok(cur,i)) cur ^= 1LL<<i;
    cout << cur;
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> N >> A >> B; Y.resize(N);
    F0R(i,N) cin >> Y[i];
    solve();
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 3 ms 356 KB Output is correct
3 Correct 2 ms 432 KB Output is correct
4 Correct 2 ms 508 KB Output is correct
5 Correct 2 ms 544 KB Output is correct
6 Correct 2 ms 560 KB Output is correct
7 Correct 2 ms 616 KB Output is correct
8 Correct 2 ms 616 KB Output is correct
9 Correct 2 ms 708 KB Output is correct
10 Correct 2 ms 744 KB Output is correct
11 Correct 2 ms 744 KB Output is correct
12 Correct 2 ms 744 KB Output is correct
13 Correct 2 ms 744 KB Output is correct
14 Correct 2 ms 744 KB Output is correct
15 Correct 2 ms 744 KB Output is correct
16 Correct 2 ms 744 KB Output is correct
17 Correct 2 ms 748 KB Output is correct
18 Correct 2 ms 748 KB Output is correct
19 Correct 2 ms 748 KB Output is correct
20 Correct 2 ms 748 KB Output is correct
21 Correct 3 ms 748 KB Output is correct
22 Correct 3 ms 748 KB Output is correct
23 Correct 3 ms 748 KB Output is correct
24 Correct 2 ms 748 KB Output is correct
25 Correct 2 ms 748 KB Output is correct
26 Correct 2 ms 748 KB Output is correct
27 Correct 2 ms 748 KB Output is correct
28 Correct 2 ms 748 KB Output is correct
29 Correct 2 ms 748 KB Output is correct
30 Correct 2 ms 748 KB Output is correct
31 Correct 2 ms 748 KB Output is correct
32 Correct 2 ms 748 KB Output is correct
33 Correct 2 ms 748 KB Output is correct
34 Correct 2 ms 748 KB Output is correct
35 Correct 2 ms 748 KB Output is correct
36 Correct 2 ms 748 KB Output is correct

Subtask #2
16.0 / 16.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
25.0 / 25.0

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

Subtask #5
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 764 KB Output is correct
2 Correct 2 ms 764 KB Output is correct
3 Correct 3 ms 764 KB Output is correct
4 Correct 0 ms 764 KB Output is correct
5 Correct 3 ms 764 KB Output is correct
6 Correct 1 ms 764 KB Output is correct
7 Correct 2 ms 764 KB Output is correct
8 Correct 3 ms 764 KB Output is correct
9 Correct 2 ms 764 KB Output is correct
10 Correct 3 ms 764 KB Output is correct
11 Correct 3 ms 764 KB Output is correct
12 Correct 3 ms 764 KB Output is correct
13 Correct 3 ms 764 KB Output is correct
14 Correct 2 ms 764 KB Output is correct
15 Correct 2 ms 764 KB Output is correct
16 Correct 3 ms 764 KB Output is correct
17 Correct 2 ms 764 KB Output is correct
18 Correct 3 ms 764 KB Output is correct
19 Correct 2 ms 764 KB Output is correct
20 Correct 2 ms 764 KB Output is correct
21 Correct 3 ms 764 KB Output is correct
22 Correct 0 ms 764 KB Output is correct
23 Correct 3 ms 764 KB Output is correct
24 Correct 3 ms 764 KB Output is correct
25 Correct 3 ms 764 KB Output is correct
26 Correct 2 ms 764 KB Output is correct
27 Correct 3 ms 764 KB Output is correct
28 Correct 3 ms 764 KB Output is correct
29 Correct 3 ms 764 KB Output is correct
30 Correct 2 ms 764 KB Output is correct
31 Correct 3 ms 764 KB Output is correct
32 Correct 3 ms 764 KB Output is correct
33 Correct 2 ms 764 KB Output is correct
34 Correct 3 ms 764 KB Output is correct
35 Correct 3 ms 764 KB Output is correct
36 Correct 5 ms 764 KB Output is correct
37 Correct 3 ms 764 KB Output is correct
38 Correct 3 ms 764 KB Output is correct
39 Correct 4 ms 764 KB Output is correct
40 Correct 3 ms 764 KB Output is correct
41 Correct 4 ms 764 KB Output is correct
42 Correct 4 ms 764 KB Output is correct
43 Correct 4 ms 764 KB Output is correct
44 Correct 3 ms 764 KB Output is correct
45 Correct 4 ms 764 KB Output is correct
46 Correct 3 ms 764 KB Output is correct
47 Correct 2 ms 764 KB Output is correct
48 Correct 2 ms 764 KB Output is correct
49 Correct 2 ms 764 KB Output is correct
50 Correct 2 ms 764 KB Output is correct
51 Correct 2 ms 764 KB Output is correct
52 Correct 14 ms 764 KB Output is correct
53 Correct 23 ms 764 KB Output is correct
54 Correct 39 ms 764 KB Output is correct
55 Correct 38 ms 764 KB Output is correct
56 Correct 146 ms 764 KB Output is correct
57 Correct 143 ms 764 KB Output is correct
58 Correct 142 ms 876 KB Output is correct
59 Correct 143 ms 876 KB Output is correct
60 Correct 184 ms 924 KB Output is correct
61 Correct 3 ms 924 KB Output is correct
62 Correct 25 ms 924 KB Output is correct
63 Correct 42 ms 924 KB Output is correct
64 Correct 44 ms 924 KB Output is correct
65 Correct 81 ms 960 KB Output is correct
66 Correct 117 ms 988 KB Output is correct
67 Correct 150 ms 1008 KB Output is correct
68 Correct 156 ms 1104 KB Output is correct
69 Correct 147 ms 1104 KB Output is correct