oj.uz

Submission #1113145

# Submission time Handle Problem Language Result Execution time Memory
1113145 2024-11-15T22:29:50 Z ttamx Growing Vegetables is Fun 5 (JOI24_vegetables5) C++17
67 / 100
 5000 ms 65516 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();
    }
};

void calc(int *b,bool *d,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();
            d[i]=(q1.query()+q2.query()+q3.query()).mx<=0;
        }
    }
}

bool check(int k){
    calc(b,d1,k);
    calc(c,d2,k);
    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=1e9;
    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 2 ms 10576 KB Output is correct
2 Correct 3 ms 10576 KB Output is correct
3 Correct 2 ms 10576 KB Output is correct
4 Correct 2 ms 10576 KB Output is correct
5 Correct 2 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 2 ms 10576 KB Output is correct
11 Correct 2 ms 10576 KB Output is correct
12 Correct 2 ms 10576 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10576 KB Output is correct
2 Correct 3 ms 10576 KB Output is correct
3 Correct 2 ms 10576 KB Output is correct
4 Correct 2 ms 10576 KB Output is correct
5 Correct 2 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 2 ms 10576 KB Output is correct
11 Correct 2 ms 10576 KB Output is correct
12 Correct 2 ms 10576 KB Output is correct
13 Correct 2 ms 10576 KB Output is correct
14 Correct 1 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 10576 KB Output is correct
18 Correct 2 ms 10576 KB Output is correct
19 Correct 2 ms 10576 KB Output is correct
20 Correct 2 ms 10680 KB Output is correct
21 Correct 2 ms 10576 KB Output is correct
22 Correct 2 ms 10576 KB Output is correct
23 Correct 2 ms 10576 KB Output is correct
24 Correct 2 ms 10576 KB Output is correct
25 Correct 2 ms 10576 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10576 KB Output is correct
2 Correct 3 ms 10576 KB Output is correct
3 Correct 2 ms 10576 KB Output is correct
4 Correct 2 ms 10576 KB Output is correct
5 Correct 2 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 2 ms 10576 KB Output is correct
11 Correct 2 ms 10576 KB Output is correct
12 Correct 2 ms 10576 KB Output is correct
13 Correct 2 ms 10576 KB Output is correct
14 Correct 1 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 10576 KB Output is correct
18 Correct 2 ms 10576 KB Output is correct
19 Correct 2 ms 10576 KB Output is correct
20 Correct 2 ms 10680 KB Output is correct
21 Correct 2 ms 10576 KB Output is correct
22 Correct 2 ms 10576 KB Output is correct
23 Correct 2 ms 10576 KB Output is correct
24 Correct 2 ms 10576 KB Output is correct
25 Correct 2 ms 10576 KB Output is correct
26 Correct 34 ms 10940 KB Output is correct
27 Correct 31 ms 10944 KB Output is correct
28 Correct 23 ms 11000 KB Output is correct
29 Correct 4 ms 10576 KB Output is correct
30 Correct 32 ms 10936 KB Output is correct
31 Correct 29 ms 10952 KB Output is correct
32 Correct 14 ms 10832 KB Output is correct
33 Correct 8 ms 10576 KB Output is correct
34 Correct 24 ms 10832 KB Output is correct
35 Correct 24 ms 10952 KB Output is correct
36 Correct 30 ms 10832 KB Output is correct
37 Correct 22 ms 11180 KB Output is correct
38 Correct 26 ms 10984 KB Output is correct
39 Correct 23 ms 10832 KB Output is correct
40 Correct 24 ms 10944 KB Output is correct

Subtask #4
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 4984 ms 59156 KB Output is correct
2 Correct 4949 ms 61632 KB Output is correct
3 Correct 3501 ms 43048 KB Output is correct
4 Correct 4625 ms 60500 KB Output is correct
5 Correct 4646 ms 60396 KB Output is correct
6 Correct 153 ms 12120 KB Output is correct
7 Correct 3870 ms 61604 KB Output is correct
8 Correct 4137 ms 63048 KB Output is correct
9 Correct 4383 ms 65516 KB Output is correct
10 Correct 4890 ms 61004 KB Output is correct
11 Correct 4855 ms 61780 KB Output is correct
12 Correct 4625 ms 62800 KB Output is correct
13 Correct 4552 ms 60044 KB Output is correct
14 Correct 4175 ms 62280 KB Output is correct
15 Correct 3948 ms 59860 KB Output is correct
16 Correct 4157 ms 63200 KB Output is correct

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10576 KB Output is correct
2 Correct 3 ms 10576 KB Output is correct
3 Correct 2 ms 10576 KB Output is correct
4 Correct 2 ms 10576 KB Output is correct
5 Correct 2 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 2 ms 10576 KB Output is correct
11 Correct 2 ms 10576 KB Output is correct
12 Correct 2 ms 10576 KB Output is correct
13 Correct 2 ms 10576 KB Output is correct
14 Correct 1 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 10576 KB Output is correct
18 Correct 2 ms 10576 KB Output is correct
19 Correct 2 ms 10576 KB Output is correct
20 Correct 2 ms 10680 KB Output is correct
21 Correct 2 ms 10576 KB Output is correct
22 Correct 2 ms 10576 KB Output is correct
23 Correct 2 ms 10576 KB Output is correct
24 Correct 2 ms 10576 KB Output is correct
25 Correct 2 ms 10576 KB Output is correct
26 Correct 34 ms 10940 KB Output is correct
27 Correct 31 ms 10944 KB Output is correct
28 Correct 23 ms 11000 KB Output is correct
29 Correct 4 ms 10576 KB Output is correct
30 Correct 32 ms 10936 KB Output is correct
31 Correct 29 ms 10952 KB Output is correct
32 Correct 14 ms 10832 KB Output is correct
33 Correct 8 ms 10576 KB Output is correct
34 Correct 24 ms 10832 KB Output is correct
35 Correct 24 ms 10952 KB Output is correct
36 Correct 30 ms 10832 KB Output is correct
37 Correct 22 ms 11180 KB Output is correct
38 Correct 26 ms 10984 KB Output is correct
39 Correct 23 ms 10832 KB Output is correct
40 Correct 24 ms 10944 KB Output is correct
41 Correct 4984 ms 59156 KB Output is correct
42 Correct 4949 ms 61632 KB Output is correct
43 Correct 3501 ms 43048 KB Output is correct
44 Correct 4625 ms 60500 KB Output is correct
45 Correct 4646 ms 60396 KB Output is correct
46 Correct 153 ms 12120 KB Output is correct
47 Correct 3870 ms 61604 KB Output is correct
48 Correct 4137 ms 63048 KB Output is correct
49 Correct 4383 ms 65516 KB Output is correct
50 Correct 4890 ms 61004 KB Output is correct
51 Correct 4855 ms 61780 KB Output is correct
52 Correct 4625 ms 62800 KB Output is correct
53 Correct 4552 ms 60044 KB Output is correct
54 Correct 4175 ms 62280 KB Output is correct
55 Correct 3948 ms 59860 KB Output is correct
56 Correct 4157 ms 63200 KB Output is correct
57 Correct 4487 ms 60508 KB Output is correct
58 Correct 4609 ms 62620 KB Output is correct
59 Correct 3135 ms 40204 KB Output is correct
60 Execution timed out 5053 ms 62084 KB Time limit exceeded
61 Halted 0 ms 0 KB -