# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
401993 | ronnith | Feast (NOI19_feast) | C++14 | 202 ms | 11516 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 N = (int)3e5, K = (int)3e5;
int n, k;
int a[N];
int64_t dp[N][2];
int cnt[N][2];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> k;
for (int i = 0;i < n;i ++)
cin >> a[i];
auto check = [&](int64_t penalty) -> pair<int, int64_t> {
for (int i = 0;i < n;i ++) {
for (int pr = 0;pr < 2;pr ++) {
dp[i][pr] = LLONG_MIN;
cnt[i][pr] = INT_MAX;
}
}
if (0 >= a[0] - penalty) {
dp[0][0] = 0;
cnt[0][0] = 0;
} else {
# | 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... |