# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
104772 | ekrem | Palembang Bridges (APIO15_bridge) | C++98 | 4 ms | 2176 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define inf 1000000007
#define N 105
using namespace std;
typedef long long ll;
ll n, x, y, ans, a[N], pre[N], dp[N][20*N];
int main() {
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
scanf("%lld %lld %lld",&n ,&x ,&y);
for(int i = 1; i <= n; i++){
scanf("%lld",a + i);
pre[i] = pre[i - 1] + a[i];
}
for(int i = 0; i < N; i++)
for(int j = 0; j < 20*N; j++)
dp[i][j] = inf;
dp[0][0] = 0;
for(int i = 1; i <= n; i++)
for(int j = 0; j < i; j++)
for(int k = 0; k < 20*N; k++)
dp[i][k|(pre[i] - pre[j])] = min(dp[i][k|(pre[i] - pre[j])], dp[j][k] + 1);
for(int i = 0; i < 20*N; i++)
if(dp[n][i] <= y){
printf("%d\n", i);
return 0;
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |