oj.uz

Submission #1019108

# Submission time Handle Problem Language Result Execution time Memory
1019108 2024-07-10T13:39:06 Z ttamx Pyramid Base (IOI08_pyramid_base) C++17
90 / 100
 5000 ms 116320 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,int,int>> obs;
vector<tuple<int,int,int>> event[N];

struct SegTree{
    int t[K],lz[K];
    void apply(int i,int v){
        t[i]+=v,lz[i]+=v;
    }
    void push(int i){
        apply(i*2,lz[i]);
        apply(i*2+1,lz[i]);
        lz[i]=0;
    }
    void build(int l,int r,int i){
        t[i]=0,lz[i]=0;
        if(l==r)return;
        int m=(l+r)/2;
        build(l,m,i*2);
        build(m+1,r,i*2+1);
    }
    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);
        t[i]=min(t[i*2],t[i*2+1]);
    }
    void update(int x,int y,int v){
        update(1,n,1,x,y,v);
    }
    int query(int l,int r,int i,int x,int y){
        if(y<l||r<x)return INF;
        if(x<=l&&r<=y)return t[i];
        int m=(l+r)/2;
        push(i);
        return min(query(l,m,i*2,x,y),query(m+1,r,i*2+1,x,y));
    }
    int query(int x,int y){
        return query(1,n,1,x,y);
    }
}seg;

bool check(int k){
    for(int i=1;i<=m;i++)event[i].clear();
    for(auto [x1,y1,x2,y2,c]:obs){
        event[max(x1,k)].emplace_back(max(y1,k),y2+k-1,c);
        if(x2+k<=m)event[x2+k].emplace_back(max(y1,k),y2+k-1,-c);
    }
    seg.build();
    seg.update(1,k-1,INF);
    bool upd=true;
    for(int i=k;i<=m;i++){
        for(auto [l,r,v]:event[i]){
            seg.update(l,r,v);
            upd=true;
        }
        if(upd&&seg.t[1]<=b)return true;
        upd=false;
    }
    return false;
}

int main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    cin >> m >> n >> b >> p;
    obs.resize(p);
    for(auto &[x1,y1,x2,y2,c]:obs)cin >> x1 >> y1 >> x2 >> y2 >> c;
    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;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 23896 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 23900 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 23900 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 24408 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 26204 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 102 ms 40532 KB Output is correct
2 Correct 145 ms 40768 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 138 ms 40964 KB Output is correct
2 Correct 104 ms 40784 KB Output is correct

Subtask #8
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 25180 KB Output is correct
2 Correct 44 ms 24808 KB Output is correct
3 Correct 30 ms 24924 KB Output is correct

Subtask #9
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 101 ms 29524 KB Output is correct
2 Correct 172 ms 29064 KB Output is correct
3 Correct 149 ms 29524 KB Output is correct

Subtask #10
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 221 ms 47700 KB Output is correct
2 Correct 51 ms 28772 KB Output is correct
3 Correct 92 ms 42636 KB Output is correct
4 Correct 350 ms 49872 KB Output is correct

Subtask #11
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 334 ms 50768 KB Output is correct
2 Correct 594 ms 51644 KB Output is correct
3 Correct 190 ms 48068 KB Output is correct

Subtask #12
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 344 ms 50700 KB Output is correct
2 Correct 745 ms 54156 KB Output is correct
3 Correct 730 ms 54416 KB Output is correct
4 Correct 773 ms 54056 KB Output is correct
5 Correct 760 ms 54416 KB Output is correct
6 Correct 183 ms 48676 KB Output is correct

Subtask #13
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3129 ms 79860 KB Output is correct
2 Correct 674 ms 60764 KB Output is correct

Subtask #14
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4609 ms 88468 KB Output is correct
2 Correct 4297 ms 116320 KB Output is correct
3 Correct 1456 ms 89768 KB Output is correct

Subtask #15
0 / 10.0

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