Submission #137439

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
137439	2019-07-27T18:04:50 Z	shafinalam	Bali Sculptures (APIO15_sculpture)	C++14	0 / 100	456 ms	504 KB

sculpture

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
const int mxn = 30;
ll arr[mxn];
ll pre[mxn];

int main()
{
    int n, a, b;
    cin >> n;
    cin >> a >> b;

    for(int i = 0; i < n; i++) cin >> arr[i];

    pre[0] = arr[0];
    for(int i = 1; i < n; i++) pre[i] = arr[i]+pre[i-1];
    ll lim = (1<<n)-1;
    ll res = 4e18;
    for(int i = 0; i < lim; i++)
    {
        int cnt = __builtin_popcount(i)+1;
        if(cnt<a || cnt>b) continue;
        ll ans = 0, last = -1;
        for(int r = 0; r < n; r++)
        {
            ll sum = 0;
            if(i&(1<<r) || r==n-1)
            {
                if(last==-1) sum = pre[r];
                else sum = pre[r]-pre[last];
                last = r;
                ans = ans|sum;
            }
        }
        res = min(res, ans);
    }
    cout << res << '\n';
    return 0;
}

Subtask #1

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	380 KB	Output is correct
6	Correct	4 ms	380 KB	Output is correct
7	Correct	3 ms	504 KB	Output is correct
8	Correct	7 ms	376 KB	Output is correct
9	Correct	8 ms	256 KB	Output is correct
10	Correct	7 ms	256 KB	Output is correct
11	Correct	7 ms	256 KB	Output is correct
12	Correct	7 ms	376 KB	Output is correct
13	Correct	84 ms	256 KB	Output is correct
14	Correct	2 ms	256 KB	Output is correct
15	Incorrect	2 ms	376 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #2

0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	4 ms	256 KB	Output is correct
7	Correct	3 ms	256 KB	Output is correct
8	Correct	7 ms	256 KB	Output is correct
9	Correct	7 ms	256 KB	Output is correct
10	Correct	7 ms	256 KB	Output is correct
11	Correct	7 ms	376 KB	Output is correct
12	Correct	7 ms	360 KB	Output is correct
13	Correct	83 ms	396 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Incorrect	2 ms	252 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #3

0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	256 KB	Output is correct
5	Correct	2 ms	256 KB	Output is correct
6	Correct	4 ms	384 KB	Output is correct
7	Correct	3 ms	376 KB	Output is correct
8	Correct	7 ms	376 KB	Output is correct
9	Correct	7 ms	376 KB	Output is correct
10	Correct	7 ms	376 KB	Output is correct
11	Correct	7 ms	376 KB	Output is correct
12	Correct	7 ms	376 KB	Output is correct
13	Correct	83 ms	476 KB	Output is correct
14	Correct	169 ms	376 KB	Output is correct
15	Correct	456 ms	356 KB	Output is correct
16	Incorrect	2 ms	376 KB	Output isn't correct
17	Halted	0 ms	0 KB	-

Subtask #4

0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	252 KB	Output is correct
3	Correct	2 ms	348 KB	Output is correct
4	Correct	2 ms	380 KB	Output is correct
5	Correct	2 ms	256 KB	Output is correct
6	Correct	4 ms	376 KB	Output is correct
7	Correct	3 ms	376 KB	Output is correct
8	Correct	7 ms	376 KB	Output is correct
9	Correct	7 ms	376 KB	Output is correct
10	Correct	7 ms	376 KB	Output is correct
11	Correct	7 ms	376 KB	Output is correct
12	Correct	7 ms	376 KB	Output is correct
13	Correct	83 ms	376 KB	Output is correct
14	Correct	2 ms	256 KB	Output is correct
15	Incorrect	2 ms	256 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #5

0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	256 KB	Output is correct
6	Correct	5 ms	504 KB	Output is correct
7	Correct	3 ms	356 KB	Output is correct
8	Correct	7 ms	376 KB	Output is correct
9	Correct	7 ms	376 KB	Output is correct
10	Correct	7 ms	376 KB	Output is correct
11	Correct	7 ms	380 KB	Output is correct
12	Correct	7 ms	256 KB	Output is correct
13	Correct	84 ms	376 KB	Output is correct
14	Correct	2 ms	256 KB	Output is correct
15	Correct	2 ms	256 KB	Output is correct
16	Correct	3 ms	376 KB	Output is correct
17	Correct	5 ms	256 KB	Output is correct
18	Correct	11 ms	376 KB	Output is correct
19	Correct	7 ms	256 KB	Output is correct
20	Correct	74 ms	256 KB	Output is correct
21	Correct	85 ms	256 KB	Output is correct
22	Correct	7 ms	256 KB	Output is correct
23	Correct	84 ms	376 KB	Output is correct
24	Correct	167 ms	356 KB	Output is correct
25	Correct	454 ms	256 KB	Output is correct
26	Incorrect	2 ms	376 KB	Output isn't correct
27	Halted	0 ms	0 KB	-