oj.uz

Submission #541070

# Submission time Handle Problem Language Result Execution time Memory
541070 2022-03-22T07:45:50 Z MihaiPopa Bali Sculptures (APIO15_sculpture) C++14
71 / 100
 1000 ms 540 KB 
#include <iostream>

using namespace std;

const int NMAX = 2e3 + 2;
const int oo = 1e9;

int N, A, B;
int v[NMAX];
long long sp[NMAX];
bool dp[NMAX][NMAX];
int dp5[NMAX];
bool SOL[45];

static inline int mymin(int a, int b)
{
    return (a < b ? a : b);
}

static inline void Read()
{
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);

    cin >> N >> A >> B;
    for(int i = 1; i <= N; ++i)
        cin >> v[i], sp[i] = sp[i - 1] + v[i];

    return;
}

static inline long long Query(int l, int r)
{
    return (sp[r] - sp[l - 1]);
}

static inline bool verify(long long X, int bit)
{
    if(X & (1LL << bit))
        return false;
    for(int i = bit + 1; i <= 40; ++i)
        if((X & (1LL << i)) && !SOL[i])
            return false;

    return true;
}

static inline bool OK(int bit)
{
    for(int i = 1; i <= N; ++i)
        for(int j = 1; j <= N; ++j)
            dp[i][j] = false;
    dp[0][0] = true;

    for(int i = 1; i <= N; ++i)
        for(int k = 1; k <= i; ++k)
            for(int j = 0; j < i; ++j)
                dp[i][k] |= (verify(Query(j + 1, i), bit) & dp[j][k - 1]);
    for(int i = A; i <= B; ++i)
        if(dp[N][i])
            return true;

    return false;
}

static inline bool OK5(int bit)
{
    dp5[0] = 0;
    for(int i = 1; i <= N; ++i)
        dp5[i] = oo;

    for(int i = 1; i <= N; ++i)
        for(int j = 0; j < i; ++j)
            if(verify(Query(j + 1, i), bit))
                dp5[i] = (mymin(dp5[i], dp5[j] + 1));

    if(dp5[N] <= B)
        return true;

    return false;
}

static inline void Solve5()
{
    long long ans = 0;
    for(int i = 40; i >= 0; --i) {
        SOL[i] = !OK5(i);
        ans += (SOL[i] ? (1LL << i) : 0);
    }

    cout << ans << '\n';
    return;
}

static inline void Solve()
{
    long long ans = 0;
    for(int i = 40; i >= 0; --i) {
        SOL[i] = !OK(i);
        ans += (SOL[i] ? (1LL << i) : 0);
    }

    cout << ans << '\n';
    return;
}

int main()
{
    Read();
    if(A == 1)
        Solve5();
    else Solve();
    return 0;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 2 ms 336 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 3 ms 340 KB Output is correct
22 Correct 3 ms 340 KB Output is correct
23 Correct 3 ms 340 KB Output is correct
24 Correct 3 ms 340 KB Output is correct
25 Correct 3 ms 340 KB Output is correct
26 Correct 3 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 352 KB Output is correct
32 Correct 1 ms 352 KB Output is correct
33 Correct 1 ms 224 KB Output is correct
34 Correct 1 ms 372 KB Output is correct
35 Correct 1 ms 352 KB Output is correct
36 Correct 1 ms 352 KB Output is correct
37 Correct 1 ms 352 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 224 KB Output is correct
41 Correct 2 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 2 ms 340 KB Output is correct
44 Correct 2 ms 336 KB Output is correct
45 Correct 2 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 2 ms 340 KB Output is correct
48 Correct 2 ms 340 KB Output is correct
49 Correct 3 ms 328 KB Output is correct
50 Correct 4 ms 332 KB Output is correct
51 Correct 4 ms 340 KB Output is correct
52 Correct 4 ms 332 KB Output is correct
53 Correct 4 ms 340 KB Output is correct
54 Correct 4 ms 340 KB Output is correct
55 Correct 4 ms 340 KB Output is correct
56 Correct 3 ms 340 KB Output is correct
57 Correct 6 ms 340 KB Output is correct
58 Correct 8 ms 340 KB Output is correct
59 Correct 8 ms 340 KB Output is correct
60 Correct 2 ms 336 KB Output is correct
61 Correct 2 ms 352 KB Output is correct
62 Correct 6 ms 352 KB Output is correct
63 Correct 6 ms 224 KB Output is correct
64 Correct 167 ms 516 KB Output is correct
65 Correct 25 ms 352 KB Output is correct
66 Correct 53 ms 480 KB Output is correct
67 Correct 97 ms 480 KB Output is correct
68 Correct 129 ms 516 KB Output is correct
69 Correct 200 ms 480 KB Output is correct
70 Correct 82 ms 472 KB Output is correct
71 Correct 85 ms 536 KB Output is correct
72 Correct 168 ms 540 KB Output is correct
73 Correct 179 ms 540 KB Output is correct
74 Correct 147 ms 540 KB Output is correct

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 352 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 352 KB Output is correct
5 Correct 1 ms 352 KB Output is correct
6 Correct 1 ms 352 KB Output is correct
7 Correct 1 ms 352 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 352 KB Output is correct
10 Correct 1 ms 224 KB Output is correct
11 Correct 1 ms 224 KB Output is correct
12 Correct 1 ms 224 KB Output is correct
13 Correct 1 ms 224 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 328 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 2 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 2 ms 212 KB Output is correct
36 Correct 3 ms 340 KB Output is correct
37 Correct 4 ms 340 KB Output is correct
38 Correct 4 ms 340 KB Output is correct
39 Correct 4 ms 212 KB Output is correct
40 Correct 4 ms 340 KB Output is correct
41 Correct 4 ms 340 KB Output is correct
42 Correct 4 ms 336 KB Output is correct
43 Correct 3 ms 332 KB Output is correct
44 Correct 7 ms 348 KB Output is correct
45 Correct 7 ms 344 KB Output is correct
46 Correct 8 ms 340 KB Output is correct
47 Correct 2 ms 340 KB Output is correct
48 Correct 2 ms 340 KB Output is correct
49 Correct 6 ms 340 KB Output is correct
50 Correct 6 ms 340 KB Output is correct
51 Correct 8 ms 468 KB Output is correct
52 Correct 255 ms 340 KB Output is correct
53 Correct 400 ms 344 KB Output is correct
54 Correct 595 ms 340 KB Output is correct
55 Correct 714 ms 352 KB Output is correct
56 Execution timed out 1086 ms 340 KB Time limit exceeded
57 Halted 0 ms 0 KB -