結果
問題 | No.1941 CHECKER×CHECKER(1) |
ユーザー | McGregorsh |
提出日時 | 2023-05-06 22:52:16 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 138 ms / 2,000 ms |
コード長 | 1,730 bytes |
コンパイル時間 | 439 ms |
コンパイル使用メモリ | 82,304 KB |
実行使用メモリ | 89,856 KB |
最終ジャッジ日時 | 2024-05-03 05:54:50 |
合計ジャッジ時間 | 2,918 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 128 ms
89,856 KB |
testcase_01 | AC | 122 ms
89,296 KB |
testcase_02 | AC | 123 ms
89,660 KB |
testcase_03 | AC | 123 ms
89,728 KB |
testcase_04 | AC | 127 ms
89,216 KB |
testcase_05 | AC | 138 ms
89,572 KB |
testcase_06 | AC | 134 ms
89,728 KB |
testcase_07 | AC | 130 ms
89,700 KB |
testcase_08 | AC | 126 ms
89,612 KB |
testcase_09 | AC | 123 ms
89,600 KB |
testcase_10 | AC | 125 ms
89,600 KB |
testcase_11 | AC | 123 ms
89,472 KB |
testcase_12 | AC | 131 ms
89,600 KB |
testcase_13 | AC | 123 ms
89,600 KB |
testcase_14 | AC | 127 ms
89,600 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(): S = [input() for i in range(3)] for i in range(3): for j in range(3): move = [[0, 1], [1, 0], [-1, 0], [0, -1]] for a, b in move: nx = a + i ny = b + j if not (0<=nx<3 and 0<=ny<3): continue if S[i][j] == S[nx][ny]: print('No') exit() print('Yes') if __name__ == '__main__': main()