oj.uz

Submission #1075089

# Submission time Handle Problem Language Result Execution time Memory
1075089 2024-08-25T18:13:36 Z amirhoseinfar1385 Shortcut (IOI16_shortcut) C++17
0 / 100
 9 ms 2012 KB 
#include "shortcut.h"
#include<bits/stdc++.h>
using namespace std;
const long long maxn=100000+10,lg=17,kaf=(1<<lg);
long long inf=1e16,n,c;
long long all[maxn],alld[maxn],ps[maxn],l1,l2,r1,r2;
 
struct segmentmn{
    long long seg[maxn];
    segmentmn(){
        for(int i=0;i<maxn;i++){
            seg[i]=inf;
        }
    }
    void clear(){
        for(int i=0;i<maxn;i++){
            seg[i]=inf;
        }
    }
    void upd(int i,long long w){
        i++;
        while(i<maxn){
            seg[i]=min(seg[i],w);
            i+=((-i)&i);
        }
    }
    long long pors(int i){
       long long ret=inf;
       i++;
       while(i>0){
            ret=min(ret,seg[i]);
            i-=((-i)&i);
       }
       return ret;
    }
}segmn;
 
struct segmentmx{
    long long seg[maxn];
    segmentmx(){
        for(int i=0;i<maxn;i++){
            seg[i]=-inf;
        }
    }
    void clear(){
        for(int i=0;i<maxn;i++){
            seg[i]=-inf;
        }
    }
    void upd(int i,long long w){
        i++;
        while(i<maxn){
            seg[i]=max(seg[i],w);
            i+=((-i)&i);
        }
    }
    long long pors(int i){
       long long ret=-inf;
       i++;
       while(i>0){
            ret=max(ret,seg[i]);
            i-=((-i)&i);
       }
       return ret;
    }
}segmx;
 
void addr(long long x1,long long y1,long long x2,long long y2){
    long long fx=x1+y1;
    long long fy=x1-y1;
    x1=fx;
    y1=fy;
    fx=x2+y2;
    fy=x2-y2;
    x2=fx;
    y2=fy;
    l1=max(l1,x1);
    l2=min(l2,x2);
    r1=max(r1,y2);
    r2=min(r2,y1);
}
 
bool dakh(long long x,long long y){
    long long fx=x+y;
    long long fy=x-y;
    x=fx;
    y=fy;
    if(x>=l1&&x<=l2&&y>=r1&&y<=r2){
        return 1;
    }
    return 0;
}
 
bool check(long long mid){
    l1=r1=-inf;
    l2=r2=inf;
    segmx.clear();
    segmn.clear();
    vector<pair<long long,long long>>allv;
    for(int i=1;i<=n;i++){
        allv.push_back(make_pair(-ps[i]+alld[i],-i));
        allv.push_back(make_pair(mid-ps[i]-alld[i],i));
    }
    sort(allv.begin(),allv.end());
    while((int)allv.size()>0){
        auto x=allv.back();
        allv.pop_back();
        if(x.second<0){
            segmx.upd(-x.second,alld[-x.second]+ps[-x.second]);
            segmn.upd(-x.second,-alld[-x.second]+ps[-x.second]);
        }
        else{
            addr(ps[x.second],-mid+c+alld[x.second]+segmx.pors(x.second),ps[x.second],mid-c-alld[x.second]+segmn.pors(x.second));
        }
    }
    vector<long long>vl;
    for(long long i=1;i<=n;i++){
        vl.push_back(ps[i]);
        long long l=0,r=ps[n];
        l=max(l,l1-ps[i]);
        r=min(r,l2-ps[i]);
        l=max(l,-r2+ps[i]);
        r=min(r,-r1+ps[i]);
        if(r>=l){
            if(vl.back()>=l){
                int p=lower_bound(vl.begin(),vl.end(),l)-vl.begin();
                if(vl[p]<=r){
                    return 1;
                }
            }
        }
    }
    return 0;
}
 
long long find_shortcut(int n_, std::vector<int> l, std::vector<int> d,int c_)
{
    n=n_;
    c=c_;
    alld[1]=d[0];
    for(long long i=2;i<=n;i++){
        all[i]=l[i-2];
        ps[i]=all[i]+ps[i-1];
        alld[i]=d[i-1];
    }
    long long low=-1,high=inf,mid;
    while(high-low>1){
        mid=(high+low)>>1;
        if(check(mid)){
            high=mid;
        }else{
            low=mid;
        }
    }
    return high;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 2012 KB n = 4, 80 is a correct answer
2 Correct 9 ms 1884 KB n = 9, 110 is a correct answer
3 Correct 5 ms 1884 KB n = 4, 21 is a correct answer
4 Correct 5 ms 1880 KB n = 3, 4 is a correct answer
5 Incorrect 7 ms 1884 KB n = 2, incorrect answer: jury 62 vs contestant 72
6 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 2012 KB n = 4, 80 is a correct answer
2 Correct 9 ms 1884 KB n = 9, 110 is a correct answer
3 Correct 5 ms 1884 KB n = 4, 21 is a correct answer
4 Correct 5 ms 1880 KB n = 3, 4 is a correct answer
5 Incorrect 7 ms 1884 KB n = 2, incorrect answer: jury 62 vs contestant 72
6 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 2012 KB n = 4, 80 is a correct answer
2 Correct 9 ms 1884 KB n = 9, 110 is a correct answer
3 Correct 5 ms 1884 KB n = 4, 21 is a correct answer
4 Correct 5 ms 1880 KB n = 3, 4 is a correct answer
5 Incorrect 7 ms 1884 KB n = 2, incorrect answer: jury 62 vs contestant 72
6 Halted 0 ms 0 KB -

Subtask #4
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 2012 KB n = 4, 80 is a correct answer
2 Correct 9 ms 1884 KB n = 9, 110 is a correct answer
3 Correct 5 ms 1884 KB n = 4, 21 is a correct answer
4 Correct 5 ms 1880 KB n = 3, 4 is a correct answer
5 Incorrect 7 ms 1884 KB n = 2, incorrect answer: jury 62 vs contestant 72
6 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 2012 KB n = 4, 80 is a correct answer
2 Correct 9 ms 1884 KB n = 9, 110 is a correct answer
3 Correct 5 ms 1884 KB n = 4, 21 is a correct answer
4 Correct 5 ms 1880 KB n = 3, 4 is a correct answer
5 Incorrect 7 ms 1884 KB n = 2, incorrect answer: jury 62 vs contestant 72
6 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 2012 KB n = 4, 80 is a correct answer
2 Correct 9 ms 1884 KB n = 9, 110 is a correct answer
3 Correct 5 ms 1884 KB n = 4, 21 is a correct answer
4 Correct 5 ms 1880 KB n = 3, 4 is a correct answer
5 Incorrect 7 ms 1884 KB n = 2, incorrect answer: jury 62 vs contestant 72
6 Halted 0 ms 0 KB -

Subtask #7
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 2012 KB n = 4, 80 is a correct answer
2 Correct 9 ms 1884 KB n = 9, 110 is a correct answer
3 Correct 5 ms 1884 KB n = 4, 21 is a correct answer
4 Correct 5 ms 1880 KB n = 3, 4 is a correct answer
5 Incorrect 7 ms 1884 KB n = 2, incorrect answer: jury 62 vs contestant 72
6 Halted 0 ms 0 KB -

Subtask #8
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 2012 KB n = 4, 80 is a correct answer
2 Correct 9 ms 1884 KB n = 9, 110 is a correct answer
3 Correct 5 ms 1884 KB n = 4, 21 is a correct answer
4 Correct 5 ms 1880 KB n = 3, 4 is a correct answer
5 Incorrect 7 ms 1884 KB n = 2, incorrect answer: jury 62 vs contestant 72
6 Halted 0 ms 0 KB -