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 Rust (1.15.1) (judge verdict: Wrong Answer)

#[allow(unused_imports)]
use std::cmp::{max, min, Ordering};
#[allow(unused_imports)]
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque};
#[allow(unused_imports)]
use std::iter::FromIterator;
#[allow(unused_imports)]
use std::io::{stdin, stdout, BufWriter, Write};
mod util {
    use std::io::stdin;
    use std::str::FromStr;
    use std::fmt::Debug;
    #[allow(dead_code)]
    pub fn line() -> String {
        let mut line: String = String::new();
        stdin().read_line(&mut line).unwrap();
        line.trim().to_string()
    }
    #[allow(dead_code)]
    pub fn gets<T: FromStr>() -> Vec<T>
    where
        <T as FromStr>::Err: Debug,
    {
        let mut line: String = String::new();
        stdin().read_line(&mut line).unwrap();
        line.split_whitespace()
            .map(|t| t.parse().unwrap())
            .collect()
    }
}
#[allow(unused_macros)]
macro_rules ! get { ( $ t : ty ) => { { let mut line : String = String :: new ( ) ; stdin ( ) . read_line ( & mut line ) . unwrap ( ) ; line . trim ( ) . parse ::<$ t > ( ) . unwrap ( ) } } ; ( $ ( $ t : ty ) ,* ) => { { let mut line : String = String :: new ( ) ; stdin ( ) . read_line ( & mut line ) . unwrap ( ) ; let mut iter = line . split_whitespace ( ) ; ( $ ( iter . next ( ) . unwrap ( ) . parse ::<$ t > ( ) . unwrap ( ) , ) * ) } } ; ( $ t : ty ; $ n : expr ) => { ( 0 ..$ n ) . map ( | _ | get ! ( $ t ) ) . collect ::< Vec < _ >> ( ) } ; ( $ ( $ t : ty ) ,*; $ n : expr ) => { ( 0 ..$ n ) . map ( | _ | get ! ( $ ( $ t ) ,* ) ) . collect ::< Vec < _ >> ( ) } ; ( $ t : ty ;; ) => { { let mut line : String = String :: new ( ) ; stdin ( ) . read_line ( & mut line ) . unwrap ( ) ; line . split_whitespace ( ) . map ( | t | t . parse ::<$ t > ( ) . unwrap ( ) ) . collect ::< Vec < _ >> ( ) } } ; }
#[allow(unused_macros)]
macro_rules ! debug { ( $ ( $ a : expr ) ,* ) => { println ! ( concat ! ( $ ( stringify ! ( $ a ) , " = {:?}, " ) ,* ) , $ ( $ a ) ,* ) ; } }

fn main() {
    let (n, k) = get!(usize, i64);
    let xyc = get!(i64, i64, String; n);
    let xy: Vec<(i64, i64)> = xyc.into_iter()
        .map(|(x, y, c)| if c == "W" { (x, y + k) } else { (x, y) })
        .map(|(x, y)| (x % (2 * k), y % (2 * k)))
        .collect();

    let mut imos = vec![vec![0; 2 * k as usize + 1]; 2 * k as usize + 1];

    for &(x, y) in &xy {
        let l = max(x - k + 1, 0);
        let r = min(x, l + k - 1);
        let b = max(y - k + 1, 0);
        let u = min(y, b + k - 1);

        imos[b as usize][l as usize] += 1;
        imos[u as usize + 1][r as usize + 1] += 1;
        imos[b as usize][r as usize + 1] -= 1;
        imos[u as usize + 1][l as usize] -= 1;
    }

    // ru
    for &(x, y) in &xy {
        if x < k || y < k {
            continue;
        }

        let l = 0;
        let r = x - k;
        let b = 0;
        let u = y - k;
        imos[b as usize][l as usize] += 1;
        imos[u as usize + 1][r as usize + 1] += 1;
        imos[b as usize][r as usize + 1] -= 1;
        imos[u as usize + 1][l as usize] -= 1;
    }

    // lu
    for &(x, y) in &xy {
        if y < k {
            continue;
        }

        let l = x + 1;
        let r = min(l + k - 1, 2 * k - 1);
        let b = 0;
        let u = y - k;
        imos[b as usize][l as usize] += 1;
        imos[u as usize + 1][r as usize + 1] += 1;
        imos[b as usize][r as usize + 1] -= 1;
        imos[u as usize + 1][l as usize] -= 1;
    }

    // rb
    for &(x, y) in &xy {
        if x < k {
            continue;
        }

        let l = 0;
        let r = x - k;
        let b = y + 1;
        let u = min(b + k - 1, 2 * k - 1);
        imos[b as usize][l as usize] += 1;
        imos[u as usize + 1][r as usize + 1] += 1;
        imos[b as usize][r as usize + 1] -= 1;
        imos[u as usize + 1][l as usize] -= 1;
    }

    // lb
    for &(x, y) in &xy {
        if x == 2 * k - 1 || y == 2 * k - 1 {
            continue;
        }

        let l = x + 1;
        let r = min(l + k - 1, 2 * k - 1);
        let b = y + 1;
        let u = min(b + k - 1, 2 * k - 1);
        imos[b as usize][l as usize] += 1;
        imos[u as usize + 1][r as usize + 1] += 1;
        imos[b as usize][r as usize + 1] -= 1;
        imos[u as usize + 1][l as usize] -= 1;
    }

    let mut ans = 0;
    for i in 0..2 * k as usize + 1 {
        let mut sum = 0;
        for j in 0..2 * k as usize + 1 {
            sum += imos[i][j];
            ans = max(ans, sum);
            imos[i][j] = sum;
        }
    }

    for i in 0..2 * k as usize + 1 {
        let mut sum = 0;
        for j in 0..2 * k as usize + 1 {
            sum += imos[j][i];
            ans = max(ans, sum);
            imos[j][i] = sum;
        }
    }

    println!("{}", ans);
}