Submission #2983234

---

Source Code Expand

#include <bits/stdc++.h>

#define MAX_N 100000
#define MAX_K 1000

using namespace std;

struct coord
{
    int x, y, c;
};

coord v[MAX_N + 1];

int rest[MAX_K + 1][2];

int good[2];
int bad[2];

int n, k;

int main()
{
    cin >> n >> k;

    char ch;
    for(int i = 1; i <= n; i ++)
    {
        cin >> v[i].x >> v[i].y >> ch;
        v[i].c = (ch == 'W');
    }

    int i, j;
    int rez = 0;
    for(i = 0; i < k; i ++)
    {
        for(j = 0; j <= k; j ++)
            rest[j][0] = rest[j][1] = 0;

        int cr = 0;
        good[0] = good[1] = 0;
        bad[0] = bad[1] = 0;
        int culcr;
        for(j = 1; j <= n; j ++)
        {
            if(v[i].y % (k << 1) >= i && v[j].y % (k << 1) <= i + k - 1)
                culcr = ((v[j].x / k) & 1);

            else
                culcr = 1 - ((v[j].x / k) & 1);

            //cout << i << " " << culcr << "\n";

            if(culcr == 0 && v[j].c == 0)
                rest[v[j].x % k][0] ++;

            if(culcr == 1 && v[j].c == 0)
                rest[v[j].x % k][1] ++;

            if(v[j].c == culcr)
            {
                good[v[j].c] ++;
                cr ++;
            }

            else
                bad[v[j].c] ++;
        }

        //cout << i << " " << cr << "START" << "\n";

        rez = max(rez, cr);
        rez = max(rez, n - cr);

        for(j = 0; j < k - 1; j ++)
        {
            cr -= rest[j][0];
            cr += rest[j][1];

           // cout << cr << " " << i << " " << j << "\n";

            rez = max(rez, cr);
            rez = max(rez, n - cr);
        }
    }

    cout << rez << "\n";

    return 0;
}

Submission Info

Judge Result