oj.uz

Submission #1113148

# Submission time Handle Problem Language Result Execution time Memory
1113148 2024-11-15T22:35:33 Z ttamx Growing Vegetables is Fun 5 (JOI24_vegetables5) C++17
30 / 100
 5000 ms 58428 KB 
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops")

using namespace std;

const int N=3e5+5;
const int INF=INT_MAX/2;

int n;
int a[3*N],b[N],c[N],pos[3*N];
bool lo[3*N],d1[3*N],d2[3*N];

struct Info{
    int sum,pre,suf,mx;
    static Info unit(){
        return {0,-INF,-INF,-INF};
    }
    friend Info operator+(const Info &l,const Info &r){
        return {l.sum+r.sum,max(l.pre,l.sum+r.pre),max(r.suf,r.sum+l.suf),max({l.mx,r.mx,l.suf+r.pre})};
    }
};

struct Deque{
    using P = pair<Info,int>;
    deque<P> dq;
    vector<Info> l,r;
    void rebalance(bool left){
        int s=dq.size();
        int m=(s+left)/2;
        l.clear(),r.clear();
        {
            Info sum=Info::unit();
            for(int i=m-1;i>=0;i--){
                sum=dq[i].first+sum;
                l.emplace_back(sum);
            }
        }
        {
            Info sum=Info::unit();
            for(int i=m;i<s;i++){
                sum=sum+dq[i].first;
                r.emplace_back(sum);
            }
        }
    }
    bool empty(){return dq.empty();}
    int size(){return dq.size();};
    P front(){return dq.front();}
    P back(){return dq.back();}
    void push_front(Info x,int v){
        dq.emplace_front(x,v);
        if(l.empty())l.emplace_back(x);
        else l.emplace_back(x+l.back());
    }
    void push_back(Info x,int v){
        dq.emplace_back(x,v);
        if(r.empty())r.emplace_back(x);
        else r.emplace_back(r.back()+x);
    }
    void push_front(P x){push_front(x.first,x.second);}
    void push_back(P x){push_back(x.first,x.second);}
    void pop_front(){
        assert(!dq.empty());
        if(l.empty())rebalance(true);
        dq.pop_front();
        l.pop_back();
    }
    void pop_back(){
        assert(!dq.empty());
        if(r.empty())rebalance(false);
        dq.pop_back();
        r.pop_back();
    }
    Info query(){
        if(dq.empty())return Info::unit();
        if(l.empty())return r.back();
        if(r.empty())return l.back();
        return l.back()+r.back();
    }
};

bool check(int k){
    {
        int st=0,ed=0;
        Deque q1,q2,q3;
        auto work=[&](int i){
            if(lo[i]){
                while(!q1.empty()&&q1.back().second>=pos[i]){
                    q2.push_front(q1.back());
                    q1.pop_back();
                }
                while(!q2.empty()&&q2.front().second<pos[i]){
                    q1.push_back(q2.front());
                    q2.pop_front();
                }
                while(!q3.empty()&&q3.front().second<pos[i]){
                    q1.push_back(q3.front());
                    q3.pop_front();
                }
            }else{
                while(!q3.empty()&&q3.front().second<=pos[i]){
                    q2.push_back(q3.front());
                    q3.pop_front();
                }
                while(!q2.empty()&&q2.back().second>pos[i]){
                    q3.push_front(q2.back());
                    q2.pop_back();
                }
                while(!q1.empty()&&q1.back().second>pos[i]){
                    q3.push_front(q1.back());
                    q1.pop_back();
                }
            }
        };
        for(int i=0;i<3*n;i++){
            while(st<n&&b[st]<a[i]-k)st++;
            while(st>0&&b[st-1]>=a[i]-k)st--;
            while(ed<n&&b[ed]<=a[i]+k)ed++;
            while(ed>0&&b[ed-1]>a[i]+k)ed--;
            work(i);
            Info cur{1,1-ed,1+st,1+st-ed};
            if(lo[i])q2.push_front(cur,pos[i]);
            else q2.push_back(cur,pos[i]);
            if(i>=n){
                work(i-n);
                if(lo[i-n])q2.pop_front();
                else q2.pop_back();
                d1[i]=(q1.query()+q2.query()+q3.query()).mx<=0;
            }
        }
    }
    {
        int st=0,ed=0;
        Deque q1,q2,q3;
        auto work=[&](int i){
            if(lo[i]){
                while(!q1.empty()&&q1.back().second>=pos[i]){
                    q2.push_front(q1.back());
                    q1.pop_back();
                }
                while(!q2.empty()&&q2.front().second<pos[i]){
                    q1.push_back(q2.front());
                    q2.pop_front();
                }
                while(!q3.empty()&&q3.front().second<pos[i]){
                    q1.push_back(q3.front());
                    q3.pop_front();
                }
            }else{
                while(!q3.empty()&&q3.front().second<=pos[i]){
                    q2.push_back(q3.front());
                    q3.pop_front();
                }
                while(!q2.empty()&&q2.back().second>pos[i]){
                    q3.push_front(q2.back());
                    q2.pop_back();
                }
                while(!q1.empty()&&q1.back().second>pos[i]){
                    q3.push_front(q1.back());
                    q1.pop_back();
                }
            }
        };
        for(int i=0;i<3*n;i++){
            while(st<n&&c[st]<a[i]-k)st++;
            while(st>0&&c[st-1]>=a[i]-k)st--;
            while(ed<n&&c[ed]<=a[i]+k)ed++;
            while(ed>0&&c[ed-1]>a[i]+k)ed--;
            work(i);
            Info cur{1,1-ed,1+st,1+st-ed};
            if(lo[i])q2.push_front(cur,pos[i]);
            else q2.push_back(cur,pos[i]);
            if(i>=n){
                work(i-n);
                if(lo[i-n])q2.pop_front();
                else q2.pop_back();
                d2[i]=(q1.query()+q2.query()+q3.query()).mx<=0;
            }
        }
    }
    for(int i=n;i<2*n;i++){
        if((d1[i]&&d2[i+n])||(d2[i]&&d1[i+n])){
            return true;
        }
    }
    return false;
}

int main(){
    cin >> n;
    vector<pair<int,int>> vals;
    for(int i=0;i<2*n;i++){
        cin >> a[i];
        vals.emplace_back(a[i],i>n?~i:i);
    }
    sort(vals.begin(),vals.end());
    for(int i=0;i<2*n;i++){
        int j=vals[i].second;
        pos[j<0?~j:j]=i;
    }
    for(int i=2*n;i<3*n;i++){
        a[i]=a[i-2*n];
        pos[i]=pos[i-2*n];
    }
    for(int i=0;i<2*n;i++){
        lo[i]=pos[i]<pos[i+n];
    }
    for(int i=2*n;i<3*n;i++){
        lo[i]=lo[i-2*n];
    }
    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 l=0,r=1'000'000'000;
    while(l<r){
        int m=(l+r)/2;
        if(check(m))r=m;
        else l=m+1;
    }
    cout << l << "\n";
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 10576 KB Output is correct
2 Correct 2 ms 10588 KB Output is correct
3 Correct 2 ms 10688 KB Output is correct
4 Correct 1 ms 10576 KB Output is correct
5 Correct 1 ms 10576 KB Output is correct
6 Correct 2 ms 10576 KB Output is correct
7 Correct 2 ms 10576 KB Output is correct
8 Correct 2 ms 10576 KB Output is correct
9 Correct 2 ms 10576 KB Output is correct
10 Correct 1 ms 10576 KB Output is correct
11 Correct 2 ms 10576 KB Output is correct
12 Correct 1 ms 10576 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 10576 KB Output is correct
2 Correct 2 ms 10588 KB Output is correct
3 Correct 2 ms 10688 KB Output is correct
4 Correct 1 ms 10576 KB Output is correct
5 Correct 1 ms 10576 KB Output is correct
6 Correct 2 ms 10576 KB Output is correct
7 Correct 2 ms 10576 KB Output is correct
8 Correct 2 ms 10576 KB Output is correct
9 Correct 2 ms 10576 KB Output is correct
10 Correct 1 ms 10576 KB Output is correct
11 Correct 2 ms 10576 KB Output is correct
12 Correct 1 ms 10576 KB Output is correct
13 Correct 2 ms 10576 KB Output is correct
14 Correct 2 ms 10576 KB Output is correct
15 Correct 2 ms 10576 KB Output is correct
16 Correct 2 ms 10576 KB Output is correct
17 Correct 2 ms 8528 KB Output is correct
18 Correct 2 ms 8528 KB Output is correct
19 Correct 2 ms 8528 KB Output is correct
20 Correct 1 ms 6480 KB Output is correct
21 Correct 2 ms 8528 KB Output is correct
22 Correct 1 ms 2384 KB Output is correct
23 Correct 1 ms 4604 KB Output is correct
24 Correct 2 ms 10576 KB Output is correct
25 Correct 2 ms 8528 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 10576 KB Output is correct
2 Correct 2 ms 10588 KB Output is correct
3 Correct 2 ms 10688 KB Output is correct
4 Correct 1 ms 10576 KB Output is correct
5 Correct 1 ms 10576 KB Output is correct
6 Correct 2 ms 10576 KB Output is correct
7 Correct 2 ms 10576 KB Output is correct
8 Correct 2 ms 10576 KB Output is correct
9 Correct 2 ms 10576 KB Output is correct
10 Correct 1 ms 10576 KB Output is correct
11 Correct 2 ms 10576 KB Output is correct
12 Correct 1 ms 10576 KB Output is correct
13 Correct 2 ms 10576 KB Output is correct
14 Correct 2 ms 10576 KB Output is correct
15 Correct 2 ms 10576 KB Output is correct
16 Correct 2 ms 10576 KB Output is correct
17 Correct 2 ms 8528 KB Output is correct
18 Correct 2 ms 8528 KB Output is correct
19 Correct 2 ms 8528 KB Output is correct
20 Correct 1 ms 6480 KB Output is correct
21 Correct 2 ms 8528 KB Output is correct
22 Correct 1 ms 2384 KB Output is correct
23 Correct 1 ms 4604 KB Output is correct
24 Correct 2 ms 10576 KB Output is correct
25 Correct 2 ms 8528 KB Output is correct
26 Correct 26 ms 10940 KB Output is correct
27 Correct 28 ms 10932 KB Output is correct
28 Correct 22 ms 10932 KB Output is correct
29 Correct 3 ms 10576 KB Output is correct
30 Correct 30 ms 10932 KB Output is correct
31 Correct 29 ms 10952 KB Output is correct
32 Correct 13 ms 10832 KB Output is correct
33 Correct 7 ms 10748 KB Output is correct
34 Correct 24 ms 8784 KB Output is correct
35 Correct 23 ms 8920 KB Output is correct
36 Correct 28 ms 6736 KB Output is correct
37 Correct 22 ms 10980 KB Output is correct
38 Correct 24 ms 2852 KB Output is correct
39 Correct 22 ms 2640 KB Output is correct
40 Correct 23 ms 4848 KB Output is correct

Subtask #4
0 / 37.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5063 ms 58428 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 10576 KB Output is correct
2 Correct 2 ms 10588 KB Output is correct
3 Correct 2 ms 10688 KB Output is correct
4 Correct 1 ms 10576 KB Output is correct
5 Correct 1 ms 10576 KB Output is correct
6 Correct 2 ms 10576 KB Output is correct
7 Correct 2 ms 10576 KB Output is correct
8 Correct 2 ms 10576 KB Output is correct
9 Correct 2 ms 10576 KB Output is correct
10 Correct 1 ms 10576 KB Output is correct
11 Correct 2 ms 10576 KB Output is correct
12 Correct 1 ms 10576 KB Output is correct
13 Correct 2 ms 10576 KB Output is correct
14 Correct 2 ms 10576 KB Output is correct
15 Correct 2 ms 10576 KB Output is correct
16 Correct 2 ms 10576 KB Output is correct
17 Correct 2 ms 8528 KB Output is correct
18 Correct 2 ms 8528 KB Output is correct
19 Correct 2 ms 8528 KB Output is correct
20 Correct 1 ms 6480 KB Output is correct
21 Correct 2 ms 8528 KB Output is correct
22 Correct 1 ms 2384 KB Output is correct
23 Correct 1 ms 4604 KB Output is correct
24 Correct 2 ms 10576 KB Output is correct
25 Correct 2 ms 8528 KB Output is correct
26 Correct 26 ms 10940 KB Output is correct
27 Correct 28 ms 10932 KB Output is correct
28 Correct 22 ms 10932 KB Output is correct
29 Correct 3 ms 10576 KB Output is correct
30 Correct 30 ms 10932 KB Output is correct
31 Correct 29 ms 10952 KB Output is correct
32 Correct 13 ms 10832 KB Output is correct
33 Correct 7 ms 10748 KB Output is correct
34 Correct 24 ms 8784 KB Output is correct
35 Correct 23 ms 8920 KB Output is correct
36 Correct 28 ms 6736 KB Output is correct
37 Correct 22 ms 10980 KB Output is correct
38 Correct 24 ms 2852 KB Output is correct
39 Correct 22 ms 2640 KB Output is correct
40 Correct 23 ms 4848 KB Output is correct
41 Execution timed out 5063 ms 58428 KB Time limit exceeded
42 Halted 0 ms 0 KB -