제출 #1164301

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1164301		KhoaDuy	Growing Vegetables is Fun 5 (JOI24_vegetables5)	C++17	37 / 100	3086 ms	5132 KiB

Main

#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
bool solve(int n,int a[],int b[],int c[],int x){
    int MaxL=0,MinR=n;
    for(int i=0;i<n;i++){
        int l,r;
        int low=i,high=n-1;
        low--,high++;
        while(high-low>1){
            int mid=((high-low)>>1)+low;
            if(a[mid]-b[i]>=-x){
                high=mid;
            }
            else{
                low=mid;
            }
        }
        l=high;
        low=i,high=n-1;
        low--,high++;
        while(high-low>1){
            int mid=((high-low)>>1)+low;
            if(a[mid]-b[i]<=x){
                low=mid;
            }
            else{
                high=mid;
            }
        }
        r=low;
        l-=i,r-=i;
        if(r==n-1-i&&abs(a[2*n-i-1]-b[i])<=x){
            r=n;
        }
        MaxL=max(MaxL,l),MinR=min(MinR,r);
    }
    for(int i=0;i<n;i++){
        int l,r;
        int low=2*n-1-i,high=2*n-1;
        low--,high++;
        while(high-low>1){
            int mid=((high-low)>>1)+low;
            if(a[mid]-c[i]<=x){
                high=mid;
            }
            else{
                low=mid;
            }
        }
        l=high;
        low=2*n-1-i,high=2*n-1;
        low--,high++;
        while(high-low>1){
            int mid=((high-low)>>1)+low;
            if(a[mid]-c[i]<-x){
                high=mid;
            }
            else{
                low=mid;
            }
        }
        r=low;
        l-=(2*n-1-i),r-=(2*n-1-i);
        if(r==2*n-1-(2*n-1-i)&&abs(c[i]-a[i])<=x){
            r=n;
        }
        MaxL=max(MaxL,l),MinR=min(MinR,r);
    }
    if(MaxL<=MinR){
        return true;
    }
    return false;
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n;
    cin >> n;
    int a[2*n],b[n],c[n];
    for(int i=0;i<2*n;i++){
        cin >> a[i];
    }
    for(int i=0;i<n;i++){
        cin >> b[i];
    }
    for(int i=0;i<n;i++){
        cin >> c[i];
    }
    sort(b,b+n);
    sort(c,c+n);
    int low=0,high=1e9;
    low--,high++;
    while(high-low>1){
        int mid=((high-low)>>1)+low;
        if(solve(n,a,b,c,mid)||solve(n,a,c,b,mid)){
            high=mid;
        }
        else{
            low=mid;
        }
    }
    cout << high;
}

• Subtask 1: 0 / 4
• Subtask 2: 0 / 5
• Subtask 3: 0 / 21
• Subtask 4: 37 / 37
• Subtask 5: 0 / 33