# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1152790 | alexdd | Shortcut (IOI16_shortcut) | C++20 | 0 ms | 328 KiB |
#include "shortcut.h"
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int INF = 1e18;
const int MAXN = 3005;
int n,c;
int a[MAXN];//pozitii
int d[MAXN];
int worst_pref[MAXN],worst_suff[MAXN];
int only_pref[MAXN],only_suff[MAXN];
int inainte[MAXN][MAXN];
bool verif(int lim)
{
if(only_pref[n] <= lim)
return 1;
vector<vector<int>> prec(n+2,vector<int>(n+2,-INF));
for(int u=n;u>0;u--)
{
for(int v=n;v>u;v--)
{
if(a[v] + d[v] - a[u] + d[u] > lim)
{
prec[u][v] = a[u] - a[v] + d[u] + d[v];
}
prec[u][v] = max(prec[u][v], prec[u+1][v]);
}
}
vector<vector<bool>> aux(n+2,vector<bool>(n+2,1));
for(int i=1;i<=n;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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |