oj.uz

Submission #41391

# Submission time Handle Problem Language Result Execution time Memory
41391 2018-02-17T06:40:14 Z krauch Bali Sculptures (APIO15_sculpture) C++14
37 / 100
 20 ms 1540 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair < int, int > PII;

#define F first
#define S second
#define mkp make_pair
#define eb emplace_back
#define all(a) a.begin(), a.end()
#define sz(a) (int)a.size()
#define y1 kekek
#define forn(x, a, b) for (int x = a; x <= b; ++x)
#define for1(x, a, b) for (int x = a; x >= b; --x)

const ll ool = 1e18 + 9;
const int N = 2e3 + 6, oo = 1e9 + 9, base = 1e9 + 7;

int n, A, B, a[N], d[N][N], d2[55][22][555];

int main() {
    #ifdef krauch
        freopen("input.txt", "r", stdin);
    #endif

    cin >> n >> A >> B;
    forn(i, 1, n) {
        cin >> a[i];
    }

    if (A > 1) {
        d2[0][0][0] = 1;
        forn(i, 1, n) {
            forn(j, 1, B) {
                int sum = 0;
                for1(k, i, 1) {
                    sum += a[k];
                    forn(l, 0, 500) {
                        d2[i][j][l | sum] |= d2[k - 1][j - 1][l];
                    }
                }
            }
        }
        int mn = oo;
        forn(i, A, B) {
            forn(j, 0, 500) {
                if (d2[n][i][j]) mn = min(mn, j);
            }
        }

        cout << mn << "\n";

        return 0;
    }

    forn(j, 0, 2000) d[0][j] = oo;
    d[0][0] = 0;

    forn(i, 1, n) {
        int sum = 0;
        forn(j, 0, 2000) d[i][j] = oo;
        for1(j, i, 1) {
            sum += a[j];
            forn(k, 0, 2000) {
                d[i][k | sum] = min(d[i][k | sum], d[j - 1][k] + 1);
            }
        }
    }

    int pos = 2000;
    forn(i, 0, 2000) {
        if (d[n][i] <= B) {
            pos = i;
            break;
        }
    }
    cout << pos << "\n";

    return 0;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 480 KB Output is correct
3 Correct 2 ms 480 KB Output is correct
4 Correct 2 ms 496 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 640 KB Output is correct
7 Correct 3 ms 688 KB Output is correct
8 Correct 2 ms 696 KB Output is correct
9 Correct 2 ms 696 KB Output is correct
10 Correct 3 ms 696 KB Output is correct
11 Correct 2 ms 712 KB Output is correct
12 Correct 2 ms 712 KB Output is correct
13 Correct 3 ms 712 KB Output is correct
14 Correct 2 ms 712 KB Output is correct
15 Correct 2 ms 712 KB Output is correct
16 Correct 2 ms 712 KB Output is correct
17 Correct 2 ms 712 KB Output is correct
18 Correct 2 ms 712 KB Output is correct
19 Correct 3 ms 1096 KB Output is correct
20 Correct 2 ms 1096 KB Output is correct
21 Correct 3 ms 1096 KB Output is correct
22 Correct 3 ms 1096 KB Output is correct
23 Correct 3 ms 1096 KB Output is correct
24 Correct 2 ms 1096 KB Output is correct
25 Correct 3 ms 1096 KB Output is correct
26 Correct 4 ms 1260 KB Output is correct
27 Runtime error 3 ms 1260 KB Execution killed with signal 11 (could be triggered by violating memory limits)
28 Halted 0 ms 0 KB -

Subtask #2
16.0 / 16.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1540 KB Output is correct
2 Correct 2 ms 1540 KB Output is correct
3 Correct 2 ms 1540 KB Output is correct
4 Correct 2 ms 1540 KB Output is correct
5 Correct 2 ms 1540 KB Output is correct
6 Correct 2 ms 1540 KB Output is correct
7 Correct 2 ms 1540 KB Output is correct
8 Correct 2 ms 1540 KB Output is correct
9 Correct 2 ms 1540 KB Output is correct
10 Correct 3 ms 1540 KB Output is correct
11 Correct 3 ms 1540 KB Output is correct
12 Correct 3 ms 1540 KB Output is correct
13 Correct 2 ms 1540 KB Output is correct
14 Correct 2 ms 1540 KB Output is correct
15 Correct 2 ms 1540 KB Output is correct
16 Correct 2 ms 1540 KB Output is correct
17 Correct 2 ms 1540 KB Output is correct
18 Correct 2 ms 1540 KB Output is correct
19 Correct 3 ms 1540 KB Output is correct
20 Correct 2 ms 1540 KB Output is correct
21 Correct 3 ms 1540 KB Output is correct
22 Correct 3 ms 1540 KB Output is correct
23 Correct 4 ms 1540 KB Output is correct
24 Correct 2 ms 1540 KB Output is correct
25 Correct 3 ms 1540 KB Output is correct
26 Correct 4 ms 1540 KB Output is correct
27 Runtime error 2 ms 1540 KB Execution killed with signal 11 (could be triggered by violating memory limits)
28 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1540 KB Output is correct
2 Correct 2 ms 1540 KB Output is correct
3 Correct 2 ms 1540 KB Output is correct
4 Correct 2 ms 1540 KB Output is correct
5 Correct 2 ms 1540 KB Output is correct
6 Correct 2 ms 1540 KB Output is correct
7 Correct 2 ms 1540 KB Output is correct
8 Correct 2 ms 1540 KB Output is correct
9 Correct 2 ms 1540 KB Output is correct
10 Correct 2 ms 1540 KB Output is correct
11 Correct 2 ms 1540 KB Output is correct
12 Correct 2 ms 1540 KB Output is correct
13 Correct 2 ms 1540 KB Output is correct
14 Runtime error 2 ms 1540 KB Execution killed with signal 11 (could be triggered by violating memory limits)
15 Halted 0 ms 0 KB -