oj.uz

Submission #31137

# Submission time Handle Problem Language Result Execution time Memory
31137 2017-08-11T02:51:18 Z nibnalin Bali Sculptures (APIO15_sculpture) C++14
100 / 100
 156 ms 33460 KB 
#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;

typedef long long int lli;

const lli maxn = lli(2e3)+5, inf = lli(1e14)+5, maxb = 50;

lli n, a, b, A[maxn], memo1[maxn], memo2[maxn][maxn];

lli DP1(lli idx, lli mask)
{
    if(idx > n) return 0;
    else if(memo1[idx] != -1) return memo1[idx];
    else
    {
        lli res = inf;
        for(lli i = idx;i <= n;i++)
        {
            lli c = A[i]-A[idx-1];
            if((mask|c) == mask)
            {
                res = min(res, DP1(i+1, mask)+1);
            }
        }
        memo1[idx] = res;
        return res;
    }
}

bool DP2(lli idx, lli p, lli mask)
{
    if(idx == n+1)
    {
        return (a <= p && p <= b);
    }
    else if(p > b) return 0;
    else if(memo2[idx][p] != -1) return memo2[idx][p];
    else
    {
        for(lli i = idx;i <= n;i++)
        {
            lli c = A[i]-A[idx-1];
            if((mask|c) == mask && DP2(i+1, p+1, mask))
            {
                memo2[idx][p] = 1;
                return 1;
            }
        }
        memo2[idx][p] = 0;
        return 0;
    }
}

int main(void)
{
    scanf("%lld%lld%lld", &n, &a, &b);

    for(lli i = 1;i <= n;i++) scanf("%lld", &A[i]);

    for(lli i = 1;i <= n;i++) A[i] += A[i-1];
    if(a == 1)
    {
        lli mask = (1ll<<maxb)-1;
        for(lli i = maxb-1;i >= 0;i--)
        {
        	for(int i = 0;i <= n;i++) memo1[i] = -1;
            if(DP1(1, mask-(1ll<<i)) <= b) mask -= (1ll<<i);
        }
        printf("%lld\n", mask);
    }
    else
    {
        lli mask = (1ll<<maxb)-1;
        for(lli i = maxb-1;i >= 0;i--)
        {
            for(lli i = 0;i <= n;i++)
            {
                for(lli j = 0;j <= b;j++) memo2[i][j] = -1;
            }
            if(DP2(1, 0, mask-(1ll<<i))) mask -= (1ll<<i);
        }
        printf("%lld\n", mask);
    }
}

Compilation message

sculpture.cpp: In function 'int main()':
sculpture.cpp:58:38: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld%lld%lld", &n, &a, &b);
                                      ^
sculpture.cpp:60:51: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(lli i = 1;i <= n;i++) scanf("%lld", &A[i]);
                                                   ^

Subtask #1
9.0 / 9.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
25.0 / 25.0

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

Subtask #5
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 33456 KB Output is correct
2 Correct 0 ms 33456 KB Output is correct
3 Correct 0 ms 33456 KB Output is correct
4 Correct 0 ms 33456 KB Output is correct
5 Correct 0 ms 33456 KB Output is correct
6 Correct 0 ms 33456 KB Output is correct
7 Correct 0 ms 33456 KB Output is correct
8 Correct 0 ms 33456 KB Output is correct
9 Correct 0 ms 33456 KB Output is correct
10 Correct 0 ms 33456 KB Output is correct
11 Correct 0 ms 33456 KB Output is correct
12 Correct 0 ms 33456 KB Output is correct
13 Correct 0 ms 33456 KB Output is correct
14 Correct 0 ms 33456 KB Output is correct
15 Correct 0 ms 33456 KB Output is correct
16 Correct 0 ms 33456 KB Output is correct
17 Correct 0 ms 33456 KB Output is correct
18 Correct 0 ms 33456 KB Output is correct
19 Correct 0 ms 33456 KB Output is correct
20 Correct 0 ms 33456 KB Output is correct
21 Correct 0 ms 33456 KB Output is correct
22 Correct 0 ms 33456 KB Output is correct
23 Correct 0 ms 33456 KB Output is correct
24 Correct 0 ms 33456 KB Output is correct
25 Correct 0 ms 33456 KB Output is correct
26 Correct 0 ms 33456 KB Output is correct
27 Correct 0 ms 33456 KB Output is correct
28 Correct 0 ms 33456 KB Output is correct
29 Correct 0 ms 33456 KB Output is correct
30 Correct 0 ms 33456 KB Output is correct
31 Correct 0 ms 33456 KB Output is correct
32 Correct 0 ms 33456 KB Output is correct
33 Correct 0 ms 33456 KB Output is correct
34 Correct 0 ms 33456 KB Output is correct
35 Correct 0 ms 33456 KB Output is correct
36 Correct 0 ms 33456 KB Output is correct
37 Correct 0 ms 33456 KB Output is correct
38 Correct 0 ms 33456 KB Output is correct
39 Correct 0 ms 33456 KB Output is correct
40 Correct 0 ms 33456 KB Output is correct
41 Correct 0 ms 33456 KB Output is correct
42 Correct 0 ms 33456 KB Output is correct
43 Correct 0 ms 33456 KB Output is correct
44 Correct 0 ms 33456 KB Output is correct
45 Correct 0 ms 33456 KB Output is correct
46 Correct 0 ms 33456 KB Output is correct
47 Correct 0 ms 33456 KB Output is correct
48 Correct 0 ms 33456 KB Output is correct
49 Correct 0 ms 33456 KB Output is correct
50 Correct 0 ms 33456 KB Output is correct
51 Correct 0 ms 33456 KB Output is correct
52 Correct 9 ms 33456 KB Output is correct
53 Correct 13 ms 33456 KB Output is correct
54 Correct 39 ms 33456 KB Output is correct
55 Correct 29 ms 33456 KB Output is correct
56 Correct 86 ms 33456 KB Output is correct
57 Correct 93 ms 33456 KB Output is correct
58 Correct 103 ms 33456 KB Output is correct
59 Correct 129 ms 33456 KB Output is correct
60 Correct 106 ms 33456 KB Output is correct
61 Correct 0 ms 33456 KB Output is correct
62 Correct 9 ms 33456 KB Output is correct
63 Correct 46 ms 33456 KB Output is correct
64 Correct 23 ms 33456 KB Output is correct
65 Correct 46 ms 33456 KB Output is correct
66 Correct 73 ms 33456 KB Output is correct
67 Correct 79 ms 33460 KB Output is correct
68 Correct 156 ms 33460 KB Output is correct
69 Correct 89 ms 33456 KB Output is correct