Problem:
Score: 600 points

Problem Statement

M-kun is a brilliant air traffic controller.

On the display of his radar, there are N airplanes numbered 1, 2, ..., N, all flying at the same altitude.

Each of the airplanes flies at a constant speed of 0.1 per second in a constant direction. The current coordinates of the airplane numbered i are (X_i, Y_i), and the direction of the airplane is as follows:

if U_i is U, it flies in the positive y direction;

if U_i is R, it flies in the positive x direction;

if U_i is D, it flies in the negative y direction;

if U_i is L, it flies in the negative x direction.

To help M-kun in his work, determine whether there is a pair of airplanes that will collide with each other if they keep flying as they are now.

If there is such a pair, find the number of seconds after which the first collision will happen.

We assume that the airplanes are negligibly small so that two airplanes only collide when they reach the same coordinates simultaneously.

Constraints

1 \leq N \leq 200000

0 \leq X_i, Y_i \leq 200000

U_i is U, R, D, or L.

The current positions of the N airplanes, (X_i, Y_i), are all distinct.

N, X_i, and Y_i are integers.

Input

Input is given from Standard Input in the following format:

N
X_1 Y_1 U_1
X_2 Y_2 U_2
X_3 Y_3 U_3
:
X_N Y_N U_N

Output

If there is a pair of airplanes that will collide with each other if they keep flying as they are now, print an integer representing the number of seconds after which the first collision will happen.

If there is no such pair, print SAFE.

Sample Input 1

2
11 1 U
11 47 D

Sample Output 1

230

If the airplanes keep flying as they are now, two airplanes numbered 1 and 2 will reach the coordinates (11, 24) simultaneously and collide.

Sample Input 2

4
20 30 U
30 20 R
20 10 D
10 20 L

Sample Output 2

SAFE

No pair of airplanes will collide.

Sample Input 3

8
168 224 U
130 175 R
111 198 D
121 188 L
201 116 U
112 121 R
145 239 D
185 107 L

Sample Output 3

100

Solution in Rust (1.42.0) (judge verdict: Time Limit Exceeded)

#![allow(
    non_snake_case,
    unused_variables,
    unused_assignments,
    unused_mut,
    unused_imports,
    dead_code
)]
//use proconio::fastout;
use proconio::input;
use proconio::marker::*;
use std::cmp::*;
use std::collections::*;
//use std::collections::VecDeque;

fn main() {
    input! {
       N:usize,
       XYD:[(i64,i64,char);N]
    }
    // 飛行機を方向ごとに分類。
    let mut U = Vec::with_capacity(N);
    let mut R = Vec::with_capacity(N);
    let mut D = Vec::with_capacity(N);
    let mut L = Vec::with_capacity(N);
    for &(x, y, d) in XYD.iter() {
        match d {
            'U' => U.push(vec![x, y, x + y, x - y]),
            'D' => D.push(vec![x, y, x + y, x - y]),
            'L' => L.push(vec![x, y, x + y, x - y]),
            'R' => R.push(vec![x, y, x + y, x - y]),
            _ => (),
        }
    }
    let mut ans = std::i64::MAX;
    ans = calc(ans, &mut U, &mut D, 0, "UD");
    ans = calc(ans, &mut L, &mut R, 1, "LR");
    // U と R (Ux > Rx + n && Uy + n < Ry), Ux-Rx == Ry-Uy, Ux+Uy==Ry-Rx
    // U と L (Ux < Lx && Uy < Ly), Lx-Ux == Ly-Uy, Ux-Uy == Lx-Ly
    // D と R (Dx > Rx && Dy > Ry), Dx-Rx == Dy-Ry, Dx-Dy == Rx-Ry
    // D と L (Dx < Lx && Dy > Ly), Lx-Dx == Dy-Ly, Dy+Dx == Ly+Lx
    ans = calc(ans, &mut U, &mut R, 2, "UR"); // ans = min(ans, (Ux - Rx) * 10);
    ans = calc(ans, &mut U, &mut L, 3, "UL"); //ans = min(ans, (Lx - Ux) * 10);
    ans = calc(ans, &mut D, &mut R, 3, "DR"); // ans = min(ans, (Dy - Ry) * 10);
    ans = calc(ans, &mut D, &mut L, 2, "DL"); //ans = min(ans, (Dy - Ly) * 10);

    if ans == std::i64::MAX {
        println!("SAFE");
    } else {
        println!("{}", ans);
    }
}

fn calc(ans: i64, A: &mut Vec<Vec<i64>>, B: &mut Vec<Vec<i64>>, p: usize, flag: &str) -> i64 {
    let mut ans = ans;
    A.sort_by_key(|v| v[p]);
    B.sort_by_key(|v| v[p]);
    let mut i = 0;
    let mut j = 0;
    while i < A.len() && j < B.len() {
        if A[i][p] < B[j][p] {
            i += 1;
            continue;
        }
        if A[i][p] > B[j][p] {
            j += 1;
            continue;
        }
        let v = A[i][p];
        let mut ii = i;
        let mut jj = j;
        while ii < A.len() && A[ii][p] == v {
            jj = j;
            while jj < B.len() && B[jj][p] == v {
                match flag {
                    "UD" => {
                        let t = B[jj][1] - A[ii][1];
                        if t >= 0 {
                            ans = min(ans, t * 5)
                        }
                    }
                    "LR" => {
                        let t = A[ii][0] - B[jj][0];
                        if t >= 0 {
                            ans = min(ans, t * 5)
                        }
                    }
                    "UR" => {
                        let t = A[ii][0] - B[jj][0];
                        if t >= 0 {
                            ans = min(ans, t * 10)
                        }
                    }
                    "UL" => {
                        let t = B[jj][0] - A[ii][0];
                        if t >= 0 {
                            ans = min(ans, t * 10)
                        }
                    }
                    "DR" => {
                        let t = A[ii][0] - B[jj][0];
                        if t >= 0 {
                            ans = min(ans, t * 10)
                        }
                    }
                    "DL" => {
                        let t = B[jj][0] - A[ii][0];
                        if t >= 0 {
                            ans = min(ans, t * 10)
                        }
                    }
                    _ => (),
                }
                jj += 1;
            }
            ii += 1;
        }
        i = ii;
        j = jj;
    }
    ans
}