# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
42001 | TAMREF | Bali Sculptures (APIO15_sculpture) | C++11 | 100 ms | 864 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;
typedef long long ll;
const int mx = 2005;
int n, A, B;
ll S[mx], ans;
bool dp1[105][105];
void solve1(){
ans = 0;
ll cur = 0;
for(int b = 41; b >= 0; b--){
ll t = cur | (1LL << b);
dp1[0][0] = true;
for(int i = 1; i <= n; i++){
for(int j = 1; j <= i; j++){
dp1[i][j] = false;
for(int k = 0; k < i; k++){
ll ps = S[i] - S[k];
if(!(ps & t)){
dp1[i][j] |= dp1[k][j-1];
}
}
}
}
# | 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... |