Problem:
Score : 600 points

Problem Statement

There are N points in a two-dimensional plane. The initial coordinates of the i-th point are (x_i, y_i). Now, each point starts moving at a speed of 1 per second, in a direction parallel to the x- or y- axis. You are given a character d_i that represents the specific direction in which the i-th point moves, as follows:

If d_i = R, the i-th point moves in the positive x direction;

If d_i = L, the i-th point moves in the negative x direction;

If d_i = U, the i-th point moves in the positive y direction;

If d_i = D, the i-th point moves in the negative y direction.

You can stop all the points at some moment of your choice after they start moving (including the moment they start moving).
Then, let x_{max} and x_{min} be the maximum and minimum among the x-coordinates of the N points, respectively. Similarly, let y_{max} and y_{min} be the maximum and minimum among the y-coordinates of the N points, respectively.

Find the minimum possible value of (x_{max} - x_{min}) \times (y_{max} - y_{min}) and print it.

Constraints

1 \leq N \leq 10^5

-10^8 \leq x_i,\ y_i \leq 10^8

x_i and y_i are integers.

d_i is R, L, U, or D.

Input

Input is given from Standard Input in the following format:

N
x_1 y_1 d_1
x_2 y_2 d_2
.
.
.
x_N y_N d_N

Output

Print the minimum possible value of (x_{max} - x_{min}) \times (y_{max} - y_{min}).

The output will be considered correct when its absolute or relative error from the judge's output is at most 10^{-9}.

Sample Input 1

2
0 3 D
3 0 L

Sample Output 1

0

After three seconds, the two points will meet at the origin. The value in question will be 0 at that moment.

Sample Input 2

5
-7 -10 U
7 -6 U
-8 7 D
-3 3 D
0 -6 R

Sample Output 2

97.5

The answer may not be an integer.

Sample Input 3

20
6 -10 R
-4 -9 U
9 6 D
-3 -2 R
0 7 D
4 5 D
10 -10 U
-1 -8 U
10 -6 D
8 -5 U
6 4 D
0 3 D
7 9 R
9 -4 R
3 10 D
1 9 U
1 -6 U
9 -8 R
6 7 D
7 -3 D

Sample Output 3

273

Solution in Rust (1.15.1) (judge verdict: Wrong Answer)

const INF: f64 = 1e15;
fn main() {
    let s = std::io::stdin();
    let mut sc = Scanner { stdin: s.lock() };

    let mut const_x = Range::new();
    let mut const_y = Range::new();

    let mut up_x = Range::new();
    let mut down_x = Range::new();

    let mut up_y = Range::new();
    let mut down_y = Range::new();

    let n: usize = sc.read();
    for _ in 0..n {
        let x: f64 = sc.read();
        let y: f64 = sc.read();
        let d = sc.chars()[0];
        match d {
            'R' => {
                const_y.set(y);
                up_x.set(x);
            }
            'L' => {
                const_y.set(y);
                down_x.set(x);
            }
            'U' => {
                const_x.set(x);
                up_y.set(y);
            }
            'D' => {
                const_x.set(x);
                down_y.set(y);
            }
            _ => unreachable!(),
        }
    }

    let mut times = vec![0.0];
    add_time3(const_x, up_x, down_x, &mut times);
    add_time3(const_y, up_y, down_y, &mut times);

    let candidates = times
        .into_iter()
        .map(|time| {
            let dx = length(const_x, up_x, down_x, time);
            let dy = length(const_y, up_y, down_y, time);
            dx * dy
        })
        .collect::<Vec<_>>();

    let mut ans = INF;
    for c in candidates.into_iter() {
        if ans > c {
            ans = c;
        }
    }

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

fn add_time3(const_y: Range, up_y: Range, down_y: Range, times: &mut Vec<f64>) {
    add_time2(up_y, const_y, 1.0, times);
    add_time2(up_y, down_y, 2.0, times);
    add_time2(const_y, down_y, 1.0, times);
}

fn add_time2(up: Range, down: Range, step: f64, times: &mut Vec<f64>) {
    add_time(up.max, down.max, step, times);
    add_time(up.max, down.min, step, times);
    add_time(up.min, down.max, step, times);
    add_time(up.min, down.min, step, times);
}

fn add_time(up: f64, down: f64, step: f64, times: &mut Vec<f64>) {
    if up.is_finite() && down.is_finite() && up < down {
        times.push((down - up) / step);
    }
}

fn length(const_y: Range, up_y: Range, down_y: Range, time: f64) -> f64 {
    const_y.add(up_y.at(time)).add(down_y.at(-time)).dist()
}

#[derive(Copy, Clone)]
struct Range {
    max: f64,
    min: f64,
}

impl Range {
    fn new() -> Self {
        Range {
            min: std::f64::INFINITY,
            max: std::f64::NEG_INFINITY,
        }
    }

    fn set(&mut self, v: f64) {
        self.min = self.min.min(v);
        self.max = self.max.max(v);
    }

    fn at(&self, time: f64) -> Self {
        Range {
            min: self.min + time,
            max: self.max + time,
        }
    }

    fn add(&self, other: Range) -> Self {
        Range {
            max: self.max.max(other.max),
            min: self.min.min(other.min),
        }
    }

    fn dist(&self) -> f64 {
        assert!(self.max.is_finite());
        assert!(self.min.is_finite());
        self.max - self.min
    }
}

pub struct Scanner<R> {
    stdin: R,
}

impl<R: std::io::Read> Scanner<R> {
    pub fn read<T: std::str::FromStr>(&mut self) -> T {
        use std::io::Read;
        let buf = self
            .stdin
            .by_ref()
            .bytes()
            .map(|b| b.unwrap())
            .skip_while(|&b| b == b' ' || b == b'\n')
            .take_while(|&b| b != b' ' && b != b'\n')
            .collect::<Vec<_>>();
        unsafe { std::str::from_utf8_unchecked(&buf) }
            .parse()
            .ok()
            .expect("Parse error.")
    }
    pub fn vec<T: std::str::FromStr>(&mut self, n: usize) -> Vec<T> {
        (0..n).map(|_| self.read()).collect()
    }
    pub fn chars(&mut self) -> Vec<char> {
        self.read::<String>().chars().collect()
    }
}