#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int,int>
#define F first
#define S second
ll n,m,r,k,p,ans,offN=1,offM=1;
vector<vector<ll> >dp;
vvi a,t[2];
ll calc(int a1,int b1,int a2,int b2){
if(a1==0 and b1==0)return dp[a2][b2];
if(a1==0)return dp[a2][b2]-dp[a2][b1-1];
if(b1==0)return dp[a2][b2]-dp[a1-1][b2];
return dp[a2][b2]-dp[a1-1][b2]-dp[a2][b1-1]+dp[a1-1][b1-1];
}
int z,ind,lijevo,val;
void update(int z,int ind,int node,int val){
t[z][ind][node]=val;
while(node/=2)t[z][ind][node]=max(t[z][ind][node*2],t[z][ind][node*2+1]);
return;
}
int query(int l,int r,int node){
if(t[z][ind][1]<val)return -1;
while(l!=r){
//cout<<"query: "<<l<<' '<<r<<' '<<node<<' '<<t[z][ind][node]<<'\n';
if(lijevo){
if(t[z][ind][node*2]>=val)r=(l+r)/2,node*=2;
else l=(l+r)/2+1,node=node*2+1;
}
else{
if(t[z][ind][node*2+1]>=val)l=(l+r)/2+1,node=node*2+1;
else r=(l+r)/2,node*=2;
}
}
//cout<<"query: "<<l<<' '<<r<<' '<<node<<' '<<t[z][ind][node]<<'\n';
return l;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cin>>n>>m>>r>>k>>p;
while(offN<n)offN*=2;
while(offM<m)offM*=2;
t[0]=vvi(m,vi(4*offN+10,0));
t[1]=vvi(n,vi(4*offM+10,0));
for(int i=0;i<n;i++){
vector<int>v;
vector<ll>v2;
for(int j=0;j<m;j++){
int ai;
cin>>ai;
v.push_back(ai);
v2.push_back(0);
update(0,j,offN+i,ai);
update(1,i,offM+j,ai);
}
dp.push_back(v2);
a.push_back(v);
}
for(int q=0;q<k;q++){
//cout<<"K:\n";
char ci;
cin>>ci>>ind>>val,ind--;
z=(ci=='N' or ci=='S')^1;
lijevo=(ci=='N' or ci=='W');
vector<pii>v;
//cout<<"z ind lijevo val: "<<z<<' '<<ind<<' '<<lijevo<<' '<<val<<'\n';
for(int i=0;i<r;i++){
int ji=query(0,z*offM+(z^1)*offN-1,1);
//cout<<"ji: "<<ji<<'\n';
if(ji==-1)continue;
if(!z){
a[ji][ind]--;
v.push_back({ji,ind});
update(0,ind,ji+offN,0);
update(1,ji,ind+offM,0);
}
else {
a[ind][ji]--;
v.push_back({ind,ji});
update(0,ji,ind+offN,0);
update(1,ind,ji+offM,0);
}
}
for(int i=0;i<v.size();i++){
update(0,v[i].S,v[i].F+offN,a[v[i].F][v[i].S]);
update(1,v[i].F,v[i].S+offM,a[v[i].F][v[i].S]);
}
/*cout<<"--------------\n";
for(int i=0;i<n;i++){
for(int j=0;j<m;j++)cout<<a[i][j]<<' ';
cout<<'\n';
}*/
}
for(int i=0;i<n;i++)for(int j=0;j<m;j++)dp[i][j]=0;
dp[0][0]=a[0][0];
for(int i=1;i<n;i++)dp[i][0]=dp[i-1][0]+a[i][0];
for(int j=1;j<m;j++)dp[0][j]=dp[0][j-1]+a[0][j];
for(int i=1;i<n;i++)for(int j=1;j<m;j++)dp[i][j]=dp[i-1][j]+dp[i][j-1]-dp[i-1][j-1]+a[i][j];
for(int i=0;i<=n-p;i++)for(int j=0;j<=m-p;j++)ans=max(ans,calc(i,j,i+p-1,j+p-1));
cout<<ans;
return 0;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
