#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int maxn = (int)53;
const int INF = (int)1e9;
const ll LINF = (ll)1e18;
int n, A, B;
ll a[maxn], pre[maxn]; ll ans=LINF;
bool dp[maxn][maxn][25][1028];
void recur(int pos, int lpos, int knum, int Or){
if(dp[pos][lpos][knum][Or]) return;
dp[pos][lpos][knum][Or]=1;
if(pos==n+1) return;
if(pos!=n) recur(pos+1, lpos, knum, Or);
recur(pos+1, pos, knum+1, Or|(pre[pos]-pre[lpos]));
}
int32_t main() {
cin >> n >> A >> B;
for(int i = 0; i < n; i++) cin >> a[i], pre[i+1]=pre[i]+a[i];
int dp[110][2050];
for(int i = 0; i <= n; i++)
for(int j = 0; j < 2048; j++)
dp[i][j]=INF;
dp[0][0]=0; int sum;
for(int i = 0; i < n; i++)
for(int j = 0; j < 2048; j++)
for(int k = i+1; k <= n; k++)
if(dp[i][j]<INF) sum=pre[k]-pre[i],
dp[k][j|sum]=min(dp[k][j|sum], dp[i][j]+1);
for(int j = 0; j < 2048; j++)
if(dp[n][j]<=B) ans=min(ans,(ll)j);
cout << ans;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 2 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 3 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 4 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 5 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 6 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 7 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 8 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 9 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 10 |
Correct |
1 ms |
1236 KB |
Output is correct |
| 11 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 12 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 13 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 14 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 15 |
Incorrect |
1 ms |
1108 KB |
Output isn't correct |
| 16 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 2 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 3 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 4 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 5 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 6 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 7 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 8 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 9 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 10 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 11 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 12 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 13 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 14 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 15 |
Incorrect |
1 ms |
1108 KB |
Output isn't correct |
| 16 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 2 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 3 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 4 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 5 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 6 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 7 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 8 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 9 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 10 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 11 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 12 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 13 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 14 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 15 |
Correct |
2 ms |
1108 KB |
Output is correct |
| 16 |
Correct |
2 ms |
1108 KB |
Output is correct |
| 17 |
Correct |
3 ms |
1108 KB |
Output is correct |
| 18 |
Correct |
3 ms |
1108 KB |
Output is correct |
| 19 |
Correct |
3 ms |
1108 KB |
Output is correct |
| 20 |
Correct |
5 ms |
1108 KB |
Output is correct |
| 21 |
Correct |
4 ms |
1108 KB |
Output is correct |
| 22 |
Correct |
3 ms |
1108 KB |
Output is correct |
| 23 |
Correct |
4 ms |
1108 KB |
Output is correct |
| 24 |
Correct |
4 ms |
1108 KB |
Output is correct |
| 25 |
Incorrect |
1 ms |
1108 KB |
Output isn't correct |
| 26 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 2 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 3 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 4 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 5 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 6 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 7 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 8 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 9 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 10 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 11 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 12 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 13 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 14 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 15 |
Incorrect |
1 ms |
1108 KB |
Output isn't correct |
| 16 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 2 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 3 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 4 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 5 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 6 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 7 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 8 |
Correct |
1 ms |
1184 KB |
Output is correct |
| 9 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 10 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 11 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 12 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 13 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 14 |
Runtime error |
2 ms |
2132 KB |
Execution killed with signal 11 |
| 15 |
Halted |
0 ms |
0 KB |
- |
