제출 #1326751

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1326751		settop	Shortcut (IOI16_shortcut)	C++20	71 / 100	2094 ms	1336 KiB

shortcut

#include "shortcut.h"
#include<bits/stdc++.h>

using namespace std;
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

#define ll long long
#define fall(i,a,b) for(int i=a;i<=b;i++)
#define rfall(i,a,b) for(int i=a;i>=b;i--)
#define pb push_back
#define all(x) x.begin(),x.end()
#define sz(x) (int)x.size()
#define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
const ll inf=1e16;
typedef pair<ll,ll> pii;

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

    auto test=[&](ll k){
        ll mxs=1e16,mns=0,mxt=1e16,mnt=0;
        fall(j,0,n-1)
            fall(i,j+1,n-1){
                if(l[i]-l[j]+d[i]+d[j]<=k) continue;
                mxs=min(mxs,k+l[i]+l[j]-d[i]-d[j]-c);
                mxt=min(mxt,k+l[i]-l[j]-d[i]-d[j]-c);
                mnt=max(mnt,l[i]-l[j]+d[i]+d[j]-k+c);
                mns=max(mns,l[i]+l[j]+d[i]+d[j]-k+c);
            }
        
        fall(i,0,n-1){
            int ini=i,fim=n-1;
            while(ini<=fim){
                int mei=(ini+fim)/2;
                if(l[mei]+l[i]<=mxs && l[mei]-l[i]<=mxt && l[mei]-l[i]>=mnt && l[mei]+l[i]>=mns) return true;
                else if(l[mei]+l[i]>mxs || l[mei]-l[i]>mxt) fim=mei-1;
                else ini=mei+1;
            }
        }
        return false;
    };

    ll ini=1,fim=1e16,ans=0;

    while(ini<=fim){
        ll mei=(ini+fim)/2;
        if(test(mei)) ans=mei,fim=mei-1;
        else ini=mei+1;
    }
    return ans;
}

컴파일 시 표준 에러 (stderr) 메시지

shortcut.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
shortcut_c.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~

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