oj.uz

Submission #1019334

# Submission time Handle Problem Language Result Execution time Memory
1019334 2024-07-10T17:45:17 Z ttamx Pyramid Base (IOI08_pyramid_base) C++17
65 / 100
 2503 ms 143444 KB 
#include<bits/stdc++.h>

using namespace std;

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

int n,m,b,p;
vector<tuple<int,int,int>> add[N],del[N];

struct Block{
    int val,sz;
    bool operator<(const Block &b)const{
        return val<b.val||(val==b.val&&sz>b.sz);
    }
};

struct Info{
    int sz;
    Block mn,pre,suf;
    Info():sz(0),mn({INF,0}),pre({INF,0}),suf({INF,0}){}
    static Info single(){
        Info res;
        res.sz=1;
        res.mn=res.pre=res.suf={0,1};
        return res;
    }
    void apply(int v){
        mn.val+=v;
        pre.val+=v;
        suf.val+=v;
    }
    friend Info operator+(const Info &a,const Info &b){
        Info res;
        res.mn=min(a.mn,b.mn);
        if(a.suf.val==b.pre.val)res.mn=min(res.mn,{a.suf.val,a.suf.sz+b.pre.sz});
        res.pre=a.pre;
        if(a.pre.val==b.pre.val&&a.pre.sz==a.sz)res.pre.sz+=b.pre.sz;
        res.suf=b.suf;
        if(a.suf.val==b.suf.val&&b.suf.sz==b.sz)res.suf.sz+=a.suf.sz;
        res.sz=a.sz+b.sz;
        return res;
    }
};

struct SegTree{
    Info t[K];
    int lz[K];
    void apply(int i,int v){
        t[i].apply(v);
        lz[i]+=v;
    }
    void push(int i){
        apply(i*2,lz[i]);
        apply(i*2+1,lz[i]);
        lz[i]=0;
    }
    void pull(int i){
        t[i]=t[i*2]+t[i*2+1];
    }
    void build(int l,int r,int i){
        if(l==r)return t[i]=Info::single(),lz[i]=0,void();
        int m=(l+r)/2;
        build(l,m,i*2);
        build(m+1,r,i*2+1);
        pull(i);
    }
    void build(){
        build(1,n,1);
    }
    void update(int l,int r,int i,int x,int y,int v){
        if(y<l||r<x)return;
        if(x<=l&&r<=y)return apply(i,v);
        int m=(l+r)/2;
        push(i);
        update(l,m,i*2,x,y,v);
        update(m+1,r,i*2+1,x,y,v);
        pull(i);
    }
    void update(int x,int y,int v){
        update(1,n,1,x,y,v);
    }
    Info query(int l,int r,int i,int x,int y){
        if(y<l||r<x)return Info();
        if(x<=l&&r<=y)return t[i];
        int m=(l+r)/2;
        push(i);
        return query(l,m,i*2,x,y)+query(m+1,r,i*2+1,x,y);
    }
    Info query(int x,int y){
        return query(1,n,1,x,y);
    }
}seg;

bool check(int k){
    seg.build();
    for(int i=1;i<k;i++)for(auto [l,r,v]:add[i])seg.update(l,r+k-1,v);
    for(int i=k;i<=m;i++){
        for(auto [l,r,v]:add[i])seg.update(l,r+k-1,v);
        for(auto [l,r,v]:del[i-k])seg.update(l,r+k-1,-v);
        if(seg.query(k,n).mn.val<=b)return true;
    }
    return false;
}

int main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    cin >> m >> n >> b >> p;
    for(int i=0;i<p;i++){
        int x1,y1,x2,y2,c;
        cin >> x1 >> y1 >> x2 >> y2 >> c;
        add[x1].emplace_back(y1,y2,c);
        del[x2].emplace_back(y1,y2,c);
    }
    if(b>0){
        int l=0,r=min(n,m);
        while(l<r){
            int m=(l+r+1)/2;
            if(check(m))l=m;
            else r=m-1;
        }
        cout << l;
    }else{
        seg.build();
        int top=0,bot=0,ans=0;
        while(bot<=m){
            auto x=seg.query(1,n).mn;
            int h=bot-top,w=x.val==0?x.sz:0;
            ans=max(ans,min(h,w));
            if(h<=w){
                bot++;
                for(auto [l,r,v]:add[bot])seg.update(l,r,v);
            }else{
                top++;
                for(auto [l,r,v]:del[top])seg.update(l,r,-v);
            }
        }
        cout << ans << "\n";
    }
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 104788 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 104784 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 104716 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 105052 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 105968 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 112980 KB Output is correct
2 Correct 82 ms 112976 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 112976 KB Output is correct
2 Correct 72 ms 112976 KB Output is correct

Subtask #8
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 61 ms 105296 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 315 ms 107100 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 1773 ms 114884 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #11
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 2503 ms 115532 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #12
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 2127 ms 115692 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #13
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 575 ms 129240 KB Output is correct
2 Correct 285 ms 116048 KB Output is correct

Subtask #14
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 735 ms 136276 KB Output is correct
2 Correct 748 ms 133316 KB Output is correct
3 Correct 593 ms 127852 KB Output is correct

Subtask #15
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 938 ms 143444 KB Output is correct
2 Correct 1177 ms 141612 KB Output is correct
3 Correct 1194 ms 140996 KB Output is correct
4 Correct 945 ms 141812 KB Output is correct
5 Correct 746 ms 136816 KB Output is correct