제출 #1019318

#제출 시각아이디문제언어결과실행 시간메모리
1019318ttamxPyramid Base (IOI08_pyramid_base)C++17
5 / 100
5060 ms84000 KiB
#pragma GCC optimize("O3,unroll-loops") #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt") #include<bits/stdc++.h> using namespace std; const int N=1e6+5; const int INF=INT_MAX/2; int n,m,b,p; vector<tuple<int,int,int>> add[N],del[N]; struct SegTree{ int n,log; int t[2*N],lz[2*N]; void init(int _n){ n=_n; log=32-__builtin_clz(n); } void apply(int i,int v){ t[i]+=v,lz[i]+=v; } void push(int i){ apply(i<<1,lz[i]); apply(i<<1|1,lz[i]); lz[i]=0; } void pull(int i){ t[i]=min(t[i<<1],t[i<<1|1]); } void build(){ for(int i=1;i<2*n;i++)t[i]=lz[i]=0; } void update(int l,int r,int v){ if(l>r)return; l+=n-1,r+=n; for(int i=log;i>=1;i--){ if(((l>>i)<<i)!=l)push(l>>i); if(((r>>i)<<i)!=r)push((r-1)>>i); } for(int l2=l,r2=r;l2<r2;l2>>=1,r2>>=1){ if(l2&1)apply(l2++,v); if(r2&1)apply(--r2,v); } for(int i=1;i<=log;i++){ if(((l>>i)<<i)!=l)pull(l>>i); if(((r>>i)<<i)!=r)pull((r-1)>>i); } } }seg; inline bool check(int k){ 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),min(r+k-1,n),v); for(int i=k;i<=m;i++){ for(auto [l,r,v]:add[i])seg.update(max(l,k),min(r+k-1,n),v); for(auto [l,r,v]:del[i-k])seg.update(max(l,k),min(r+k-1,n),-v); if(seg.t[1]<=b){ for(int j=1;j<k;j++)for(auto [l,r,v]:add[j])seg.update(max(l,k),min(r+k-1,n),-v); for(int j=k;j<=m;j++){ for(auto [l,r,v]:add[j])seg.update(max(l,k),min(r+k-1,n),-v); for(auto [l,r,v]:del[j-k])seg.update(max(l,k),min(r+k-1,n),v); } seg.update(1,k-1,-INF); return true; } } for(int i=m-k+1;i<=m;i++)for(auto [l,r,v]:del[i])seg.update(max(l,k),min(r+k-1,n),-v); seg.update(1,k-1,-INF); 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); } seg.init(n); 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; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...