제출 #900949

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
900949		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=1e18;
long long s[1000001];
long long find_shortcut(int n, vector <int> l, vector <int> d, int c){
    long long lo=0,hi=INF,kq=-1;
    for (int i=1;i<n;i++)
        s[i]=s[i-1]+l[i-1];
    while (lo<=hi){
        long long mid=(lo+hi)>>1,ch=0,mnx=-INF,mxx=INF,mny=-INF,mxy=INF;
        for (int i=0;i<n;i++)
            for (int j=i;j<n;j++)
                if (s[j]-s[i]+d[i]+d[j]>mid){
                    long long sz=mid-d[i]-d[j]-c;
                    ch=1;
                    long long a=s[i],b=s[j]-sz,c=s[i],d=s[j]+sz;
                    a=a+b;
                    b=a-b*2;
                    c=c+d;
                    d=c-d*2;
                    mnx=max(mnx,a);
                    mxx=min(mxx,c);
                    mny=max(mny,d);
                    mxy=min(mxy,b);
                }
        if (ch){
            for (int i=0;i<n;i++)
                for (int j=i;j<n;j++)
                    if (s[j]-s[i]+d[i]+d[j]>mid){
                        long long x=s[i]+s[j],y=s[i]-s[j];
                        if (mnx<=x&&x<=mxx&&mny<=y&&y<=mxy)
                            ch=0;
                    }
        }
        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