# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
36484 | UncleGrandpa925 | Bali Sculptures (APIO15_sculpture) | C++14 | 509 ms | 2232 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.
/*input
6 1 3
8 1 2 1 5 4
*/
#include <bits/stdc++.h>
using namespace std;
#define sp ' '
#define endl '\n'
#define fi first
#define se second
#define mp make_pair
#define int long long
#define N 2005
#define bit(x,y) ((x>>y)&1LL)
int n, A, B;
int a[N], sum[N];
int getSum(int l, int r) {
return sum[r] - sum[l - 1];
}
bool valid(int curMask, int lim) {
return ((curMask & lim) == 0 ? 1 : 0);
}
namespace sub4 {
bool dp[105][105];
bool check(int mask) {
memset(dp, 0, sizeof(dp));
# | 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... |