Submission #4034364

---

Source Code Expand

#include<bits/stdc++.h>

#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair 
#define F first
#define S second
#define ll long long
#define ALL(a) (a).begin(),(a).end()
#define Yes(hoge) cout<<((hoge)?"Yes":"No")<<endl;
#define YES(hoge) cout<<((hoge)?"YES":"NO")<<endl;
struct Grid{
  int x,y,t;
};


using namespace std;

const int MAX_N = 2220;
int row,col;
ll rui[MAX_N][MAX_N];
ll ele[MAX_N][MAX_N];
void make_sum(int r,int l){
  row=r;col=l;
  for(int i=1;i<=row+1;i++)
    for(int j=1;j<=col+1;j++)
      rui[i][j] = ele[i][j] + rui[i-1][j] + rui[i][j-1] - rui[i-1][j-1];
}

ll ret_sum(int lx,int ly,int rx,int ry){//閉区間
  if(lx>rx||ly>ry)return 0;
  else return rui[rx][ry] - rui[lx-1][ry] - rui[rx][ly-1] + rui[lx-1][ly-1]; 
}

int main(){
  int n,k;cin>>n>>k;
  for(int i=0;i<n;i++){
    int a,b;char c;
    cin>>a>>b>>c;
    if(c=='W')
      b+=k;
    a%=(2*k);
    b%=(2*k);
    ele[a+1][b+1]++;
  }
  ll ans=-1;
  make_sum(2*k,2*k);
  for(int i=1;i<=k;i++){
    for(int j=1;j<=k;j++){
      ll num = ret_sum(i,j,i+k-1,j+k-1)+ret_sum(i+k,j+k,2*k,2*k)+
	ret_sum(1,1,i-1,j-1)+ret_sum(i+k,1,2*k,j-1)+ret_sum(1,j+k,i-1,2*k);
      ans=max(ans,max(n-num,num));
    }
  }
  cout<<ans<<endl;
  return 0;
}

Submission Info

Judge Result