제출 #286355

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
286355		SamAnd	Shortcut (IOI16_shortcut)	C++17	0 / 100	1 ms	416 KiB

shortcut

#include "shortcut.h"
#include <bits/stdc++.h>
using namespace std;
#define m_p make_pair
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
typedef long long ll;
const int N = 502;
const ll INF = 1000000009000000009;

int n;
ll gg;
ll l[N], d[N];

ll p[N], s[N];
ll pp[N], ss[N];
ll pl[N];

long long find_shortcut(int n_, std::vector<int> l_, std::vector<int> d_, int c_)
{
    n = n_;
    for (int i = 1; i < n; ++i)
        l[i] = l_[i - 1];
    for (int i = 1; i <= n; ++i)
        d[i] = d_[i - 1];
    gg = c_;

    for (int i = 1; i <= n; ++i)
    {
        pp[i] = max(pp[i - 1], p[i - 1] + l[i - 1] + d[i]);
        p[i] = max(p[i - 1] + l[i - 1], d[i]);
    }
    for (int i = n; i >= 1; --i)
    {
        ss[i] = max(ss[i + 1], s[i + 1] + l[i] + d[i]);
        s[i] = max(s[i + 1] + l[i], d[i]);
    }
    for (int i = 1; i <= n; ++i)
        pl[i] = pl[i - 1] + l[i - 1];

    ll ans = INF;
    for (int x1 = 1; x1 <= n; ++x1)
    {
        for (int x2 = x1 + 1; x2 <= n; ++x2)
        {
            ll yans = max(pp[x1], ss[x2]);
            ll d1 = d[x1];
            ll d2 = d[x2];
            d[x1] = p[x1];
            d[x2] = s[x2];
            ll u = pl[x2] - pl[x1];
            for (int i = x1; i <= x2; ++i)
            {
                for (int j = i + 1; j <= x2; ++j)
                {
                    yans = max(yans,
                               d[i] + d[j] + min(p[j] - p[i], u - (p[j] - p[i]) + gg));
                }
            }
            d[x1] = d1;
            d[x2] = d2;
            ans = min(ans, yans);
        }
    }

    return ans;
}

• 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