Submission #2983559

---

Source Code Expand

#include<bits/stdc++.h>
#define S 2010
using namespace std;
using ll = int64_t;
const ll INF = 1145148931919810;
ll imos[S][S];
ll N, K;
void update(ll x, ll y, ll v){
    ll xl = max<ll>(0, min<ll>(x, S - 1));
    ll yl = max<ll>(0, min<ll>(y, S - 1));
    imos[xl][yl] += v;
    imos[xl + K][yl] -= v;
    imos[xl][yl + K] -= v;
}
int main(){
    cin >> N >> K;
    for(ll i = 0; i < N; i++){
        ll x, y;
        char c;
        cin >> x >> y >> c;
        x++;
        y++;
        x %= 2 * K + 1;
        y %= 2 * K + 1;
        update(x, y, c == 'B');
        for(ll j = 0; j < 3; j++) for(ll k = 0; k < 3; k++){
            if(j == 1 && k == 1) continue;
            ll xl = x + (j - 1) * K;
            ll yl = y + (k - 1) * K;
            if(2 * K < xl) xl -= 2 * K;
            else if(xl + K <= 0) xl += 2 * K;
            if(2 * K < yl) yl -= 2 * K;
            else if(yl + K <= 0) yl += 2 * K;
            update(xl, yl, c == 'B');
        }
    }
    for(ll i = 0; i < S - 1; i ++) for(ll j = 0; j < S - 1; j++) imos[i + 1][j] += imos[i][j];
    for(ll i = 0; i < S - 1; i ++) for(ll j = 0; j < S - 1; j++) imos[i][j + 1] += imos[i][j];
    ll ans = 0;
    for(ll i = 0; i < S; i++) ans = max(ans, *max_element(&imos[i][0], &imos[i][S]));
    cout << ans / 2 << endl;
    return 0;
}

Submission Info

Judge Result