# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
427704 | keko37 | The short shank; Redemption (BOI21_prison) | C++14 | 31 ms | 47332 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;
typedef long long llint;
typedef pair <llint, llint> pi;
const int MAXN = 2000005;
const llint INF = 1000000000000000000LL;
int n, k, T, ofs = 1, cnt;
int t[MAXN], lim[MAXN], add[MAXN];
llint mx[75005 * 4], br[75005 * 4], prop[75005 * 4];
pi dp[MAXN];
set <int> st;
vector <int> v[MAXN];
void build () {
for (int i = 1; i <= n; i++) {
int j = i + T - t[i];
if (i <= j) {
st.insert(i);
if (j + 1 <= n) v[j + 1].push_back(i);
}
for (auto x : v[i]) {
st.erase(x);
}
if (!st.empty()) {
lim[i] = *st.rbegin();
if (lim[i] < i) add[lim[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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |