oj.uz

Submission #914469

# Submission time Handle Problem Language Result Execution time Memory
914469 2024-01-22T08:26:52 Z abcvuitunggio Pyramid Base (IOI08_pyramid_base) C++17
80 / 100
 5000 ms 94284 KB 
#include <bits/stdc++.h>
using namespace std;
const int M=1000001,P=400001;
int m,n,b,p,x[P],y[P],u[P],v[P],c[P];
unsigned int st[M*4],lazy[M*4];
vector <int> ve[M+1];
void down(int node, int l, int r){
    if (!lazy[node]||l==r)
        return;
    st[node<<1]+=lazy[node];
    st[node<<1|1]+=lazy[node];
    lazy[node<<1]+=lazy[node];
    lazy[node<<1|1]+=lazy[node];
    lazy[node]=0;
}
void update(int node, int l, int r, int u, int v, int val){
    if (l>v||r<u)
        return;
    if (l>=u&&r<=v){
        st[node]+=val;
        lazy[node]+=val;
        return;
    }
    down(node,l,r);
    int mid=(l+r)>>1;
    update(node<<1,l,mid,u,v,val);
    update(node<<1|1,mid+1,r,u,v,val);
    st[node]=min(st[node<<1],st[node<<1|1]);
}
bool check(int sz){
    for (int i=1;i<=m+1;i++)
        ve[i].clear();
    for (int i=1;i<=n*4;i++)
        st[i]=lazy[i]=0;
    for (int i=1;i<=p;i++){
        int X=max(x[i]-sz+1,1);
        ve[X].push_back(i);
        ve[u[i]+1].push_back(-i);
    }
    for (int i=1;i<=m-sz+1;i++){
        for (int j:ve[i])
            update(1,1,n-sz+1,max(y[abs(j)]-sz+1,1),v[abs(j)],c[abs(j)]*(j<0?-1:1));
        if (st[1]<=b)
            return true;
    }
    return false;
}
int main(){
    ios_base::sync_with_stdio(NULL);cin.tie(nullptr);
    cin >> m >> n >> b >> p;
    for (int i=1;i<=p;i++)
        cin >> x[i] >> y[i] >> u[i] >> v[i] >> c[i];
    int l=1,r=min(m,n),kq=0;
    while (l<=r){
        int mid=(l+r)>>1;
        if (check(mid)){
            kq=mid;
            l=mid+1;
        }
        else
            r=mid-1;
    }
    cout << kq;
}

Compilation message

pyramid_base.cpp: In function 'bool check(int)':
pyramid_base.cpp:43:18: warning: comparison of integer expressions of different signedness: 'unsigned int' and 'int' [-Wsign-compare]
   43 |         if (st[1]<=b)
      |             ~~~~~^~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 35420 KB Output is correct

Subtask #2
5.0 / 5.0

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

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 35420 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
5.0 / 5.0

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

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 147 ms 62324 KB Output is correct
2 Correct 240 ms 62544 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 226 ms 62632 KB Output is correct
2 Correct 148 ms 62288 KB Output is correct

Subtask #8
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 37720 KB Output is correct
2 Correct 43 ms 37872 KB Output is correct
3 Correct 37 ms 37724 KB Output is correct

Subtask #9
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 107 ms 41556 KB Output is correct
2 Correct 214 ms 42048 KB Output is correct
3 Correct 168 ms 42076 KB Output is correct

Subtask #10
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 312 ms 66644 KB Output is correct
2 Correct 71 ms 39996 KB Output is correct
3 Correct 135 ms 62300 KB Output is correct
4 Correct 563 ms 70520 KB Output is correct

Subtask #11
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 502 ms 69388 KB Output is correct
2 Correct 914 ms 71772 KB Output is correct
3 Correct 231 ms 64424 KB Output is correct

Subtask #12
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 371 ms 67412 KB Output is correct
2 Correct 1164 ms 74208 KB Output is correct
3 Correct 1076 ms 74052 KB Output is correct
4 Correct 1165 ms 74192 KB Output is correct
5 Correct 1160 ms 74332 KB Output is correct
6 Correct 198 ms 63876 KB Output is correct

Subtask #13
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4930 ms 92968 KB Output is correct
2 Correct 856 ms 69460 KB Output is correct

Subtask #14
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5015 ms 93836 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 5029 ms 94284 KB Time limit exceeded
2 Halted 0 ms 0 KB -