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)

fn main() {
    let s = std::io::stdin();
    let mut sc = Scanner { stdin: s.lock() };
    let n: usize = sc.read();

    let mut left = State::new();
    let mut right = State::new();
    let mut top = State::new();
    let mut bottom = State::new();

    for _ in 0..n {
        let x: f64 = sc.read();
        let y: f64 = sc.read();
        let c = sc.chars()[0];
        match c {
            'R' => {
                right.put_increasing(x);
                left.put_decreasing(-x);
                top.put_static(y);
                bottom.put_static(-y);
            }
            'L' => {
                right.put_decreasing(x);
                left.put_increasing(-x);
                top.put_static(y);
                bottom.put_static(-y);
            }
            'D' => {
                top.put_decreasing(y);
                bottom.put_increasing(-y);
                right.put_static(x);
                left.put_static(-x);
            }
            'U' => {
                top.put_increasing(y);
                bottom.put_decreasing(-y);
                right.put_static(x);
                left.put_static(-x);
            }
            _ => unreachable!(),
        }
    }

    let mut events = top.get_events();
    events.extend(bottom.get_events());
    events.extend(left.get_events());
    events.extend(right.get_events());
    events.push(0.0);

    let mut ans = std::f64::MAX;
    for t in events.into_iter() {
        let right = right.get_value(t);
        let left = left.get_value(t);
        let top = top.get_value(t);
        let bottom = bottom.get_value(t);
        let s = (left + right).abs() * (top + bottom).abs();
        ans = ans.min(s);
    }
    println!("{}", ans);
}

struct State {
    decreasing: f64,
    increasing: f64,
    static_point: f64,
}

impl State {
    fn new() -> State {
        State {
            decreasing: std::f64::MIN,
            increasing: std::f64::MIN,
            static_point: std::f64::MIN,
        }
    }

    fn put_static(&mut self, p: f64) {
        self.static_point = self.static_point.max(p);
    }
    fn put_increasing(&mut self, p: f64) {
        self.increasing = self.increasing.max(p);
    }
    fn put_decreasing(&mut self, p: f64) {
        self.decreasing = self.decreasing.max(p);
    }

    fn get_events(&self) -> Vec<f64> {
        let mut result = vec![];
        if self.decreasing != std::f64::MIN && self.static_point != std::f64::MIN {
            result.push(self.decreasing - self.static_point);
        }
        if self.static_point != std::f64::MIN && self.increasing != std::f64::MIN {
            result.push(self.static_point - self.increasing);
        }
        if self.decreasing != std::f64::MIN && self.increasing != std::f64::MIN {
            result.push((self.decreasing - self.increasing) / 2.0);
        }
        result
    }

    fn get_value(&self, t: f64) -> f64 {
        let v1 = self.decreasing - t;
        let v2 = self.increasing + t;
        let v3 = self.static_point;
        v1.max(v2).max(v3)
    }
}

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()
    }
}