제출 #1152653

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1152653		alexdd	Shortcut (IOI16_shortcut)	C++20	0 / 100	5 ms	328 KiB

shortcut

#include "shortcut.h"
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int INF = 1e18;
const int MAXN = 3005;
int a[MAXN];//pozitii
int d[MAXN];
int worst_pref[MAXN],worst_suff[MAXN];
int only_pref[MAXN],only_suff[MAXN];
long long find_shortcut(int32_t n, std::vector<int32_t> l, std::vector<int32_t> citd, int32_t c)
{
    for(int i=2;i<=n;i++)
        a[i] = a[i-1] + l[i-2];
    for(int i=1;i<=n;i++)
    {
        d[i] = citd[i-1];
    }

    worst_pref[0] = -INF;
    for(int i=1;i<=n;i++)
        worst_pref[i] = max(worst_pref[i-1], -a[i] + d[i]);
    worst_suff[n+1] = -INF;
    for(int i=n;i>0;i--)
        worst_suff[i] = max(worst_suff[i+1], a[i] + d[i]);

    only_pref[0] = -INF;
    for(int i=1;i<=n;i++)
        only_pref[i] = max({only_pref[i-1], a[i] + d[i] + worst_pref[i-1], d[i]});
    only_suff[n+1] = -INF;
    for(int i=n;i>0;i--)
        only_suff[i] = max({only_suff[i+1], -a[i] + d[i] + worst_suff[i+1], d[i]});

    int rez = only_pref[n];
    for(int i=1;i<=n;i++)
    {
        for(int j=i+1;j<=n;j++)
        {
            if(c >= a[j]-a[i])
                continue;
            int mxm=0;
            mxm = max(mxm, a[i] + worst_pref[i] + c + worst_suff[j] - a[j]);
            mxm = max(mxm, only_pref[i]);
            mxm = max(mxm, only_suff[j]);
            mxm = max(mxm, (int)c);


            for(int u=i+1;u<j;u++)
            {
                mxm = max(mxm, d[u] + worst_pref[i] + min(a[u], a[i] + c + a[j] - a[u]));
            }
            for(int u=i+1;u<j;u++)
            {
                mxm = max(mxm, d[u] + worst_suff[j] + min(-a[u], -a[j] + c + a[u] - a[i]));
            }
            for(int u=i+1;u<j;u++)
                mxm = max(mxm, d[u]);

            /*for(int u=i+1;u<j;u++)
                for(int v=u+1;v<j;v++)
                    mxm = max(mxm, d[u] + d[v] + min(a[v] - a[u], a[u] - a[v] + a[j]+c-a[i]));*/
            for(int u=i+1;u<j-1;u++)
            {
                int candidate = j-1;
                for(int v=u+1;v+1<j;v++)
                {
                    if(a[v] - a[u] <= a[u] - a[v] + a[j]+c-a[i] && a[v+1] - a[u] > a[u] - a[v+1] + a[j]+c-a[i])
                    {
                        candidate = v;
                        break;
                    }
                }
                for(int v=candidate-1;v<=candidate;v++)
                {
                    if(u<v && v<j)
                    {
                        mxm = max(mxm, d[u] + d[v] + min(a[v] - a[u], a[u] - a[v] + a[j]+c-a[i]));
                    }
                }
            }

            //if(mxm==60) cerr<<i<<" "<<j<<" zzz\n";

            rez = min(rez, mxm);
        }
    }
    return rez;
}
/*

4 10
10 20 20
0 40 0 30

output: 80


9 30
10 10 10 10 10 10 10 10
20 0 30 0 0 40 0 40 0

output: 110

*/

컴파일 시 표준 에러 (stderr) 메시지

shortcut.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
shortcut_c.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~

• Subtask 1: 0 / 9
• Subtask 2: 0 / 14
• Subtask 3: 0 / 8
• Subtask 4: 0 / 7
• Subtask 5: 0 / 33
• Subtask 6: 0 / 22
• Subtask 7: 0 / 4
• Subtask 8: 0 / 3