# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1029426 | MDario | The short shank; Redemption (BOI21_prison) | C++17 | 39 ms | 12116 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>
#include <functional>
#include <vector>
using namespace std;
#define F first
#define S second
typedef long long ll;
const string noyes[2] = {"NO", "YES"};
const ll INFLL = (1ll << 62);
const int INF = (1 << 30);
const int MAXN = 2'000'000;
const ll MOD = 1'000'000'007;
ll n, D, T;
ll a[MAXN];
int dp[MAXN][2];
void subtask_1() {
{
int c = 0;
ll last = INF;
for (int i = 0; i < n; i++) {
last = min(last + 1, a[i]);
c += (last <= T);
dp[i][0] = c;
}
}
for (int i = 0; i < D; i++) {
# | 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... |