# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
270483 | BeanZ | Bali Sculptures (APIO15_sculpture) | C++14 | 151 ms | 2144 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 REP(i,n) for (int i = 0; i < n; i++)
#define FOR(i,a,b) for (int i = a; i < b; i++)
int N, A, B;
int D[2001];
int maxD;
typedef long long ll;
const ll INF = 1LL << 57LL;
namespace subtask1
{
ll ans;
void go(int pos, int parts, ll sum, ll orr)
{
if (pos == N)
{
if (A <= parts && parts <= B)
ans = min(ans, sum | orr);
return;
}
// take
go(pos + 1, parts, sum + D[pos], orr);
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... |