結果
問題 | No.870 無敵囲い |
ユーザー | McGregorsh |
提出日時 | 2023-04-14 11:35:51 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 142 ms / 300 ms |
コード長 | 1,802 bytes |
コンパイル時間 | 340 ms |
コンパイル使用メモリ | 82,304 KB |
実行使用メモリ | 89,896 KB |
最終ジャッジ日時 | 2024-10-10 04:13:03 |
合計ジャッジ時間 | 4,410 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 139 ms
89,472 KB |
testcase_01 | AC | 139 ms
89,728 KB |
testcase_02 | AC | 140 ms
89,600 KB |
testcase_03 | AC | 137 ms
89,412 KB |
testcase_04 | AC | 137 ms
89,560 KB |
testcase_05 | AC | 141 ms
89,472 KB |
testcase_06 | AC | 139 ms
89,472 KB |
testcase_07 | AC | 141 ms
89,656 KB |
testcase_08 | AC | 139 ms
89,896 KB |
testcase_09 | AC | 141 ms
89,472 KB |
testcase_10 | AC | 140 ms
89,088 KB |
testcase_11 | AC | 139 ms
89,600 KB |
testcase_12 | AC | 139 ms
89,472 KB |
testcase_13 | AC | 142 ms
89,600 KB |
testcase_14 | AC | 139 ms
89,560 KB |
testcase_15 | AC | 137 ms
89,472 KB |
testcase_16 | AC | 134 ms
89,728 KB |
testcase_17 | AC | 139 ms
89,472 KB |
testcase_18 | AC | 139 ms
89,600 KB |
testcase_19 | AC | 139 ms
89,600 KB |
testcase_20 | AC | 140 ms
89,728 KB |
ソースコード
import sys, re from fractions import Fraction from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce from decimal import Decimal, getcontext, ROUND_HALF_UP def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 def main(): N = int(input()) Ax, Ay = 2, 8 Bx, By = 3, 9 Cx, Cy = 7, 9 for i in range(N): x, y, nx, ny = i_map() if x == Ax and y == Ay: Ax = nx Ay = ny if x == Bx and y == By: Bx = nx By = ny if x == Cx and y == Cy: Cx = nx Cy = ny if Ax == 5 and Ay == 8 and Bx == 4 and By == 8 and Cx == 6 and Cy == 8: print('YES') else: print('NO') if __name__ == '__main__': main()