Submission #827168

#	Time	Username	Problem	Language	Result	Execution time	Memory
827168		tolbi	Shortcut (IOI16_shortcut)	C++17	38 / 100	2060 ms	468 KiB

shortcut

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#include "shortcut.h"
long long find_shortcut(int n, std::vector<int> _p, std::vector<int> d, int c)
{
    vector<ll> pref;
    pref.push_back(0);
    for (int i = 0; i < n-1; i++){
        pref.push_back(_p[i]);
        pref[i+1]+=pref[i];
    }
    function<ll(int,int)> query;
    query = [&](int l, int r)->ll{
        if (l==r) return 0ll;
        if (r<l) swap(l,r);
        return pref[r]-pref[l];
    };
    ll ans = LONG_LONG_MAX;
    function<void(int,int)> dene;
    pair<ll,bool> pr;
    dene = [&](int l, int r){
        ll leftside=0;
        ll rightside=0;
        priority_queue<pair<ll,ll>> hoaydaaa;
        ll bruh=-1;
        for (int i = 0; i < n; i++){
            if (i){
                ll crr = 0;
                while (hoaydaaa.size()>0){
                    ll node = hoaydaaa.top().second;
                    if (query(node,l)+query(i,r)+c<query(node,i)){
                        bruh=max(bruh,query(node,l)+d[node]);
                        hoaydaaa.pop();
                    }
                    else break;
                }
                if (hoaydaaa.size()>0){
                    crr=max(crr,(ll)d[i]+pref[i]+hoaydaaa.top().first);
                }
                if (bruh!=-1){
                    crr=max(crr,(ll)d[i]+bruh+c+query(i,r));
                }
                if (i>=r){
                    rightside=max(rightside,crr);
                }
                else {
                    leftside=max(leftside,crr);
                }
            }
            hoaydaaa.push({(ll)d[i]-pref[i],i});
        }
        pr={max(leftside,rightside),(rightside>leftside)};
    };
    for (int l = 0; l < n; l++){
        int ll = l, rr = n-1;
        while (ll<rr){
            int mid = ll+(rr-ll)/2;
            dene(l,mid);
            ans=min(ans,pr.first);
            if (!pr.second){
                rr=mid;
            }
            else {
                ll=mid+1;
            }
        }
        dene(l,ll);
        ans=min(ans,pr.first);
    }
    for (int i = 0; i < n; ++i)
    {
        ans=max(ans,(ll)d[i]);
    }
    return ans;
}

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