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: Accepted)

macro_rules ! input { ( source = $ s : expr , $ ( $ r : tt ) * ) => { let mut iter = $ s . split_whitespace ( ) ; input_inner ! { iter , $ ( $ r ) * } } ; ( iter = $ iter : ident , $ ( $ r : tt ) * ) => { let s = { use std :: io :: Read ; let mut s = String :: new ( ) ; std :: io :: stdin ( ) . read_to_string ( & mut s ) . unwrap ( ) ; s } ; let mut $ iter = s . split_whitespace ( ) ; input_inner ! { $ iter , $ ( $ r ) * } } ; ( $ ( $ r : tt ) * ) => { let s = { use std :: io :: Read ; let mut s = String :: new ( ) ; std :: io :: stdin ( ) . read_to_string ( & mut s ) . unwrap ( ) ; s } ; let mut iter = s . split_whitespace ( ) ; input_inner ! { iter , $ ( $ r ) * } } ; }
macro_rules ! input_inner { ( $ iter : expr ) => { } ; ( $ iter : expr , ) => { } ; ( $ iter : expr , mut $ var : ident : $ t : tt $ ( $ r : tt ) * ) => { let mut $ var = read_value ! ( $ iter , $ t ) ; input_inner ! { $ iter $ ( $ r ) * } } ; ( $ iter : expr , mut $ var : ident $ ( $ r : tt ) * ) => { input_inner ! { $ iter , mut $ var : usize $ ( $ r ) * } } ; ( $ iter : expr , $ var : ident : $ t : tt $ ( $ r : tt ) * ) => { let $ var = read_value ! ( $ iter , $ t ) ; input_inner ! { $ iter $ ( $ r ) * } } ; ( $ iter : expr , $ var : ident $ ( $ r : tt ) * ) => { input_inner ! { $ iter , $ var : usize $ ( $ r ) * } } ; }
macro_rules ! read_value { ( $ iter : expr , ( $ ( $ t : tt ) ,* ) ) => { ( $ ( read_value ! ( $ iter , $ t ) ) ,* ) } ; ( $ iter : expr , [ $ t : tt ; $ len : expr ] ) => { ( 0 ..$ len ) . map ( | _ | read_value ! ( $ iter , $ t ) ) . collect ::< Vec < _ >> ( ) } ; ( $ iter : expr , { chars : $ base : expr } ) => { read_value ! ( $ iter , String ) . chars ( ) . map ( | c | ( c as u8 - $ base as u8 ) as usize ) . collect ::< Vec < usize >> ( ) } ; ( $ iter : expr , { char : $ base : expr } ) => { read_value ! ( $ iter , { chars : $ base } ) [ 0 ] } ; ( $ iter : expr , chars ) => { read_value ! ( $ iter , String ) . chars ( ) . collect ::< Vec < char >> ( ) } ; ( $ iter : expr , char ) => { read_value ! ( $ iter , chars ) [ 0 ] } ; ( $ iter : expr , usize1 ) => { read_value ! ( $ iter , usize ) - 1 } ; ( $ iter : expr , $ t : ty ) => { $ iter . next ( ) . unwrap ( ) . parse ::<$ t > ( ) . unwrap ( ) } ; }
use std::cmp::{max, min};
fn main() {
    input! { n, xyd: [(i64, i64, char); n] };
    let mut ans = std::i64::MAX;
    let mut ts = vec![0];
    let mut xs = vec![vec![], vec![], vec![]];
    let mut ys = vec![vec![], vec![], vec![]];
    for &(x, y, d) in &xyd {
        let i = match d {
            'R' => 0,
            'L' => 2,
            _ => 1,
        };
        xs[i].push(x);
        let j = match d {
            'U' => 0,
            'D' => 2,
            _ => 1,
        };
        ys[j].push(y);
    }
    if let Some(x1) = xs[0].iter().max() {
        if let Some(x2) = xs[1].iter().max() {
            ts.push((x2 - x1) * 2);
        }
    }
    if let Some(x1) = xs[1].iter().max() {
        if let Some(x2) = xs[2].iter().max() {
            ts.push((x2 - x1) * 2);
        }
    }
    if let Some(x1) = xs[0].iter().max() {
        if let Some(x2) = xs[2].iter().max() {
            ts.push(x2 - x1);
        }
    }
    if let Some(x1) = xs[0].iter().min() {
        if let Some(x2) = xs[1].iter().min() {
            ts.push((x2 - x1) * 2);
        }
    }
    if let Some(x1) = xs[1].iter().min() {
        if let Some(x2) = xs[2].iter().min() {
            ts.push((x2 - x1) * 2);
        }
    }
    if let Some(x1) = xs[0].iter().min() {
        if let Some(x2) = xs[2].iter().min() {
            ts.push(x2 - x1);
        }
    }

    if let Some(y1) = ys[0].iter().max() {
        if let Some(y2) = ys[1].iter().max() {
            ts.push((y2 - y1) * 2);
        }
    }
    if let Some(y1) = ys[1].iter().max() {
        if let Some(y2) = ys[2].iter().max() {
            ts.push((y2 - y1) * 2);
        }
    }
    if let Some(y1) = ys[0].iter().max() {
        if let Some(y2) = ys[2].iter().max() {
            ts.push(y2 - y1);
        }
    }
    if let Some(y1) = ys[0].iter().min() {
        if let Some(y2) = ys[1].iter().min() {
            ts.push((y2 - y1) * 2);
        }
    }
    if let Some(y1) = ys[1].iter().min() {
        if let Some(y2) = ys[2].iter().min() {
            ts.push((y2 - y1) * 2);
        }
    }
    if let Some(y1) = ys[0].iter().min() {
        if let Some(y2) = ys[2].iter().min() {
            ts.push(y2 - y1);
        }
    }

    for t in ts.into_iter() {
        if t < 0 {
            continue;
        }
        let mut xmin = std::i64::MAX;
        let mut xmax = std::i64::MIN;
        let mut ymin = std::i64::MAX;
        let mut ymax = std::i64::MIN;
        for &(x, y, d) in &xyd {
            let (x, y) = match d {
                'R' => (2 * x + t, 2 * y),
                'L' => (2 * x - t, 2 * y),
                'U' => (2 * x, 2 * y + t),
                'D' => (2 * x, 2 * y - t),
                _ => unimplemented!(),
            };
            xmin = min(xmin, x);
            xmax = max(xmax, x);
            ymin = min(ymin, y);
            ymax = max(ymax, y);
        }
        ans = min(ans, (xmax - xmin) * (ymax - ymin));
    }
    println!("{}", ans as f64 / 4.);
}