Submission #738811

#	Time	Username	Problem	Language	Result	Execution time	Memory
738811		lohacho	Shortcut (IOI16_shortcut)	C++14	0 / 100	1 ms	296 KiB

shortcut

#include "shortcut.h"
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;

long long find_shortcut(int n, std::vector<int> l, std::vector<int> d, int c)
{
    vector<long long> pre(n);
    for(int i = 1; i < n; ++i){
        pre[i] = pre[i - 1] + l[i - 1];
    }

    long long low = 0, high = (long long)1e18, mid;
    int d1 = 0, d2 = 0;
    for(int i = 0; i < n; ++i){
        if(d[i] > d1){
            d2 = d1;
            d1 = d[i];
        }
        else if(d[i] > d2){
            d2 = d[i];
        }
    }
    low = d1 + d2;

    vector<pair<long long, int>> srtp(n), srtm(n);
    for(int i = 0; i < n; ++i){
        srtp[i] = {d[i] + pre[i], i};
        srtm[i] = {pre[i] - d[i], i};
    }
    sort(srtp.begin(), srtp.end());
    sort(srtm.begin(), srtm.end());

    while(low < high){
        mid = low + high >> 1;
        long long xmx = (long long)1e18, ymx = (long long)1e18;
        long long xmn = -(long long)1e18, ymn = -(long long)1e18;

        long long ppd = -(long long)1e18, pmd = (long long)1e18;
        for(int i = n - 1, j = n; i >= 0; --i){
            int nid = srtm[i].second;
            while(j && srtp[j - 1].first > srtm[i].first + mid){
                --j;
                ppd = max(ppd, srtp[j].first);
                pmd = min(pmd, pre[srtp[j].second] - d[srtp[j].second]);
            }
            xmn = max(xmn, pre[nid] + d[nid] - pmd - mid + c);
            xmx = min(xmx, pre[nid] - d[nid] - ppd + mid - c);
            ymn = max(ymn, pre[nid] + d[nid] + ppd - mid + c);
            ymx = min(ymx, pre[nid] - d[nid] + pmd + mid - c);
        }
        int f = 0;
        for(int i = 0, j1 = 1, j2 = n - 1; i < n; ++i){
            while(j1 < n && (pre[i] - pre[j1] > xmx || i == j1)) ++j1;
            while(j2 && (pre[i] + pre[j2 - 1] >= ymn)) --j2;
            int j = max(j1, j2);
            if(j < n && pre[i] - pre[j] >= xmn && pre[i] + pre[j] <= ymx){
                f = 1;

                break;
            }
        }

        if(f){
            high = mid;
        }
        else{
            low = mid + 1;
        }
    }

    return low;
}

Compilation message (stderr)

shortcut.cpp: In function 'long long int find_shortcut(int, std::vector<int>, std::vector<int>, int)':
shortcut.cpp:37:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   37 |         mid = low + high >> 1;
      |               ~~~~^~~~~~

• 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