結果
問題 | No.228 ゆきこちゃんの 15 パズル |
ユーザー | McGregorsh |
提出日時 | 2023-05-15 00:53:40 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 251 ms / 5,000 ms |
コード長 | 2,154 bytes |
コンパイル時間 | 1,081 ms |
コンパイル使用メモリ | 86,700 KB |
実行使用メモリ | 92,412 KB |
最終ジャッジ日時 | 2023-08-20 09:17:36 |
合計ジャッジ時間 | 7,644 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 246 ms
92,076 KB |
testcase_01 | AC | 248 ms
92,240 KB |
testcase_02 | AC | 245 ms
92,244 KB |
testcase_03 | AC | 251 ms
92,368 KB |
testcase_04 | AC | 245 ms
92,148 KB |
testcase_05 | AC | 246 ms
92,248 KB |
testcase_06 | AC | 245 ms
92,364 KB |
testcase_07 | AC | 240 ms
92,348 KB |
testcase_08 | AC | 247 ms
92,212 KB |
testcase_09 | AC | 245 ms
92,216 KB |
testcase_10 | AC | 246 ms
92,088 KB |
testcase_11 | AC | 245 ms
92,228 KB |
testcase_12 | AC | 244 ms
92,352 KB |
testcase_13 | AC | 245 ms
92,348 KB |
testcase_14 | AC | 244 ms
92,196 KB |
testcase_15 | AC | 245 ms
92,316 KB |
testcase_16 | AC | 245 ms
92,412 KB |
testcase_17 | AC | 243 ms
92,364 KB |
testcase_18 | AC | 244 ms
92,244 KB |
testcase_19 | AC | 240 ms
92,312 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(): A = [i_list() for i in range(4)] sx, sy = 0, 0 for i in range(4): for j in range(4): if A[i][j] == 0: sx, sy = i, j juge = [[False] * 4 for i in range(4)] que = deque() que.append([sx, sy]) while que: a, b = que.popleft() if juge[a][b]: break p = a * 4 + b + 1 move = [[0, 1], [0, -1], [1, 0], [-1, 0]] for x, y in move: nx = x + a ny = y + b if not (0<=nx<4 and 0<=ny<4): continue if p == A[nx][ny]: A[nx][ny] = 0 A[a][b] = p juge[a][b] = True que.append([nx, ny]) ans = [[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 0]] if ans == A: print('Yes') else: print('No') if __name__ == '__main__': main()