← Back to List

5239번: Chess Puzzle ↗

Solutions

Python 3
1021 B | 1021 chars
"""
[5239: Chess Puzzle](https://www.acmicpc.net/problem/5239)

Tier: Bronze 1 
Category: implementation
"""


import sys
from math import sqrt, pi, sin, factorial, ceil, floor
from datetime import datetime, timedelta

SYS_INPUT = True
RECURSION_LIMIT = 10 ** 7
SET_RECURSION = False
BLANK = " "

if SET_RECURSION:
  sys.setrecursionlimit(RECURSION_LIMIT)

inp = lambda : sys.stdin.readline().rstrip() if SYS_INPUT else input()
mii = lambda : [*map(int,inp().split())]
mfi = lambda : [*map(float,inp().split())]
ii = lambda : int(inp())
fi = lambda : float(inp())
isplit = lambda : inp().split()
p = print

def gcd(a, b): return gcd(b, a % b) if b > 0 else a
def lcm(a, b): return a * b // gcd(a, b)


def solve():
  n, *l = mii()

  x = []
  y = []

  for i in range(0, len(l), 2):
    x.append(l[i])
    y.append(l[i+1])
  
  if len(x) != len(set(x)) or len(y) != len(set(y)):
    return "NOT SAFE"
  
  return "SAFE"


if __name__ == "__main__":
  tc = ii()
  for t in range(1, tc+1):
    ret = solve()
    print(ret)