# | 제출 시각UTC-0 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1152774 | alexdd | Shortcut (IOI16_shortcut) | C++20 | 2072 ms | 117812 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=1;u<=n;u++)
{
for(int v=u+1;v<=n;v++)
{
if(a[v] + d[v] - a[u] + d[u] > lim)
{
prec[u][v] = a[u] - a[v] + d[u] + d[v];
}
}
}
for(int u=1;u<=n;u++)
{
for(int v=u+1;v<=n;v++)
컴파일 시 표준 에러 (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... |