# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
45709 | Talant | Bali Sculptures (APIO15_sculpture) | C++17 | 1100 ms | 232432 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 fr first
#define sc second
#define OK puts("OK");
#define pb push_back
#define mk make_pair
#define int long long
using namespace std;
typedef long long ll;
const long long inf = (long long)1e15 + 7;
const long long N = (long long)2e5 + 7;
long long n,a,b;
long long ar[N],p[N];
set<int> dp[2002][2002];
long long mn = inf;
long long calc (long long l,long long r) {
return (p[r] - p[l - 1]);
}
main () {
cin >> n >> a >> b;
for (long long i = 1; i <= n; i ++) {
cin >> ar[i];
p[i] = p[i - 1] + ar[i];
dp[i][1].insert(p[i]);
}
for (long long j = 2; j <= b; j ++) {
for (long long i = j; i <= n; i ++) {
for (long long l = 1; l < i; l ++) {
for (auto to : dp[l][j - 1]) {
dp[i][j].insert(to | calc(l + 1,i));
}
}
}
}
for (long long i = a; i <= b; i ++) {
for (auto to : dp[n][i])
mn = min(mn,to);
}
cout << mn << endl;
}
/**
6 1 3
8 1 2 1 5 4
**/
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... |