oj.uz

Submission #1019136

# Submission time Handle Problem Language Result Execution time Memory
1019136 2024-07-10T14:03:22 Z ttamx Pyramid Base (IOI08_pyramid_base) C++17
90 / 100
 5000 ms 84820 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 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){
    seg.build();
    seg.update(1,k-1,INF);
    for(int i=1;i<k;i++)for(auto [l,r,v]:add[i])seg.update(max(l,k),r+k-1,v);
    for(int i=k;i<=m;i++){
        for(auto [l,r,v]:add[i])seg.update(max(l,k),r+k-1,v);
        for(auto [l,r,v]:del[i-k])seg.update(max(l,k),r+k-1,-v);
        if(seg.t[1]<=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);
    }
    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 20 ms 47196 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 47300 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 47452 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 47960 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 49456 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 63832 KB Output is correct
2 Correct 160 ms 63652 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 164 ms 63900 KB Output is correct
2 Correct 121 ms 63832 KB Output is correct

Subtask #8
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 47708 KB Output is correct
2 Correct 58 ms 47712 KB Output is correct
3 Correct 41 ms 47708 KB Output is correct

Subtask #9
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 110 ms 50424 KB Output is correct
2 Correct 180 ms 50264 KB Output is correct
3 Correct 152 ms 50024 KB Output is correct

Subtask #10
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 237 ms 65104 KB Output is correct
2 Correct 39 ms 48476 KB Output is correct
3 Correct 109 ms 64604 KB Output is correct
4 Correct 342 ms 64872 KB Output is correct

Subtask #11
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 352 ms 65360 KB Output is correct
2 Correct 569 ms 65192 KB Output is correct
3 Correct 225 ms 65108 KB Output is correct

Subtask #12
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 340 ms 65668 KB Output is correct
2 Correct 707 ms 65364 KB Output is correct
3 Correct 580 ms 65520 KB Output is correct
4 Correct 700 ms 65360 KB Output is correct
5 Correct 737 ms 65560 KB Output is correct
6 Correct 226 ms 65620 KB Output is correct

Subtask #13
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2614 ms 75232 KB Output is correct
2 Correct 341 ms 55600 KB Output is correct

Subtask #14
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4183 ms 80288 KB Output is correct
2 Correct 4002 ms 77508 KB Output is correct
3 Correct 1395 ms 72316 KB Output is correct

Subtask #15
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4646 ms 84820 KB Output is correct
2 Execution timed out 5064 ms 83136 KB Time limit exceeded
3 Halted 0 ms 0 KB -