# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
250520 | Vladikus004 | San (COCI17_san) | C++14 | 351 ms | 8896 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>
#define inf 2e9
#define int long long
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;
const int N = 41;
int n, h[N], g[N];
ll k;
vector <ll> v1[21], v2[21];
bool can(int mask){
int mx = -inf;
for (int i = 0; i < n; i++){
if (!(mask & (1LL<<i))) continue;
if (mx > h[i]) return false;
mx = h[i];
}
return true;
}
ll get_sum(int mask){
ll sum = 0;
for (int i = 0; i < n; i++){
if (!(mask & (1LL<<i))) continue;
sum += g[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... |