oj.uz

Submission #1019121

# Submission time Handle Problem Language Result Execution time Memory
1019121 2024-07-10T13:47:03 Z ttamx Pyramid Base (IOI08_pyramid_base) C++17
80 / 100
 5000 ms 106952 KB 
#pragma GCC optimize("O3,unroll-loops")
#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=k;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);
    for(int i=k;i<=m;i++){
        for(auto &[l,r,v]:event[i])seg.update(l,r,v);
        if(seg.t[1]<=b)return true;
    }
    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 14 ms 23960 KB Output is correct

Subtask #2
5.0 / 5.0

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

Subtask #3
5.0 / 5.0

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

Subtask #4
5.0 / 5.0

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

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 26268 KB Output is correct

Subtask #6
5.0 / 5.0

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

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 133 ms 40788 KB Output is correct
2 Correct 78 ms 40788 KB Output is correct

Subtask #8
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 25436 KB Output is correct
2 Correct 37 ms 24812 KB Output is correct
3 Correct 33 ms 24912 KB Output is correct

Subtask #9
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 111 ms 29892 KB Output is correct
2 Correct 170 ms 29520 KB Output is correct
3 Correct 152 ms 29780 KB Output is correct

Subtask #10
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 195 ms 48464 KB Output is correct
2 Correct 46 ms 29304 KB Output is correct
3 Correct 93 ms 43136 KB Output is correct
4 Correct 373 ms 50516 KB Output is correct

Subtask #11
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 334 ms 51280 KB Output is correct
2 Correct 655 ms 52420 KB Output is correct
3 Correct 196 ms 48624 KB Output is correct

Subtask #12
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 284 ms 51468 KB Output is correct
2 Correct 836 ms 54996 KB Output is correct
3 Correct 768 ms 55072 KB Output is correct
4 Correct 878 ms 54888 KB Output is correct
5 Correct 854 ms 55184 KB Output is correct
6 Correct 181 ms 49424 KB Output is correct

Subtask #13
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3234 ms 85616 KB Output is correct
2 Correct 671 ms 65788 KB Output is correct

Subtask #14
0 / 10.0

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

Subtask #15
0 / 10.0

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