# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
102823 | Noam527 | Bali Sculptures (APIO15_sculpture) | C++17 | 99 ms | 8568 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 CHECK cout << "ok" << endl
#define finish(x) return cout << x << endl, 0
typedef long long ll;
typedef long double ldb;
const int md = 1e9 + 7;
const ll inf = 1e18;
const int OO = 1;
const int OOO = 1;
using namespace std;
int n, lo, hi;
vector<int> a;
int dp[2002][2002];
ll b = 0;
bool good(ll sum) {
return (sum & b) == 0;
}
bool can1() {
ll sum = 0;
for (int i = 0; i < n; i++)
sum += a[i], dp[i][1] = good(sum);
for (int j = 2; j <= hi; j++) {
for (int i = j - 1; i < n; i++) {
dp[i][j] = 0;
sum = 0;
for (int k = i; !dp[i][j] && k >= j - 1; k--) {
sum += a[k];
# | 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... |