oj.uz

답안 #490129

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
490129 2021-11-25T19:56:25 Z JerryLiu06 Bali Sculptures (APIO15_sculpture) C++17
71 / 100
 1000 ms 320 KB 
// https://oj.uz/problem/view/APIO15_sculpture

#include <bits/stdc++.h>
 
using namespace std;
 
using ll = long long;
using ld = long double;
using db = double;
using str = string;
 
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;
 
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>;
using vs = vector<str>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vpd = vector<pd>;
 
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(0);
#define FASTIOF ios_base::sync_with_stdio(false); fin.tie(0);
 
#define mp make_pair
#define f first
#define s second
 
#define sz(x) (int)(x).size()
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert 
#define ft front()
#define bk back()
#define pb push_back
#define pf push_front
 
#define lb lower_bound
#define ub upper_bound
 
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define R0F(i, a) ROF(i, 0, a)
#define EACH(a, x) for (auto& a : x)
 
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); }
ll fdiv(ll a, ll b) { return a / b - ((a ^ b) < 0 && a % b); }
 
template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
 
template<class T> void remDup(vector<T>& v) { sor(v); v.erase(unique(all(v)), v.end()); }
 
const int MOD = 1e9 + 7;
const int MX = 2e3 + 10;
const ll INF = 1e18;

int N, A, B; vi Y; 

bool check(ll cur, int ind, ll sum) {
    FOR(i, ind + 1, 45) {
        if ((sum & (1LL << i)) && !(cur & (1LL << i))) {
            return false;
        }
    }
    return (sum & (1LL << ind)) == 0;
}

bool valid(ll cur, int ind) {
    if (A == 1) {
        int DP[N + 1];
    
        F0R(i, N + 1) {
            DP[i] = MOD;
        }
        DP[0] = 0;
    
        FOR(i, 1, N + 1) {
            ll sum = 0;
    
            R0F(j, i) {
                sum += Y[j + 1];
    
                if (check(cur, ind, sum)) {
                    ckmin(DP[i], DP[j] + 1);
                }
            }
        }
        return DP[N] <= B; 
    }
    bool DP[N + 1][B + 1];
    
    F0R(i, N + 1) {
        F0R(j, B + 1) {
            DP[i][j] = false;
        }
    }
    DP[0][0] = true;
    
    FOR(i, 1, N + 1) {
        FOR(j, 1, B + 1) {
            ll sum = 0;
            
            R0F(k, i) {
                sum += Y[k + 1];
                
                if (DP[k][j - 1]) {
                    if (check(cur, ind, sum)) {
                        DP[i][j] = true;
                        break;
                    }
                }
            }
        }
    }
    FOR(i, A, B + 1) {
        if (DP[N][i]) return true;
    }
    return false;
}

int main() {
    FASTIO;

    cin >> N >> A >> B;

    Y.rsz(N + 1); 

    FOR(i, 1, N + 1) {
        cin >> Y[i];
    }

    ll ans = 0;

    R0F(i, 45) {
        if (!valid(ans, i)) {
            ans += (1LL << i);
        }
    }
    cout << ans;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 0 ms 204 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 2 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 2 ms 204 KB Output is correct
34 Correct 2 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 2 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 2 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 2 ms 204 KB Output is correct
26 Correct 3 ms 204 KB Output is correct
27 Correct 4 ms 204 KB Output is correct
28 Correct 5 ms 308 KB Output is correct
29 Correct 4 ms 204 KB Output is correct
30 Correct 5 ms 204 KB Output is correct
31 Correct 4 ms 204 KB Output is correct
32 Correct 4 ms 304 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 256 KB Output is correct
28 Correct 0 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 256 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 1 ms 204 KB Output is correct
42 Correct 1 ms 312 KB Output is correct
43 Correct 2 ms 312 KB Output is correct
44 Correct 2 ms 204 KB Output is correct
45 Correct 1 ms 204 KB Output is correct
46 Correct 2 ms 204 KB Output is correct
47 Correct 2 ms 212 KB Output is correct
48 Correct 2 ms 212 KB Output is correct
49 Correct 3 ms 312 KB Output is correct
50 Correct 4 ms 204 KB Output is correct
51 Correct 4 ms 204 KB Output is correct
52 Correct 9 ms 204 KB Output is correct
53 Correct 5 ms 320 KB Output is correct
54 Correct 5 ms 204 KB Output is correct
55 Correct 4 ms 308 KB Output is correct
56 Correct 3 ms 204 KB Output is correct
57 Correct 8 ms 312 KB Output is correct
58 Correct 11 ms 312 KB Output is correct
59 Correct 13 ms 316 KB Output is correct
60 Correct 2 ms 204 KB Output is correct
61 Correct 2 ms 204 KB Output is correct
62 Correct 8 ms 204 KB Output is correct
63 Correct 8 ms 204 KB Output is correct
64 Correct 11 ms 204 KB Output is correct
65 Correct 3 ms 204 KB Output is correct
66 Correct 6 ms 204 KB Output is correct
67 Correct 5 ms 204 KB Output is correct
68 Correct 17 ms 312 KB Output is correct
69 Correct 20 ms 312 KB Output is correct
70 Correct 21 ms 320 KB Output is correct
71 Correct 1 ms 204 KB Output is correct
72 Correct 26 ms 204 KB Output is correct
73 Correct 23 ms 320 KB Output is correct
74 Correct 20 ms 308 KB Output is correct

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 316 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 2 ms 204 KB Output is correct
31 Correct 2 ms 312 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 2 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 2 ms 204 KB Output is correct
36 Correct 3 ms 204 KB Output is correct
37 Correct 4 ms 204 KB Output is correct
38 Correct 5 ms 204 KB Output is correct
39 Correct 4 ms 308 KB Output is correct
40 Correct 5 ms 204 KB Output is correct
41 Correct 4 ms 204 KB Output is correct
42 Correct 4 ms 316 KB Output is correct
43 Correct 3 ms 204 KB Output is correct
44 Correct 9 ms 204 KB Output is correct
45 Correct 11 ms 308 KB Output is correct
46 Correct 14 ms 316 KB Output is correct
47 Correct 2 ms 204 KB Output is correct
48 Correct 2 ms 204 KB Output is correct
49 Correct 9 ms 204 KB Output is correct
50 Correct 8 ms 308 KB Output is correct
51 Correct 13 ms 204 KB Output is correct
52 Correct 415 ms 300 KB Output is correct
53 Correct 666 ms 304 KB Output is correct
54 Correct 975 ms 312 KB Output is correct
55 Execution timed out 1085 ms 204 KB Time limit exceeded
56 Halted 0 ms 0 KB -