oj.uz

Submission #1113142

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

using namespace std;

const int N=3e5+5;
const int K=1<<21;
const int INF=INT_MAX/2;

int n;
vector<int> a,b,c,pos;
vector<bool> lo;

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){
    vector<bool> d1(3*n),d2(3*n);
    for(int t=0;t<2;t++){
        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;
            }
        }
        swap(b,c);
        swap(d1,d2);
    }
    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;
    a.resize(3*n),b.resize(n),c.resize(n),pos.resize(3*n);
    lo.resize(3*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(auto &x:b){
        cin >> x;
    }
    for(auto &x:c){
        cin >> x;
    }
    sort(b.begin(),b.end());
    sort(c.begin(),c.end());
    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 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 380 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 380 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 504 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 504 KB Output is correct
18 Correct 1 ms 504 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 436 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 380 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 504 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 504 KB Output is correct
18 Correct 1 ms 504 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 436 KB Output is correct
26 Correct 32 ms 740 KB Output is correct
27 Correct 30 ms 740 KB Output is correct
28 Correct 21 ms 592 KB Output is correct
29 Correct 2 ms 336 KB Output is correct
30 Correct 33 ms 736 KB Output is correct
31 Correct 29 ms 748 KB Output is correct
32 Correct 13 ms 592 KB Output is correct
33 Correct 7 ms 336 KB Output is correct
34 Correct 24 ms 736 KB Output is correct
35 Correct 24 ms 732 KB Output is correct
36 Correct 29 ms 732 KB Output is correct
37 Correct 23 ms 756 KB Output is correct
38 Correct 24 ms 744 KB Output is correct
39 Correct 25 ms 740 KB Output is correct
40 Correct 23 ms 736 KB Output is correct

Subtask #4
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 4840 ms 59564 KB Output is correct
2 Correct 4732 ms 66012 KB Output is correct
3 Correct 3665 ms 46524 KB Output is correct
4 Correct 4941 ms 79792 KB Output is correct
5 Correct 4693 ms 64940 KB Output is correct
6 Correct 150 ms 2276 KB Output is correct
7 Correct 4162 ms 72404 KB Output is correct
8 Correct 4259 ms 67500 KB Output is correct
9 Correct 4442 ms 70432 KB Output is correct
10 Correct 4858 ms 70312 KB Output is correct
11 Correct 4856 ms 68312 KB Output is correct
12 Correct 4783 ms 70048 KB Output is correct
13 Correct 4403 ms 68520 KB Output is correct
14 Correct 4532 ms 71504 KB Output is correct
15 Correct 4538 ms 68084 KB Output is correct
16 Correct 4413 ms 66728 KB Output is correct

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 380 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 504 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 504 KB Output is correct
18 Correct 1 ms 504 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 436 KB Output is correct
26 Correct 32 ms 740 KB Output is correct
27 Correct 30 ms 740 KB Output is correct
28 Correct 21 ms 592 KB Output is correct
29 Correct 2 ms 336 KB Output is correct
30 Correct 33 ms 736 KB Output is correct
31 Correct 29 ms 748 KB Output is correct
32 Correct 13 ms 592 KB Output is correct
33 Correct 7 ms 336 KB Output is correct
34 Correct 24 ms 736 KB Output is correct
35 Correct 24 ms 732 KB Output is correct
36 Correct 29 ms 732 KB Output is correct
37 Correct 23 ms 756 KB Output is correct
38 Correct 24 ms 744 KB Output is correct
39 Correct 25 ms 740 KB Output is correct
40 Correct 23 ms 736 KB Output is correct
41 Correct 4840 ms 59564 KB Output is correct
42 Correct 4732 ms 66012 KB Output is correct
43 Correct 3665 ms 46524 KB Output is correct
44 Correct 4941 ms 79792 KB Output is correct
45 Correct 4693 ms 64940 KB Output is correct
46 Correct 150 ms 2276 KB Output is correct
47 Correct 4162 ms 72404 KB Output is correct
48 Correct 4259 ms 67500 KB Output is correct
49 Correct 4442 ms 70432 KB Output is correct
50 Correct 4858 ms 70312 KB Output is correct
51 Correct 4856 ms 68312 KB Output is correct
52 Correct 4783 ms 70048 KB Output is correct
53 Correct 4403 ms 68520 KB Output is correct
54 Correct 4532 ms 71504 KB Output is correct
55 Correct 4538 ms 68084 KB Output is correct
56 Correct 4413 ms 66728 KB Output is correct
57 Correct 4392 ms 71200 KB Output is correct
58 Execution timed out 5004 ms 66076 KB Time limit exceeded
59 Halted 0 ms 0 KB -