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)

#[allow(unused_macros)]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        let mut next = || { iter.next().unwrap() };
        input_inner!{next, $($r)*}
    };
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes
                .by_ref()
                .map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};

    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };

    ($next:expr, mut $var:ident : $t:tt $($r:tt)*) => {
        let mut $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };

    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };

    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, bytes) => {
        read_value!($next, String).into_bytes()
    };

    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };

    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}

#[allow(unused_imports)]
use std::cmp::{max, min};
#[allow(unused_imports)]
use std::collections::{BinaryHeap, HashMap};

#[allow(dead_code)]
type Graph = Vec<Vec<usize>>;

fn main() {
    input! {
        n: usize,
        points: [(f64, f64, chars); n],
    }

    let points = points
        .into_iter()
        .map(|(x, y, chars)| (x, y, chars[0]))
        .collect::<Vec<_>>();

    let xf = |t: f64| {
        let mut maxv = 0.0;
        let mut minv = 1e30;
        for &(x, _, c) in &points {
            let v = match c {
                'R' => x + t,
                'L' => x - t,
                _ => x,
            };
            maxv = if v > maxv { v } else { maxv };
            minv = if v < minv { v } else { minv };
        }
        maxv - minv
    };

    let yf = |t: f64| {
        let mut maxv = -1e30;
        let mut minv = 1e30;
        for &(_, y, c) in &points {
            let v = match c {
                'U' => y + t,
                'D' => y - t,
                _ => y,
            };
            maxv = if v > maxv { v } else { maxv };
            minv = if v < minv { v } else { minv };
        }
        maxv - minv
    };

    let mut times = vec![0.0];

    let lx = points
        .iter()
        .filter(|&&(_, _, c)| c == 'R')
        .map(|&(x, _, _)| x)
        .min_by_key(|&x| x as usize);

    if let Some(lx) = lx {
        for &(x, _, c) in &points {
            let t = match c {
                'L' => Some((x - lx).abs() / 2.0),
                'R' => None,
                _ => Some((x - lx).abs()),
            };
            if let Some(t) = t {
                times.push(t);
            }
        }
    }

    let rx = points
        .iter()
        .filter(|&&(_, _, c)| c == 'L')
        .map(|&(x, _, _)| x)
        .max_by_key(|&x| x as i64);

    if let Some(rx) = rx {
        for &(x, _, c) in &points {
            let t = match c {
                'R' => Some((x - rx).abs() / 2.0),
                'L' => None,
                _ => Some((x - rx).abs()),
            };
            if let Some(t) = t {
                times.push(t);
            }
        }
    }

    let uy = points
        .iter()
        .filter(|&&(_, _, c)| c == 'D')
        .map(|&(_, y, _)| y)
        .max_by_key(|&x| x as i64);

    if let Some(uy) = uy {
        for &(_, y, c) in &points {
            let t = match c {
                'U' => Some((y - uy).abs() / 2.0),
                'D' => None,
                _ => Some((y - uy).abs()),
            };
            if let Some(t) = t {
                times.push(t);
            }
        }
    }

    let dy = points
        .iter()
        .filter(|&&(_, _, c)| c == 'U')
        .map(|&(_, y, _)| y)
        .min_by_key(|&x| x as i64);

    if let Some(dy) = dy {
        for &(_, y, c) in &points {
            let t = match c {
                'D' => Some((y - dy).abs() / 2.0),
                'U' => None,
                _ => Some((y - dy).abs()),
            };
            if let Some(t) = t {
                times.push(t);
            }
        }
    }

    // println!("{:?} {:?} {:?} {:?}", rx, lx, uy, dy);
    // println!("{:?}", times);

    let mut ans = 1e30;
    for t in times {
        let v = xf(t) * yf(t);
        if v < ans {
            ans = v;
        }
    }

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