# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
413797 | Tc14 | The short shank; Redemption (BOI21_prison) | C++17 | 1715 ms | 90596 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.
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ve vector
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9 + 10;
const ll LLINF = (ll)1e18 + 10;
int n, d, t;
ve<int> T;
struct value {
int pos;
int inc;
pll min;
pll seg;
};
pll calcDP(ll lambda) {
stack<value> U;
pll seg;
U.push({-1, 0, {LLINF, -1}, {LLINF, -1}});
if (T[n - 1] > t) {
U.push({n - 1, 0, {0, 0}, {0, 0}});
seg = {LLINF, 0};
# | 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... |