# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
787590 | ymm | Shortcut (IOI16_shortcut) | C++17 | 2055 ms | 424 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>
#define Loop(x,l,r) for (ll x = (l); x < (r); ++x)
#define LoopR(x,l,r) for (ll x = (r)-1; x >= (l); --x)
typedef long long ll;
typedef std::pair<ll,ll> pll;
using namespace std;
const int N = 3030;
ll ps[N], a[N], C;
int n;
ll calcin(int l, int r)
{
#if 0
ll ans = 0;
Loop (i,l,r+1) Loop (j,i+1,r+1) {
ll x = ps[j] - ps[i];
ll y = ps[r] - ps[j] + ps[i] - ps[l] + C;
ans = max(ans, min(x, y) + a[i] + a[j]);
}
return ans;
#endif
int p = l;
vector<int> vec;
int vecp = 0;
auto cw = [&](int i, int j) {
assert(l <= i && i <= r && l <= j && j <= r);
if (i == j)
return 0;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |