Submission #4014540

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using P = pair<ll, ll>;
const ll INF = 5e15;
const ll MOD = 1e9 + 7;

ll N, K;
//ll imos[1010][2010];
vector<vector<ll>> imos;

void sla(ll &x, ll &y){
    x -= K;
    if(y >= K) y -= K;
    else y += K;
}

void to_range(ll &x, ll &y){
    if(K <= x) sla(x, y);
}

int main(){
    cin >> N >> K;
    imos = decltype(imos)(1010, vector<ll>(2010));
    for(ll HOPE = 0; HOPE < N; HOPE++){
        ll x, y;
        char c;
        cin >> x >> y >> c;
        if(c == 'W'){
            if(x >= K) x -= K;
            else x += K;
        }
        to_range(x, y);
        ll fx = x + 1;
        ll fy = y + 1;
        to_range(fx, fy);
        imos[fx][fy]++;
        vector<P> xs = {P(fx, 1)};
        ll fxm = fx + K;
        if(fxm > K){
            imos[0][fy]++;
            xs.push_back(P(0, 1));
            fxm %= K;
        }
        imos[fxm][fy]--;
        xs.push_back(P(fxm, -1));
        ll fym = fy + K;
        if(fym > 2 * K){
            for(const P &p : xs) imos[p.first][0] += p.second;
            fym %= 2 * K;
        }
        for(const P &p : xs) imos[p.first][fym] -= p.second;
#if 0
        //for(ll x = 0; x <= K; x++) for(ll y = 0; y <= 2 * K; y++) imos[x + 1][y] += imos[x][y];
        //for(ll y = 0; y <= 2 * K; y++) for(ll x = 0; x <= K; x++) imos[x][y + 1] += imos[x][y];
        for(ll i = 2 * K; i >= 0; i--){
            for(ll j = 0; j <= K; j++) cout << imos[j][i] << ' ';
            cout << endl;
        }
        cout << "\n=====================\n";
#endif
    }
    for(ll x = 0; x <= K; x++) for(ll y = 0; y <= 2 * K; y++) imos[x + 1][y] += imos[x][y];
    for(ll y = 0; y <= 2 * K; y++) for(ll x = 0; x <= K; x++) imos[x][y + 1] += imos[x][y];
    ll ans = 0;
    for(ll x = 0; x <= K; x++) for(ll y = 0; y <= 2 * K; y++) ans = max(ans, imos[x][y]);
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result