# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
105860 | IOrtroiii | Bali Sculptures (APIO15_sculpture) | C++14 | 137 ms | 512 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>
using namespace std;
int n, l, r;
long long a[2005];
namespace sub4 {
bool f[105][105];
bool can(long long val) {
memset(f, 0, sizeof f);
f[0][0] = true;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= i; ++j) {
for (int k = 0; k < i; ++k) {
if (f[k][j - 1] && ((a[i] - a[k]) | val) == val) {
f[i][j] = true; break;
}
}
}
}
for (int i = l; i <= r; ++i) if (f[n][i]) return true;
return false;
}
void solve() {
long long val = (1LL << 50) - 1;
for (int i = 49; i >= 0; --i) {
if (can(val ^ (1LL << i))) {
val ^= (1LL << i);
}
# | 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... |