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 C# (.NET Core 3.1.201) (judge verdict: Wrong Answer)

using System;
using System.Collections.Generic;
using System.Diagnostics;
using System.IO;
using System.IO.Pipes;
using System.Linq;
using System.Numerics;
using System.Reflection.Metadata;
using System.Runtime.CompilerServices;
using System.Runtime.InteropServices;
using System.Runtime.Intrinsics.X86;
using System.Text;
using System.Threading;

namespace AtCoder
{
	public class Program
	{
		static void Main()
		{
			var cin = new Scanner();
			int n = cin.Int();

			var pu = new HashMap<int, List<int>>(x => new List<int>());
			var pd = new HashMap<int, List<int>>(x => new List<int>());
			var pr = new HashMap<int, List<int>>(x => new List<int>());
			var pl = new HashMap<int, List<int>>(x => new List<int>());

			var prs = new List<(int x, int y)>();
			var pls = new List<(int x, int y)>();

			var uagari = new HashMap<int, List<int>>(x => new List<int>());
			var usagari = new HashMap<int, List<int>>(x => new List<int>());
			var dagari = new HashMap<int, List<int>>(x => new List<int>());
			var dsagari = new HashMap<int, List<int>>(x => new List<int>());
			for (int i = 0; i < n; i++) {
				int x = cin.Int();
				int y = cin.Int();
				char u = cin.Next()[0];

				switch (u) {
					case 'U':
						pu[x].Add(y);
						uagari[y - x].Add(x);
						usagari[y + x].Add(x);
						break;
					case 'D':
						pd[x].Add(y);
						dagari[y - x].Add(x);
						dsagari[y + x].Add(x);
						break;
					case 'L':
						pl[y].Add(x);
						pls.Add((x, y));
						break;
					case 'R':
						pl[y].Add(x);
						prs.Add((x, y));
						break;
					default:
						break;
				}
			}

			long ans = long.MaxValue;
			foreach (var upos in pu.Keys) {
				if (pd.ContainsKey(upos) == false) {
					continue;
				}

				var dds = pd[upos].OrderBy(x => x).ToArray();
				foreach (var uu in pu[upos]) {
					int ng = -1;
					int ok = dds.Length;
					while (ok - ng > 1) {
						int mid = (ok + ng) / 2;
						if (dds[mid] > uu) {
							ok = mid;
						} else {
							ng = mid;
						}
					}

					if (ok < dds.Length) {
						ans = Math.Min(ans, (dds[ok] - uu) * 5);
					}
				}
			}

			foreach (var rpos in pr.Keys) {
				if (pl.ContainsKey(rpos) == false) {
					continue;
				}

				var lls = pl[rpos].OrderBy(x => x).ToArray();
				foreach (var rr in pr[rpos]) {
					int ng = -1;
					int ok = lls.Length;
					while (ok - ng > 1) {
						int mid = (ok + ng) / 2;
						if (lls[mid] > rr) {
							ok = mid;
						} else {
							ng = mid;
						}
					}

					if (ok < lls.Length) {
						ans = Math.Min(ans, (lls[ok] - rr) * 5);
					}
				}
			}

			foreach (var key in dagari.Keys) {
				dagari[key].Sort();
			}

			foreach (var key in dsagari.Keys) {
				dsagari[key].Sort();
			}

			foreach (var key in uagari.Keys) {
				uagari[key].Sort();
			}

			foreach (var key in usagari.Keys) {
				usagari[key].Sort();
			}

			foreach (var rpos in prs) {
				int agari = rpos.y - rpos.x;
				int sagari = rpos.y + rpos.x;

				if (dagari.ContainsKey(agari)) {
					var da = dagari[agari];
					int ng = -1;
					int ok = da.Count;
					while (ok - ng > 1) {
						int mid = (ok + ng) / 2;
						if (da[mid] > rpos.x) {
							ok = mid;
						} else {
							ng = mid;
						}
					}

					if (ok < da.Count) {
						ans = Math.Min(ans, (da[ok] - rpos.x) * 10);
					}
				}

				if (usagari.ContainsKey(sagari)) {
					var ds = usagari[sagari];
					int ng = -1;
					int ok = ds.Count;
					while (ok - ng > 1) {
						int mid = (ok + ng) / 2;
						if (ds[mid] > rpos.x) {
							ok = mid;
						} else {
							ng = mid;
						}
					}

					if (ok < ds.Count) {
						ans = Math.Min(ans, (ds[ok] - rpos.x) * 10);
					}
				}
			}

			foreach (var lpos in pls) {
				int agari = lpos.y - lpos.x;
				int sagari = lpos.y + lpos.x;

				if (uagari.ContainsKey(agari)) {
					var ua = uagari[agari];
					int ok = -1;
					int ng = ua.Count;
					while (ng - ok > 1) {
						int mid = (ok + ng) / 2;
						if (ua[mid] < lpos.x) {
							ok = mid;
						} else {
							ng = mid;
						}
					}

					if (ok >= 0) {
						ans = Math.Min(ans, (lpos.x - ua[ok]) * 10);
					}
				}

				if (dsagari.ContainsKey(sagari)) {
					var ds = dsagari[sagari];
					int ok = -1;
					int ng = ds.Count;
					while (ng - ok > 1) {
						int mid = (ok + ng) / 2;
						if (ds[mid] < lpos.x) {
							ok = mid;
						} else {
							ng = mid;
						}
					}

					if (ok >= 0) {
						ans = Math.Min(ans, (lpos.x - ds[ok]) * 10);
					}
				}
			}

			if (ans == long.MaxValue) {
				Console.WriteLine("SAFE");
			} else {
				Console.WriteLine(ans);
			}
		}
	}

	public struct ModInt
	{
		public const long P = 1000000007;
		//public const long P = 998244353;

		public static ModInt Inverse(ModInt value) => Pow(value, P - 2);
		public static ModInt Pow(ModInt value, long k) => Pow(value.value_, k);
		public static ModInt Pow(long value, long k)
		{
			long ret = 1;
			for (k %= P - 1; k > 0; k >>= 1, value = value * value % P) {
				if ((k & 1) == 1) {
					ret = ret * value % P;
				}
			}
			return new ModInt(ret);
		}

		private long value_;

		public ModInt(long value)
			=> value_ = value;
		public ModInt(long value, bool mods)
		{
			if (mods) {
				value %= P;
				if (value < 0) {
					value += P;
				}
			}

			value_ = value;
		}

		public static ModInt operator +(ModInt lhs, ModInt rhs)
		{
			lhs.value_ = (lhs.value_ + rhs.value_) % P;
			return lhs;
		}
		public static ModInt operator +(long lhs, ModInt rhs)
		{
			rhs.value_ = (lhs + rhs.value_) % P;
			return rhs;
		}
		public static ModInt operator +(ModInt lhs, long rhs)
		{
			lhs.value_ = (lhs.value_ + rhs) % P;
			return lhs;
		}

		public static ModInt operator -(ModInt lhs, ModInt rhs)
		{
			lhs.value_ = (P + lhs.value_ - rhs.value_) % P;
			return lhs;
		}
		public static ModInt operator -(long lhs, ModInt rhs)
		{
			rhs.value_ = (P + lhs - rhs.value_) % P;
			return rhs;
		}
		public static ModInt operator -(ModInt lhs, long rhs)
		{
			lhs.value_ = (P + lhs.value_ - rhs) % P;
			return lhs;
		}

		public static ModInt operator *(ModInt lhs, ModInt rhs)
		{
			lhs.value_ = lhs.value_ * rhs.value_ % P;
			return lhs;
		}
		public static ModInt operator *(long lhs, ModInt rhs)
		{
			rhs.value_ = lhs * rhs.value_ % P;
			return rhs;
		}
		public static ModInt operator *(ModInt lhs, long rhs)
		{
			lhs.value_ = lhs.value_ * rhs % P;
			return lhs;
		}

		public static ModInt operator /(ModInt lhs, ModInt rhs)
		{
			long exp = P - 2;
			while (exp > 0) {
				if (exp % 2 > 0) {
					lhs *= rhs;
				}

				rhs *= rhs;
				exp /= 2;
			}

			return lhs;
		}

		public static implicit operator ModInt(long n) => new ModInt(n, true);
		public long ToLong() => value_;
		public override string ToString() => value_.ToString();
	}

	public class HashMap<TKey, TValue> : Dictionary<TKey, TValue>
	{
		private readonly Func<TKey, TValue> initialzier_;
		public HashMap(Func<TKey, TValue> initialzier)
			: base()
		{
			initialzier_ = initialzier;
		}

		public HashMap(Func<TKey, TValue> initialzier, int capacity)
			: base(capacity)
		{
			initialzier_ = initialzier;
		}

		new public TValue this[TKey key]
		{
			get
			{
				if (ContainsKey(key) == false) {
					base[key] = initialzier_(key);
				}

				return base[key];
			}

			set { base[key] = value; }
		}
	}

	public static class Helper
	{
		public static void UpdateMin<T>(ref T target, T value) where T : IComparable<T>
			=> target = target.CompareTo(value) > 0 ? value : target;

		public static void UpdateMin<T>(ref T target, T value, Action<T> onUpdated) where T : IComparable<T>
		{
			if (target.CompareTo(value) > 0) {
				target = value;
				onUpdated(value);
			}
		}

		public static void UpdateMax<T>(ref T target, T value) where T : IComparable<T>
			=> target = target.CompareTo(value) < 0 ? value : target;
		public static void UpdateMax<T>(ref T target, T value, Action<T> onUpdated) where T : IComparable<T>
		{
			if (target.CompareTo(value) < 0) {
				target = value;
				onUpdated(value);
			}
		}

		public static T[] Array<T>(int n, Func<int, T> init)
			=> Enumerable.Range(0, n).Select(x => init(x)).ToArray();
		public static List<T> List<T>(int n, Func<int, T> init)
			=> Enumerable.Range(0, n).Select(x => init(x)).ToList();
		public static T[,] Array2<T>(int n, int m, T init)
		{
			var array = new T[n, m];
			for (int i = 0; i < n; i++) {
				for (int j = 0; j < m; j++) {
					array[i, j] = init;
				}
			}

			return array;
		}

		public static T[,] Array2<T>(int n, int m, Func<int, int, T> initializer)
		{
			var array = new T[n, m];
			for (int i = 0; i < n; i++) {
				for (int j = 0; j < m; j++) {
					array[i, j] = initializer(i, j);
				}
			}

			return array;
		}

		public static T[,,] Array3<T>(int n1, int n2, int n3, T init)
		{
			var array = new T[n1, n2, n3];
			for (int i1 = 0; i1 < n1; i1++) {
				for (int i2 = 0; i2 < n2; i2++) {
					for (int i3 = 0; i3 < n3; i3++) {
						array[i1, i2, i3] = init;
					}
				}
			}

			return array;
		}

		private static readonly int[] delta4_ = { 1, 0, -1, 0, 1 };
		[MethodImpl(MethodImplOptions.AggressiveInlining)]
		public static void DoAt4(int i, int j, int imax, int jmax, Action<int, int> action)
		{
			for (int dn = 0; dn < 4; dn++) {
				int d4i = i + delta4_[dn];
				int d4j = j + delta4_[dn + 1];
				if ((uint)d4i < (uint)imax && (uint)d4j < (uint)jmax) {
					action(d4i, d4j);
				}
			}
		}

		private static readonly int[] delta8_ = { 1, 0, -1, 0, 1, 1, -1, -1, 1 };
		[MethodImpl(MethodImplOptions.AggressiveInlining)]
		public static void DoAt8(int i, int j, int imax, int jmax, Action<int, int> action)
		{
			for (int dn = 0; dn < 8; dn++) {
				int d8i = i + delta8_[dn];
				int d8j = j + delta8_[dn + 1];
				if ((uint)d8i < (uint)imax && (uint)d8j < (uint)jmax) {
					action(d8i, d8j);
				}
			}
		}
	}

	public class Scanner
	{
		private readonly char[] delimiter_ = new char[] { ' ' };
		private readonly string filePath_;
		private readonly Func<string> reader_;
		private string[] buf_;
		private int index_;

		public Scanner(string file = "")
		{
			if (string.IsNullOrWhiteSpace(file)) {
				reader_ = Console.ReadLine;
			} else {
				filePath_ = file;
				var fs = new StreamReader(file);
				reader_ = fs.ReadLine;
			}
			buf_ = new string[0];
			index_ = 0;
		}

		public string NextLine() => reader_();
		public string Next()
		{
			if (index_ < buf_.Length) {
				return buf_[index_++];
			}

			string st = reader_();
			while (st == "") {
				st = reader_();
			}

			buf_ = st.Split(delimiter_, StringSplitOptions.RemoveEmptyEntries);
			if (buf_.Length == 0) {
				return Next();
			}

			index_ = 0;
			return buf_[index_++];
		}

		public int Int() => int.Parse(Next());
		public long Long() => long.Parse(Next());
		public double Double() => double.Parse(Next());

		public int[] ArrayInt(int N, int add = 0)
		{
			int[] Array = new int[N];
			for (int i = 0; i < N; i++) {
				Array[i] = Int() + add;
			}
			return Array;
		}

		public long[] ArrayLong(int N, long add = 0)
		{
			long[] Array = new long[N];
			for (int i = 0; i < N; i++) {
				Array[i] = Long() + add;
			}
			return Array;
		}

		public double[] ArrayDouble(int N, double add = 0)
		{
			double[] Array = new double[N];
			for (int i = 0; i < N; i++) {
				Array[i] = Double() + add;
			}
			return Array;
		}

		public void Save(string text)
		{
			if (string.IsNullOrWhiteSpace(filePath_)) {
				return;
			}

			File.WriteAllText(filePath_ + "_output.txt", text);
		}
	}

	public static class Extensions
	{
		public static string Join<T>(this IEnumerable<T> values, string separator = "")
			=> string.Join(separator, values);
	}
}