# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
257480 | karma | Feast (NOI19_feast) | C++14 | 139 ms | 14972 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 pb emplace_back
#define ll long long
#define fi first
#define se second
#define mp make_pair
//#define int int64_t
using namespace std;
const int N = int(6e5) + 7;
typedef pair<int, int> pii;
ll f[N][2];
int cnt[N][2], n, k, a[N];
/// 0 - ok
/// 1 - opening
int check(ll mid) {
f[0][0] = 0, f[0][1] = -mid;
cnt[0][0] = 0, cnt[0][1] = 1;
for(int i = 1; i <= n; ++i) {
if(f[i - 1][0] > f[i - 1][1] + a[i]) {
f[i][0] = f[i - 1][0];
cnt[i][0] = cnt[i - 1][0];
} else if(f[i - 1][0] < f[i - 1][1] + a[i]) {
f[i][0] = f[i - 1][1] + a[i];
cnt[i][0] = cnt[i - 1][1];
} else {
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |