제출 #902546

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

shortcut

#include "shortcut.h"
#include <bits/stdc++.h>
using namespace std;
const long long INF=1LL<<51;
const int mxn=1000001;
long long s[mxn];
long long find_shortcut(int n, vector <int> l, vector <int> d, int c){
    for (int i=1;i<n;i++)
        s[i]=s[i-1]+l[i-1];
    long long lo=0,hi=INF,kq=-1;
    while (lo<=hi){
        long long mid=(lo+hi)>>1,mnx=-INF,mxx=INF,mny=-INF,mxy=INF,x=-INF,y=INF;
        deque <pair <int, int>> q;
        for (int i=0;i<n;i++){
            while (!q.empty()&&s[i]+d[i]-q.front().first>mid){
                int i=q.front().second;
                x=max(x,s[i]+d[i]);
                y=min(x,s[i]-d[i]);
                q.pop_front();
            }
            while (!q.empty()&&q.back().first>=s[i]-d[i])
                q.pop_back();
            q.push_back({s[i]-d[i],i});
            mnx=max(mnx,s[i]+d[i]+c-mid+x);
            mxx=min(mxx,s[i]-d[i]-c+mid+y);
            mny=max(mny,s[i]+d[i]+c-mid-y);
            mxy=min(mxy,s[i]-d[i]-c+mid-x);
        }
        int tmp=0,j=n,ch=0;
        for (int i=0;i<n;i++){
            long long l=max(mnx-s[i],s[i]-mxy);
            if (mnx-s[i]<s[i]-mxy&&!tmp){
                j=0;
                tmp=1;
            }
            if (tmp)
                while (j<n&&s[j]<l)
                    j++;
            else{
                while (j>=0&&s[j]>=l)
                    j--;
                j++;
            }
            if (j<n&&s[j]<=min(mxx-s[i],s[i]-mny)){
                ch=1;
                break;
            }
        }
        if (ch){
            kq=mid;
            hi=mid-1;
        }
        else
            lo=mid+1;
    }
    return kq;
}

• 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