oj.uz

Submission #56866

# Submission time Handle Problem Language Result Execution time Memory
56866 2018-07-13T00:45:06 Z Benq Bali Sculptures (APIO15_sculpture) C++14
71 / 100
 1000 ms 2592 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) {
    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;
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> N >> A >> B; Y.resize(N);
    F0R(i,N) cin >> Y[i];
    ll cur = 0;
    F0Rd(i,45) if (!ok(cur,i)) cur ^= 1LL<<i;
    cout << cur;
}

/* 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 2 ms 360 KB Output is correct
3 Correct 2 ms 568 KB Output is correct
4 Correct 2 ms 708 KB Output is correct
5 Correct 2 ms 708 KB Output is correct
6 Correct 3 ms 708 KB Output is correct
7 Correct 3 ms 708 KB Output is correct
8 Correct 3 ms 776 KB Output is correct
9 Correct 3 ms 776 KB Output is correct
10 Correct 3 ms 776 KB Output is correct
11 Correct 3 ms 776 KB Output is correct
12 Correct 3 ms 776 KB Output is correct
13 Correct 3 ms 776 KB Output is correct
14 Correct 2 ms 776 KB Output is correct
15 Correct 3 ms 776 KB Output is correct
16 Correct 2 ms 776 KB Output is correct
17 Correct 2 ms 780 KB Output is correct
18 Correct 2 ms 784 KB Output is correct
19 Correct 2 ms 788 KB Output is correct
20 Correct 3 ms 788 KB Output is correct
21 Correct 3 ms 796 KB Output is correct
22 Correct 3 ms 820 KB Output is correct
23 Correct 3 ms 824 KB Output is correct
24 Correct 3 ms 932 KB Output is correct
25 Correct 3 ms 960 KB Output is correct
26 Correct 4 ms 960 KB Output is correct
27 Correct 2 ms 960 KB Output is correct
28 Correct 3 ms 960 KB Output is correct
29 Correct 4 ms 960 KB Output is correct
30 Correct 3 ms 960 KB Output is correct
31 Correct 4 ms 960 KB Output is correct
32 Correct 2 ms 960 KB Output is correct
33 Correct 4 ms 960 KB Output is correct
34 Correct 4 ms 960 KB Output is correct
35 Correct 4 ms 960 KB Output is correct
36 Correct 3 ms 960 KB Output is correct

Subtask #2
16.0 / 16.0

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

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1088 KB Output is correct
2 Correct 2 ms 1088 KB Output is correct
3 Correct 2 ms 1088 KB Output is correct
4 Correct 2 ms 1088 KB Output is correct
5 Correct 3 ms 1088 KB Output is correct
6 Correct 4 ms 1088 KB Output is correct
7 Correct 3 ms 1088 KB Output is correct
8 Correct 5 ms 1088 KB Output is correct
9 Correct 3 ms 1092 KB Output is correct
10 Correct 3 ms 1100 KB Output is correct
11 Correct 4 ms 1100 KB Output is correct
12 Correct 3 ms 1104 KB Output is correct
13 Correct 5 ms 1108 KB Output is correct
14 Correct 3 ms 1112 KB Output is correct
15 Correct 4 ms 1116 KB Output is correct
16 Correct 4 ms 1120 KB Output is correct
17 Correct 6 ms 1124 KB Output is correct
18 Correct 6 ms 1124 KB Output is correct
19 Correct 8 ms 1132 KB Output is correct
20 Correct 6 ms 1136 KB Output is correct
21 Correct 6 ms 1268 KB Output is correct
22 Correct 6 ms 1268 KB Output is correct
23 Correct 7 ms 1268 KB Output is correct
24 Correct 9 ms 1268 KB Output is correct
25 Correct 10 ms 1268 KB Output is correct
26 Correct 12 ms 1268 KB Output is correct
27 Correct 16 ms 1268 KB Output is correct
28 Correct 18 ms 1268 KB Output is correct
29 Correct 18 ms 1268 KB Output is correct
30 Correct 25 ms 1268 KB Output is correct
31 Correct 17 ms 1268 KB Output is correct
32 Correct 16 ms 1268 KB Output is correct

Subtask #4
25.0 / 25.0

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

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1680 KB Output is correct
2 Correct 3 ms 1680 KB Output is correct
3 Correct 2 ms 1680 KB Output is correct
4 Correct 2 ms 1688 KB Output is correct
5 Correct 2 ms 1704 KB Output is correct
6 Correct 5 ms 1708 KB Output is correct
7 Correct 4 ms 1708 KB Output is correct
8 Correct 5 ms 1708 KB Output is correct
9 Correct 4 ms 1720 KB Output is correct
10 Correct 3 ms 1852 KB Output is correct
11 Correct 3 ms 1852 KB Output is correct
12 Correct 4 ms 1852 KB Output is correct
13 Correct 3 ms 1852 KB Output is correct
14 Correct 2 ms 1852 KB Output is correct
15 Correct 2 ms 1852 KB Output is correct
16 Correct 3 ms 1852 KB Output is correct
17 Correct 3 ms 1852 KB Output is correct
18 Correct 3 ms 1852 KB Output is correct
19 Correct 3 ms 1852 KB Output is correct
20 Correct 3 ms 1852 KB Output is correct
21 Correct 3 ms 1852 KB Output is correct
22 Correct 4 ms 1852 KB Output is correct
23 Correct 3 ms 1852 KB Output is correct
24 Correct 4 ms 1852 KB Output is correct
25 Correct 5 ms 1852 KB Output is correct
26 Correct 4 ms 1852 KB Output is correct
27 Correct 5 ms 1852 KB Output is correct
28 Correct 10 ms 1852 KB Output is correct
29 Correct 7 ms 1852 KB Output is correct
30 Correct 8 ms 1852 KB Output is correct
31 Correct 8 ms 1852 KB Output is correct
32 Correct 9 ms 1884 KB Output is correct
33 Correct 8 ms 1984 KB Output is correct
34 Correct 7 ms 1984 KB Output is correct
35 Correct 12 ms 1984 KB Output is correct
36 Correct 12 ms 1984 KB Output is correct
37 Correct 16 ms 1984 KB Output is correct
38 Correct 18 ms 1984 KB Output is correct
39 Correct 18 ms 1984 KB Output is correct
40 Correct 18 ms 1984 KB Output is correct
41 Correct 29 ms 1984 KB Output is correct
42 Correct 17 ms 1984 KB Output is correct
43 Correct 5 ms 2052 KB Output is correct
44 Correct 7 ms 2052 KB Output is correct
45 Correct 10 ms 2064 KB Output is correct
46 Correct 8 ms 2064 KB Output is correct
47 Correct 9 ms 2064 KB Output is correct
48 Correct 8 ms 2064 KB Output is correct
49 Correct 9 ms 2064 KB Output is correct
50 Correct 8 ms 2064 KB Output is correct
51 Correct 8 ms 2088 KB Output is correct
52 Correct 125 ms 2232 KB Output is correct
53 Correct 180 ms 2232 KB Output is correct
54 Correct 384 ms 2380 KB Output is correct
55 Correct 342 ms 2380 KB Output is correct
56 Execution timed out 1069 ms 2592 KB Time limit exceeded
57 Halted 0 ms 0 KB -