Submission #3381109

---

Source Code Expand

#include<iostream>
#include<vector>
#include<map>
#include<algorithm>
#include<cmath>
#include<string>

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)   FOR(i,0,n)
#define MOD 1000000007

using namespace std;
 
typedef long long int ll;

const ll INF=(ll)1e18;

int s[6000][6000];
int b[2000][2000];


int main(){
    int N,K;

    cin >> N >> K;

    REP(i,6000)REP(j,6000)s[i][j] = 0;
    REP(i,2000)REP(j,2000)b[i][j] = 0;

    REP(i,N){
        ll x,y;
        char c;
        cin >> x >> y >> c;

        if(c == 'W') y += K;
        b[x%(2*K)][y%(2*K)] += 1;
    }
    REP(i,2*K)REP(j,2*K){
        if(b[i][j] == 0)continue;

        REP(k,2)REP(l,2){
            s[i+1+2*K*k][j+1+2*K*l] += b[i][j];
            s[i+K+1+2*K*k][j+K+1+2*K*l] += b[i][j];
            s[i+K+1+2*K*k][j+1+2*K*l] -= b[i][j];
            s[i+1+2*K*k][j+K+1+2*K*l] -= b[i][j];
        }
    }

    REP(i,6000)FOR(j,1,6000)s[i][j] += s[i][j-1];
    REP(i,6000)FOR(j,1,6000)s[j][i] += s[j-1][i];

    ll ans = 0;
    FOR(i,1,5000)FOR(j,1,5000){
        ll tmp = 0;
        tmp += s[i][j];
        tmp += s[i+K][j+K];
        ans = max(ans,tmp);
    }

    cout << ans << endl;
}

Submission Info

Judge Result