oj.uz

답안 #1023401

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1023401 2024-07-14T17:44:51 Z vjudge1 Shortcut (IOI16_shortcut) C++17
0 / 100
 1 ms 348 KB 
#include "shortcut.h"
#include <bits/stdc++.h>

#define ll long long
// #define int ll
#define pii pair<int,int>
#define F first
#define S second
#define sz(s) (int)s.size()
#define in insert
#define pb push_back
#define all(v) v.begin(),v.end()
#define mem(a,i) memset(a,i,sizeof(a))
#define lb lower_bound

using namespace std;

const int MAX=2e5+10;
const ll inf=1e18;

int n,c;
vector<ll> p;
pair<ll,ll> a[MAX],b[MAX];
vector<int> d;

bool check(ll L){
    ll sum[2][2]={{-inf,inf},{-inf,inf}};
    // ll sum1[2][2]={{-inf,inf},{-inf,inf}};
    // for(int i=0;i<n;i++){
    //     for(int j=0;j<n;j++){
    //         if(i==j)continue;
    //         if(p[j]-p[i]+d[i]+d[j]<=L)continue;
    //         sum1[0][0]=max(sum1[0][0],p[i]+p[j]+d[i]+d[j]-L+c);
    //         sum1[1][1]=min(sum1[1][1],p[i]-d[i]+p[j]-d[j]+L-c);
    //         sum1[1][0]=max(sum1[1][0],p[j]+d[j]-p[i]+d[i]-L+c);
    //         sum1[0][1]=min(sum1[0][1],p[j]-d[j]-p[i]-d[i]+L-c);
    //     }
    // }
    {
        int r=-1;
        pair<ll,ll> mx={-inf,-inf},mx1={-inf,-inf};
        for(int i=0;i<n;i++){
            while(r+1<n&&b[r+1].F<a[i].F-L){
                pair<ll,ll> bf={a[b[r+1].S].F,b[r+1].S};
                if(mx<bf){
                    mx1=mx;
                    mx=bf;
                }
                else if(mx1<bf){
                    mx1=bf;
                }
                r++;
            }
            if(i!=mx.S)sum[0][0]=max(sum[0][0],mx.F+a[i].F+c-L);
            else sum[0][0]=max(sum[0][0],mx1.F+a[i].F+c-L);
        }
    }
    {
        int r=-1;
        pair<ll,ll> mn={inf,inf},mn1={inf,inf};
        for(int i=0;i<n;i++){
            while(r+1<n&&b[r+1].F<a[i].F-L){
                pair<ll,ll> bf={-a[b[r+1].S].F,b[r+1].S};
                if(mn>bf){
                    mn1=mn;
                    mn=bf;
                }
                else if(mn1>bf){
                    mn1=bf;
                }
                r++;
            }
            if(i!=mn.S)sum[0][1]=min(sum[0][1],L-c+a[i].S+mn.F);
            else sum[0][1]=min(sum[0][1],L-c+a[i].S+mn1.F);
        }       
    }
    {
        int r=-1;
        pair<ll,ll> mn={inf,inf},mn1={inf,inf};
        for(int i=0;i<n;i++){
            while(r+1<n&&b[r+1].F<a[i].F-L){
                pair<ll,ll> bf={b[r+1]};
                if(bf<mn){
                    mn1=mn;
                    mn=bf;
                }
                else if(bf<mn1){
                    mn1=bf;
                }
                r++;
            }
            if(mn.S!=i)sum[1][1]=min(sum[1][1],mn.F+a[i].S+L-c);
            if(mn1.S!=i)sum[1][1]=min(sum[1][1],mn1.F+a[i].S+L-c);
        }
    }
    {
        int r=-1;
        pair<ll,ll> mx={-inf,-inf},mx1={-inf,-inf};
        for(int i=0;i<n;i++){
            while(r+1<n&&b[r+1].F<a[i].F-L){
                pair<ll,ll> bf={-b[r+1].F,b[r+1].S};
                if(bf>mx){
                    mx1=mx;
                    mx=bf;
                }
                else if(bf>mx1){
                    mx1=bf;
                }
                r++;
            }
            if(i!=mx.S)sum[1][0]=max(sum[1][0],a[i].F+mx.F+c-L);
            else sum[1][0]=max(sum[1][0],a[i].F+mx1.F+c-L);
        }
    }
    for(int i=0;i<n;i++){
        int l=max(sum[0][0]-p[i],p[i]-sum[0][1]),r=min(sum[1][1]-p[i],p[i]-sum[1][0]);
        int pos=lb(all(p),l)-p.begin();
        if(pos<sz(p)&&p[pos]<=r)return 1;
    }
    return 0;
}

long long find_shortcut(int N, vector<int> G, vector<int> D, int C){
    n=N;
    c=C;
    d=D;
    p.pb(0);
    for(int i=1;i<n;i++)p.pb(p.back()+G[i-1]);
    for(int i=0;i<n;i++){
        // cout<<p[i]+d[i]<<"\n";
        a[i]={p[i]+d[i],p[i]-d[i]};
    }
    sort(a,a+n);
    for(int i=0;i<n;i++){
        b[i]={a[i].S,i};
    }
    sort(b,b+n);
    ll l=0,r=a[n-1].F-b[0].F-1,res=a[n-1].F-b[0].F;
    while(l<=r){
        ll m=(l+r)/2;
        if(check(m)){
            r=m-1;
            res=m;
        }
        else{
            l=m+1;
        }
    }
    return res;
}

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB n = 4, 80 is a correct answer
2 Correct 0 ms 348 KB n = 9, 110 is a correct answer
3 Correct 0 ms 348 KB n = 4, 21 is a correct answer
4 Correct 0 ms 348 KB n = 3, 4 is a correct answer
5 Correct 0 ms 348 KB n = 2, 62 is a correct answer
6 Correct 1 ms 348 KB n = 2, 3 is a correct answer
7 Incorrect 0 ms 348 KB n = 3, incorrect answer: jury 29 vs contestant 38
8 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB n = 4, 80 is a correct answer
2 Correct 0 ms 348 KB n = 9, 110 is a correct answer
3 Correct 0 ms 348 KB n = 4, 21 is a correct answer
4 Correct 0 ms 348 KB n = 3, 4 is a correct answer
5 Correct 0 ms 348 KB n = 2, 62 is a correct answer
6 Correct 1 ms 348 KB n = 2, 3 is a correct answer
7 Incorrect 0 ms 348 KB n = 3, incorrect answer: jury 29 vs contestant 38
8 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB n = 4, 80 is a correct answer
2 Correct 0 ms 348 KB n = 9, 110 is a correct answer
3 Correct 0 ms 348 KB n = 4, 21 is a correct answer
4 Correct 0 ms 348 KB n = 3, 4 is a correct answer
5 Correct 0 ms 348 KB n = 2, 62 is a correct answer
6 Correct 1 ms 348 KB n = 2, 3 is a correct answer
7 Incorrect 0 ms 348 KB n = 3, incorrect answer: jury 29 vs contestant 38
8 Halted 0 ms 0 KB -

Subtask #4
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB n = 4, 80 is a correct answer
2 Correct 0 ms 348 KB n = 9, 110 is a correct answer
3 Correct 0 ms 348 KB n = 4, 21 is a correct answer
4 Correct 0 ms 348 KB n = 3, 4 is a correct answer
5 Correct 0 ms 348 KB n = 2, 62 is a correct answer
6 Correct 1 ms 348 KB n = 2, 3 is a correct answer
7 Incorrect 0 ms 348 KB n = 3, incorrect answer: jury 29 vs contestant 38
8 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB n = 4, 80 is a correct answer
2 Correct 0 ms 348 KB n = 9, 110 is a correct answer
3 Correct 0 ms 348 KB n = 4, 21 is a correct answer
4 Correct 0 ms 348 KB n = 3, 4 is a correct answer
5 Correct 0 ms 348 KB n = 2, 62 is a correct answer
6 Correct 1 ms 348 KB n = 2, 3 is a correct answer
7 Incorrect 0 ms 348 KB n = 3, incorrect answer: jury 29 vs contestant 38
8 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB n = 4, 80 is a correct answer
2 Correct 0 ms 348 KB n = 9, 110 is a correct answer
3 Correct 0 ms 348 KB n = 4, 21 is a correct answer
4 Correct 0 ms 348 KB n = 3, 4 is a correct answer
5 Correct 0 ms 348 KB n = 2, 62 is a correct answer
6 Correct 1 ms 348 KB n = 2, 3 is a correct answer
7 Incorrect 0 ms 348 KB n = 3, incorrect answer: jury 29 vs contestant 38
8 Halted 0 ms 0 KB -

Subtask #7
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB n = 4, 80 is a correct answer
2 Correct 0 ms 348 KB n = 9, 110 is a correct answer
3 Correct 0 ms 348 KB n = 4, 21 is a correct answer
4 Correct 0 ms 348 KB n = 3, 4 is a correct answer
5 Correct 0 ms 348 KB n = 2, 62 is a correct answer
6 Correct 1 ms 348 KB n = 2, 3 is a correct answer
7 Incorrect 0 ms 348 KB n = 3, incorrect answer: jury 29 vs contestant 38
8 Halted 0 ms 0 KB -

Subtask #8
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB n = 4, 80 is a correct answer
2 Correct 0 ms 348 KB n = 9, 110 is a correct answer
3 Correct 0 ms 348 KB n = 4, 21 is a correct answer
4 Correct 0 ms 348 KB n = 3, 4 is a correct answer
5 Correct 0 ms 348 KB n = 2, 62 is a correct answer
6 Correct 1 ms 348 KB n = 2, 3 is a correct answer
7 Incorrect 0 ms 348 KB n = 3, incorrect answer: jury 29 vs contestant 38
8 Halted 0 ms 0 KB -