# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
25885 | Hiasat | Shortcut (IOI16_shortcut) | C++14 | 0 ms | 2140 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 "shortcut.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 3000;
const ll INF = 1e18;
ll L[N], R[N], mxL[N], mxR[N], pre[N];
vector<int> d, l;
int n;
ll c;
bool check(ll mid) {
for (int i = 0 ; i < n ; i++) {
if (mxL[i] > mid)
continue;
ll fage3 = -INF;
ll mixer = 0;
for (int j = i + 1 ; j < n ; j++) {
fage3 += l[j - 1];
if (L[j-1] + l[j-1] + d[j] > mid)
fage3 = max(fage3, L[i] + c + d[j]);
if (fage3 > mid)
break;
if (d[j] + l[j] + R[j + 1] > mid) {
mixer = max(mixer, pre[j] - pre[i] + d[j] + c);
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |