Problem:
Score : 500 points

Problem Statement

AtCoDeer is thinking of painting an infinite two-dimensional grid in a checked pattern of side K.
Here, a checked pattern of side K is a pattern where each square is painted black or white so that each connected component of each color is a K × K square.
Below is an example of a checked pattern of side 3:

AtCoDeer has N desires.
The i-th desire is represented by x_i, y_i and c_i.
If c_i is B, it means that he wants to paint the square (x_i,y_i) black; if c_i is W, he wants to paint the square (x_i,y_i) white.
At most how many desires can he satisfy at the same time?

Constraints

1 ≤ N ≤ 10^5

1 ≤ K ≤ 1000

0 ≤ x_i ≤ 10^9

0 ≤ y_i ≤ 10^9

If i ≠ j, then (x_i,y_i) ≠ (x_j,y_j).

c_i is B or W.

N, K, x_i and y_i are integers.

Input

Input is given from Standard Input in the following format:

N K
x_1 y_1 c_1
x_2 y_2 c_2
:
x_N y_N c_N

Output

Print the maximum number of desires that can be satisfied at the same time.

Sample Input 1

4 3
0 1 W
1 2 W
5 3 B
5 4 B

Sample Output 1

4

He can satisfy all his desires by painting as shown in the example above.

Sample Input 2

2 1000
0 0 B
0 1 W

Sample Output 2

2

Sample Input 3

6 2
1 2 B
2 1 W
2 2 B
1 0 B
0 6 W
4 5 W

Sample Output 3

4

Solution in C# (.NET Core 3.1.201) (judge verdict: Accepted)

using System;
using System.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.Globalization;
using System.IO;
using System.Text;
using System.Linq;

using E = System.Linq.Enumerable;
using System.IO.Pipes;

internal partial class Solver {
    public void Run() {
        var n = ni();
        var k = ni();
        var x = new int[n];
        var y = new int[n];
        var c = new char[n];

        for (int i = 0; i < n; i++) {
            x[i] = ni();
            y[i] = ni();
            c[i] = ns()[0];
        }
#if false
        n = 100000;
        k = 1000;
        x = new int[n];
        y = new int[n];
        c = new char[n];
        for (int i = 0; i < n; i++) {
            x[i] = i;
            y[i] = 2 * i + 100;
            c[i] = 'W';
        }
#endif
        var sumW = new int[3 * k, 3 * k];
        var sumB = new int[3 * k, 3 * k];
        for (int i = 0; i < n; i++) {
            x[i] %= (2 * k);
            y[i] %= (2 * k);
            ref var sum = ref (c[i] == 'W' ? ref sumW : ref sumB);
            sum[y[i], x[i]]++;
            if (x[i] + 2 * k < 3 * k) sum[y[i], x[i] + 2 * k]++;
            if (y[i] + 2 * k < 3 * k) sum[y[i] + 2 * k, x[i]]++;
            if (x[i] + 2 * k < 3 * k && y[i] + 2 * k < 3 * k) sum[y[i] + 2 * k, x[i] + 2 * k]++;
        }
        var sumTableW = new SumTable2D(sumW);
        sumW = null;
        var sumTableB = new SumTable2D(sumB);
        sumB = null;
        long ans = 0;
        for (int i = 0; i < k; i++) {
            for (int j = 0; j < k; j++) {
                var count = sumTableW.Sum(i, i + k, j, j + k) + sumTableW.Sum(i + k, i + 2 * k, j + k, j + 2 * k);
                count += sumTableB.Sum(i + k, i + 2 * k, j, j + k) + sumTableB.Sum(i, i + k, j + k, j + 2 * k);
                ans = Math.Max(ans, Math.Max(count, n - count));
            }
        }
        cout.WriteLine(ans);
    }
}

public class SumTable2D {
    private readonly int[,] sumArray;
    public readonly int Height, Width;

    public SumTable2D(int[,] array) {
        Height = array.GetLength(0);
        Width = array.GetLength(1);
        sumArray = new int[Height + 1, Width + 1];

        for (int i = 0; i < Height; i++) {
            for (int j = 0; j < Width; j++) {
                sumArray[i + 1, j + 1] = sumArray[i, j + 1] + sumArray[i + 1, j] - sumArray[i, j] + array[i, j];
            }
        }
    }

    public long Sum(int beginRow, int endRow, int beginCol, int endCol) {
        return sumArray[endRow, endCol]
            - sumArray[beginRow, endCol]
            - sumArray[endRow, beginCol]
            + sumArray[beginRow, beginCol];
    }
}
// PREWRITEN CODE BEGINS FROM HERE

static public class StringExtensions {
    static public string JoinToString<T>(this IEnumerable<T> source, string separator = " ") {
        return string.Join(separator, source);
    }
}

internal partial class Solver : Scanner {
    public static void Main() {
#if LOCAL
        byte[] inputBuffer = new byte[1000000];
        var inputStream = Console.OpenStandardInput(inputBuffer.Length);
        using (var reader = new StreamReader(inputStream, Console.InputEncoding, false, inputBuffer.Length)) {
            Console.SetIn(reader);
            new Solver(Console.In, Console.Out).Run();
        }
#else
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver(Console.In, Console.Out).Run();
        Console.Out.Flush();
#endif
    }

#pragma warning disable IDE0052
    private readonly TextReader cin;
    private readonly TextWriter cout;
    private readonly TextWriter cerr;
#pragma warning restore IDE0052

    public Solver(TextReader reader, TextWriter writer)
        : base(reader) {
        cin = reader;
        cout = writer;
        cerr = Console.Error;
    }

    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer) {
    }

#pragma warning disable IDE1006
#pragma warning disable IDE0051
    private int ni() { return NextInt(); }
    private int[] ni(int n) { return NextIntArray(n); }
    private long nl() { return NextLong(); }
    private long[] nl(int n) { return NextLongArray(n); }
    private double nd() { return NextDouble(); }
    private double[] nd(int n) { return NextDoubleArray(n); }
    private string ns() { return Next(); }
    private string[] ns(int n) { return NextArray(n); }
#pragma warning restore IDE1006
#pragma warning restore IDE0051
}

#if DEBUG
internal static class LinqPadExtension {
    public static string TextDump<T>(this T obj) {
        if (obj is IEnumerable) return (obj as IEnumerable).Cast<object>().JoinToString().Dump();
        else return obj.ToString().Dump();
    }
    public static T Dump<T>(this T obj) {
        return LINQPad.Extensions.Dump(obj);
    }
}
#endif

public class Scanner {
    private readonly TextReader Reader;
    private readonly CultureInfo ci = CultureInfo.InvariantCulture;

    private readonly char[] buffer = new char[2 * 1024];
    private int cursor = 0, length = 0;
    private string Token;
    private readonly StringBuilder sb = new StringBuilder(1024);

    public Scanner()
        : this(Console.In) {
    }

    public Scanner(TextReader reader) {
        Reader = reader;
    }

    public int NextInt() { return checked((int)NextLong()); }
    public long NextLong() {
        var s = Next();
        long r = 0;
        int i = 0;
        bool negative = false;
        if (s[i] == '-') {
            negative = true;
            i++;
        }
        for (; i < s.Length; i++) {
            r = r * 10 + (s[i] - '0');
#if DEBUG
            if (!char.IsDigit(s[i])) throw new FormatException();
#endif
        }
        return negative ? -r : r;
    }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size) {
        string[] array = new string[size];
        for (int i = 0; i < size; i++) {
            array[i] = Next();
        }

        return array;
    }
    public int[] NextIntArray(int size) {
        int[] array = new int[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextInt();
        }

        return array;
    }

    public long[] NextLongArray(int size) {
        long[] array = new long[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextLong();
        }

        return array;
    }

    public double[] NextDoubleArray(int size) {
        double[] array = new double[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextDouble();
        }

        return array;
    }

    public string Next() {
        if (Token == null) {
            if (!StockToken()) {
                throw new Exception();
            }
        }
        var token = Token;
        Token = null;
        return token;
    }

    public bool HasNext() {
        if (Token != null) {
            return true;
        }

        return StockToken();
    }

    private bool StockToken() {
        while (true) {
            sb.Clear();
            while (true) {
                if (cursor >= length) {
                    cursor = 0;
                    if ((length = Reader.Read(buffer, 0, buffer.Length)) <= 0) {
                        break;
                    }
                }
                var c = buffer[cursor++];
                if (33 <= c && c <= 126) {
                    sb.Append(c);
                } else {
                    if (sb.Length > 0) break;
                }
            }

            if (sb.Length > 0) {
                Token = sb.ToString();
                return true;
            }

            return false;
        }
    }
}