# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
113658 | Akashi | Bali Sculptures (APIO15_sculpture) | C++14 | 216 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, a, b;
long long x[2005];
int d[2005];
bool dp[105][105];
inline bool check(long long mask){
if(n <= 100){
memset(dp, 0, sizeof(dp));
///can we divide first i elements into j groups
dp[0][0] = 1;
for(int i = 1; i <= n ; ++i){
for(int j = 0; j < i ; ++j){
for(int k = 1; k <= b ; ++k){
if(dp[j][k - 1] && (x[i] - x[j]) - ((x[i] - x[j]) & mask) == 0)
dp[i][k] = 1;
}
}
}
for(int k = a; k <= b ; ++k)
if(dp[n][k]) return 1;
}
else{
memset(d, 0x3f, sizeof(d));
d[0] = 0;
for(int i = 1; i <= n ; ++i){
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... |