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::{Ordering};

#[allow(unused_imports)]
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque};

#[allow(unused_imports)]
use std::io::{stdin, stdout, BufWriter, Write};

#[allow(unused_imports)]
use std::iter::FromIterator;

#[allow(unused_macros)]
macro_rules! min {
    ($x: expr) => ($x);
    ($x: expr, $($z: expr),+) => {{
        std::cmp::min($x, min!($($z),*))
    }}
}

#[allow(unused_macros)]
macro_rules! max {
    ($x: expr) => ($x);
    ($x: expr, $($z: expr),+) => {{
        std::cmp::max($x, max!($($z),*))
    }}
}

#[allow(unused_macros)]
macro_rules! get { 
    ([$t: ty]) => { 
        { 
            let mut line = String::new(); 
            stdin().read_line(&mut line).unwrap(); 
            line.split_whitespace().map(|t|t.parse::<$t>().unwrap()).collect::<Vec<_>>()
        }
    };
    ([$t: ty];$n: expr) => {
        (0..$n).map(|_|get!([$t])).collect::<Vec<_>>()
    };
    ($t: ty) => {
        {
            let mut line = String::new();
            stdin().read_line(&mut line).unwrap();
            line.trim().parse::<$t>().unwrap()
        }
    };
    ($($t: ty),*) => {
        { 
            let mut line = 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<_>>()
    };
}

#[allow(unused_macros)]
macro_rules! debug {
    ($($a:expr),*) => {
        #[cfg(debug_assertions)]
        writeln!(&mut std::io::stderr(), concat!("[DEBUG] ", $(stringify!($a), "={:?} "),*), $($a),*).unwrap();
    }
}

const BIG_STACK_SIZE: bool = true;

#[allow(dead_code)]
fn main() {
    use std::thread;
    if BIG_STACK_SIZE {
        thread::Builder::new()
            .stack_size(32 * 1024 * 1024)
            .name("solve".into())
            .spawn(solve)
            .unwrap()
            .join()
            .unwrap();
    } else {
        solve();
    }
}

fn solve() {
    let (n,k) = get!(usize, usize);
    let xyc = get!(usize, usize, String; n);

    let (white, black): (Vec<_>, Vec<_>) = xyc.into_iter()
        .map(|(x,y,c)| (x,y,c.chars().next().unwrap()=='W'))
        .map(|(x,y,c)| (x%(2*k),y%(2*k),c))
        .map(|(x,y,c)| if x>=k && y>=k {
            (x-k,y-k,c)
        } else if x<k && y>=k {
            (x+k,y-k,c)
        } else {
            (x,y,c)
        })
        .partition(|&(x,y,c)| x<k);
    let black = black.into_iter().map(|(x,y,c)| (x-k,y,c)).collect::<Vec<_>>();

    let mut wa = vec![vec![None; k];k];
    let mut ba = vec![vec![None; k];k];
    for (x,y,c) in white {
        wa[x][y] = Some(c);
    }
    for (x,y,c) in black {
        ba[x][y] = Some(c);
    }
    let mut wsums = vec![vec![vec![0;2];k+1];k+1];
    let mut bsums = vec![vec![vec![0;2];k+1];k+1];
    for i in 0..k {
        for j in 0..k {
            if let Some(b) = wa[i][j] {
                if b {
                    wsums[i+1][j+1][1] = wsums[i+1][j][1]+1;
                    wsums[i+1][j+1][0] = wsums[i+1][j][0];
                } else {
                    wsums[i+1][j+1][0] = wsums[i+1][j][0]+1;
                    wsums[i+1][j+1][1] = wsums[i+1][j][1];
                }
            } else {
                for l in 0..2 {
                    wsums[i+1][j+1][l] = wsums[i+1][j][l];
                }
            }
            if let Some(b) = ba[i][j] {
                if !b {
                    bsums[i+1][j+1][1] = bsums[i+1][j][1]+1;
                    bsums[i+1][j+1][0] = bsums[i+1][j][0];
                } else {
                    bsums[i+1][j+1][0] = bsums[i+1][j][0]+1;
                    bsums[i+1][j+1][1] = bsums[i+1][j][1];
                }
            } else {
                for l in 0..2 {
                    bsums[i+1][j+1][l] = bsums[i+1][j][l];
                }
            }
        }
        for j in 0..k+1 {
            for l in 0..2 {
                wsums[i+1][j][l] += wsums[i][j][l];
                bsums[i+1][j][l] += bsums[i][j][l];
            }
        }
    }

    let mut mx = 0;
    for i in 0..k+1 {
        for j in 0..k+1 {
            let wval = wsums[k][k][1]+2*wsums[i][j][1]-wsums[i][k][1]-wsums[k][j][1]
                +wsums[i][k][0]+wsums[k][j][0]-2*wsums[i][j][0];
            let bval = bsums[k][k][1]+2*bsums[i][j][1]-bsums[i][k][1]-bsums[k][j][1]
                + bsums[i][k][0]+bsums[k][j][0]-2*bsums[i][j][0];
            let val = wval+bval;
            mx = max!(mx,val,n-val);
        }
    }
    println!("{}", mx);
}