# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
32675 | minimario | Bali Sculptures (APIO15_sculpture) | C++14 | 796 ms | 2088 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;
const int MAX = 2005;
typedef long long ll;
int y[MAX];
bool in[50];
int dp[MAX], dp2[105][105]; // is it possible to cut 1..n into k parts
ll p[MAX];
// minimum number of parts that we need to cut 1...i into
// in order to have some kth bit off
vector<int> nesc;
bool works(ll x, int k) {
for (int i : nesc) {
if (x & (1LL<<i)) { return false; }
}
if (x & (1LL<<k)) { return false; }
return true;
}
int main() {
//freopen("a.in", "r", stdin);
//freopen("a.out", "w", stdout);
int n, a, b; scanf("%d %d %d", &n, &a, &b);
for (int i=1; i<=n; i++) {
scanf("%d", &y[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... |