oj.uz

답안 #108256

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
108256 2019-04-28T11:19:40 Z golub Bali Sculptures (APIO15_sculpture) C++14
71 / 100
 1000 ms 3080 KB 
// #define TASK "sweets"

// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse4.2,avx2")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC optimize("unroll-all-loops")

#include <bits/stdc++.h>
// #include <ext/rope>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/detail/standard_policies.hpp>

// using namespace __gnu_cxx;`
// using namespace __gnu_pbds;
using namespace std;

// template<class K>
// using ordered_set = tree<K, null_type, less<K>, rb_tree_tag, tree_order_statistics_node_update>;

// template<class K, class T>
// using ordered_map = tree<K, T, less<K>, rb_tree_tag, tree_order_statistics_node_update>;

// mt19937 rnd((int)chrono::high_resolution_clock::now().time_since_epoch().count());
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define F first
#define S second
#define pb push_back
#define pii pair<int, int>
#define len(x) (long long)x.size()
#define int long long

typedef long long ll;
typedef long double ld;

const long long INF = (int)numeric_limits<int>::max() >> 1;
const long long MAXN = (long long)1e5 + 10;
const long long MOD = (long long)1e9 + 7;
const long double EPS = (long double)1e-12;

// char _buf_[(int)6e6];
// size_t _p_ = 0;

// inline void *operator new(size_t _n_) {
//    _p_ += _n_;
//    return _buf_ + _p_ - _n_;
// }
// inline void operator delete(void*) {};

ll power(ll x, ll n, ll mod = 1e9 + 7) {
    if (n == 0) return 1ll;
    if (n & 1ll) return power(x, n - 1ll, mod) * x % mod;
    ll tmp = power(x, n >> 1ll, mod);
    return (tmp * tmp) % mod;
}

ll gcd(ll a, ll b) {
    if (b == 0) return a;
    return gcd (b, a % b);
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}

template<typename A, typename B>
bool cmax(A &a, const B &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template<typename A, typename B>
bool cmin(A &a, const B &b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

vector<int> y;
int ans = 0;
vector<int> pref;

int getSUM(int l, int r) {
    if (l == 0) return pref[r];
    return pref[r] - pref[l - 1];
}

bool can(int bit, int a, int b) {
    vector<int> dp(len(y), INF);
    for (int i = 0; i < len(dp); i++) {
        for (int j = -1; j < i; j++) {
            if ((getSUM(j + 1, i) & (~ans)) < (1ll << bit)) {
                if (j == -1) dp[i] = cmin(dp[i], 1);
                else cmin(dp[i], dp[j] + 1);
            }
        }
    }
    return dp.back() <= b;
}

bool can2(int bit, int a, int b) {
    int n = len(y);
    vector<vector<int>> dp(n, vector<int>(n + 1, 0));
    for (int i = 0; i < n; i++) {
        for (int j = -1; j < i; j++) {
            if ((getSUM(j + 1, i) & (~ans)) < (1ll << bit)) {
                if (j == -1) {
                    dp[i][1] = 1;
                    continue;
                }
                for (int k = 1; k <= n; k++) {
                    dp[i][k] |= dp[j][k - 1];
                }
            }
        }
    }
    for (int i = a; i <= b; i++) {
        if (dp.back()[i]) return 1;
    }
    return 0;
}

signed main() {
#ifndef LOCAL
    #ifdef TASK
    freopen(TASK".in", "r", stdin);
    freopen(TASK".out", "w", stdout);
#endif
#endif
    iostream::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    // == SOLUTION == //
    int n, a, b;
    cin >> n >> a >> b;
    y.resize(n); pref.resize(n);
    for (auto &x: y) cin >> x;
    pref[0] = y[0];
    for (int i = 1; i < n; i++) {
        pref[i] = pref[i - 1] + y[i];
    }
    for (int i = 60; i >= 0; i--) {
        if (!can2(i, a, b)) {
            ans |= (1ll << i);
        }
    }
    cout << ans << "\n";
}

Subtask #1
9.0 / 9.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
25.0 / 25.0

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

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 320 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 3 ms 352 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 3 ms 384 KB Output is correct
18 Correct 2 ms 264 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 3 ms 384 KB Output is correct
21 Correct 3 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 3 ms 384 KB Output is correct
25 Correct 3 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 4 ms 384 KB Output is correct
28 Correct 7 ms 384 KB Output is correct
29 Correct 6 ms 384 KB Output is correct
30 Correct 8 ms 384 KB Output is correct
31 Correct 6 ms 384 KB Output is correct
32 Correct 6 ms 512 KB Output is correct
33 Correct 6 ms 384 KB Output is correct
34 Correct 5 ms 384 KB Output is correct
35 Correct 9 ms 384 KB Output is correct
36 Correct 14 ms 384 KB Output is correct
37 Correct 19 ms 384 KB Output is correct
38 Correct 33 ms 384 KB Output is correct
39 Correct 27 ms 384 KB Output is correct
40 Correct 46 ms 504 KB Output is correct
41 Correct 24 ms 384 KB Output is correct
42 Correct 25 ms 384 KB Output is correct
43 Correct 5 ms 384 KB Output is correct
44 Correct 9 ms 384 KB Output is correct
45 Correct 13 ms 384 KB Output is correct
46 Correct 16 ms 384 KB Output is correct
47 Correct 16 ms 512 KB Output is correct
48 Correct 24 ms 384 KB Output is correct
49 Correct 19 ms 384 KB Output is correct
50 Correct 26 ms 496 KB Output is correct
51 Correct 16 ms 512 KB Output is correct
52 Execution timed out 1066 ms 3080 KB Time limit exceeded
53 Halted 0 ms 0 KB -