Submission #137440

# Submission time Handle Problem Language Result Execution time Memory
137440 2019-07-27T18:07:06 Z shafinalam Bali Sculptures (APIO15_sculpture) C++14
0 / 100
455 ms 476 KB
#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 = LLONG_MAX;
    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;
}
# 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 256 KB Output is correct
6 Correct 4 ms 376 KB Output is correct
7 Correct 3 ms 252 KB Output is correct
8 Correct 7 ms 376 KB Output is correct
9 Correct 7 ms 256 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 86 ms 336 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 -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 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 376 KB Output is correct
7 Correct 3 ms 376 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 376 KB Output is correct
11 Correct 7 ms 376 KB Output is correct
12 Correct 7 ms 256 KB Output is correct
13 Correct 83 ms 256 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Incorrect 2 ms 380 KB Output isn't correct
16 Halted 0 ms 0 KB -
# 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 352 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 7 ms 376 KB Output is correct
9 Correct 7 ms 256 KB Output is correct
10 Correct 7 ms 376 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 388 KB Output is correct
14 Correct 168 ms 376 KB Output is correct
15 Correct 455 ms 392 KB Output is correct
16 Incorrect 2 ms 376 KB Output isn't correct
17 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 380 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 256 KB Output is correct
6 Correct 5 ms 376 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 376 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 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Incorrect 2 ms 256 KB Output isn't correct
16 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 252 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 376 KB Output is correct
7 Correct 5 ms 256 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 256 KB Output is correct
11 Correct 7 ms 256 KB Output is correct
12 Correct 7 ms 380 KB Output is correct
13 Correct 85 ms 392 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 256 KB Output is correct
17 Correct 5 ms 256 KB Output is correct
18 Correct 12 ms 256 KB Output is correct
19 Correct 7 ms 376 KB Output is correct
20 Correct 74 ms 376 KB Output is correct
21 Correct 84 ms 256 KB Output is correct
22 Correct 7 ms 376 KB Output is correct
23 Correct 85 ms 380 KB Output is correct
24 Correct 168 ms 380 KB Output is correct
25 Correct 454 ms 476 KB Output is correct
26 Incorrect 2 ms 256 KB Output isn't correct
27 Halted 0 ms 0 KB -