# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
768874 | raysh07 | Bali Sculptures (APIO15_sculpture) | C++17 | 359 ms | 856 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;
//#define int long long
#define INF (int)1e18
#define f first
#define s second
mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());
int n, a, b;
const int N = 2005;
int aa[N];
long long p[N];
bitset <N> bs[N];
bool check(long long x){
bs[0].set(0);
for (int i = 1; i <= n; i++){
bs[i] &= 0;
for (int j = 0; j < i; j++){
long long val = p[i] - p[j];
if ((val | x) == x) {
bs[i] |= bs[j] << 1;
}
}
}
for (int i = a; i <= b; i++){
if (bs[n].test(i)) return true;
# | 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... |