oj.uz

Submission #1115538

# Submission time Handle Problem Language Result Execution time Memory
1115538 2024-11-20T15:18:02 Z gdragon Bali Sculptures (APIO15_sculpture) C++17
46 / 100
 20 ms 4488 KB 
#include <bits/stdc++.h>
using namespace std;
#define TASK "long"
#define fi first
#define se second
#define ll long long
#define pb push_back
#define ALL(x) (x).begin(), (x).end()
#define GETBIT(mask, i) ((mask) >> (i) & 1)
#define MASK(i) ((1LL) << (i))
#define SZ(x) ((int)(x).size())
#define mp make_pair
#define CNTBIT(mask) __builtin_popcount(mask)
template<class X, class Y> bool maximize(X &x, Y y){ if (x < y) {x = y; return true;} return false;};
template<class X, class Y> bool minimize(X &x, Y y){ if (x > y) {x = y; return true;} return false;};
typedef pair<int, int> ii;
const int N = 1e5 + 5;
const long long INF = (long long)1e18 + 7;
const int mod = 1e9 + 7;
int n, A, B;
vector<long long> f;
long long a[N];
void read() {
    cin >> n >> A >> B;
    f.assign(n + 1, 0);
    for(int i = 1; i <= n; i++) {
        cin >> f[i];
        a[i] = f[i];
        f[i] += f[i - 1];
    }
}
long long sum(int l, int r) {
    return f[r] - f[l - 1];
}
void sub1() {
    int m = n - 1;
    long long ans = INF;
    for(int mask = 0; mask < MASK(m); mask++) {
        if (CNTBIT(mask) + 1 > B || CNTBIT(mask) + 1 < A) continue;
        int pre = 1;
        long long res = 0;
        for(int i = 1; i < n; i++) if (GETBIT(mask, i - 1)) {
            res |= sum(pre, i);
            pre = i + 1;
        }
        res |= sum(pre, n);
        ans = min(ans, res);
    }
    cout << ans;
}
void sub3() {
    vector<vector<vector<long long>>> dp(n + 2, vector<vector<long long>>(B + 2));
    dp[0][0].push_back(0);
    for(int i = 1; i <= n; i++) {
        for(int k = 1; k <= min(i, B); k++) {
            long long x = 0;
            for(int j = i; j >= 1; j--) {
                x += a[j];
                long long mn1 = INF, mn2 = INF;
                for(long long z: dp[j - 1][k - 1]) {
                    long long tmp = (x | z);
                    if (mn1 > tmp) {
                        mn2 = mn1;
                        mn1 = tmp;
                    }
                    else minimize(mn2, tmp);
                }
                if (mn1 != INF) dp[i][k].push_back(mn1);
                if (mn2 != INF) dp[i][k].push_back(mn2);
            }
        }
    }
    long long ans = INF;
    for(int k = A; k <= B; k++) {
        for(long long x: dp[n][k]) ans = min(ans, x);
    }
    cout << ans;
}
void solve() {
    sub3(); return;
    if (n <= 20) {
        sub1();
        return;
    }
    else {
        sub3();
    }
}
signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    if (fopen(TASK".inp", "r")) {
        freopen(TASK".inp", "r", stdin);
        freopen(TASK".out", "w", stdout);
    }
    // cerr << (1082353817592 | 53288572918018395) << endl;
    int test = 1;
    // cin >> test;
    while(test--) {
        read();
        solve();
    }
    return 0;
}

Compilation message

sculpture.cpp: In function 'int main()':
sculpture.cpp:92:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   92 |         freopen(TASK".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
sculpture.cpp:93:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   93 |         freopen(TASK".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 592 KB Output is correct
18 Correct 2 ms 848 KB Output is correct
19 Correct 2 ms 1016 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 2 ms 848 KB Output is correct
22 Correct 2 ms 592 KB Output is correct
23 Correct 1 ms 592 KB Output is correct
24 Correct 2 ms 848 KB Output is correct
25 Correct 3 ms 644 KB Output is correct
26 Correct 5 ms 1360 KB Output is correct
27 Correct 11 ms 3152 KB Output is correct
28 Correct 16 ms 4456 KB Output is correct
29 Correct 17 ms 4464 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 20 ms 3648 KB Output is correct
32 Correct 18 ms 4208 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 504 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 504 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 504 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 1 ms 428 KB Output is correct
37 Correct 1 ms 336 KB Output is correct
38 Correct 1 ms 336 KB Output is correct
39 Correct 1 ms 336 KB Output is correct
40 Correct 1 ms 592 KB Output is correct
41 Correct 2 ms 848 KB Output is correct
42 Correct 2 ms 848 KB Output is correct
43 Correct 1 ms 336 KB Output is correct
44 Correct 2 ms 848 KB Output is correct
45 Correct 2 ms 592 KB Output is correct
46 Correct 2 ms 592 KB Output is correct
47 Correct 2 ms 1020 KB Output is correct
48 Correct 2 ms 592 KB Output is correct
49 Correct 7 ms 1360 KB Output is correct
50 Correct 12 ms 3152 KB Output is correct
51 Correct 18 ms 4488 KB Output is correct
52 Correct 18 ms 4432 KB Output is correct
53 Correct 1 ms 336 KB Output is correct
54 Correct 15 ms 3664 KB Output is correct
55 Correct 17 ms 4220 KB Output is correct
56 Incorrect 2 ms 848 KB Output isn't correct
57 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 504 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 504 KB Output is correct
16 Correct 1 ms 504 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 2 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 1 ms 592 KB Output is correct
28 Correct 2 ms 848 KB Output is correct
29 Correct 2 ms 1016 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 2 ms 796 KB Output is correct
32 Correct 2 ms 592 KB Output is correct
33 Correct 2 ms 764 KB Output is correct
34 Correct 2 ms 848 KB Output is correct
35 Correct 3 ms 592 KB Output is correct
36 Correct 8 ms 1360 KB Output is correct
37 Correct 12 ms 3152 KB Output is correct
38 Correct 17 ms 4432 KB Output is correct
39 Correct 19 ms 4424 KB Output is correct
40 Correct 1 ms 336 KB Output is correct
41 Correct 15 ms 3664 KB Output is correct
42 Correct 18 ms 4352 KB Output is correct
43 Incorrect 2 ms 1016 KB Output isn't correct
44 Halted 0 ms 0 KB -