結果
問題 | No.1949 足し算するだけのパズルゲーム(2) |
ユーザー | McGregorsh |
提出日時 | 2022-07-28 22:48:44 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,410 bytes |
コンパイル時間 | 2,006 ms |
コンパイル使用メモリ | 86,564 KB |
実行使用メモリ | 162,344 KB |
最終ジャッジ日時 | 2023-09-25 16:33:52 |
合計ジャッジ時間 | 17,627 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 235 ms
92,492 KB |
testcase_01 | AC | 427 ms
93,440 KB |
testcase_02 | AC | 234 ms
92,492 KB |
testcase_03 | AC | 235 ms
92,416 KB |
testcase_04 | AC | 418 ms
93,716 KB |
testcase_05 | AC | 237 ms
92,420 KB |
testcase_06 | AC | 411 ms
93,600 KB |
testcase_07 | AC | 1,016 ms
162,344 KB |
testcase_08 | AC | 458 ms
95,752 KB |
testcase_09 | AC | 1,056 ms
141,952 KB |
testcase_10 | AC | 1,048 ms
141,832 KB |
testcase_11 | AC | 1,046 ms
142,716 KB |
testcase_12 | AC | 1,029 ms
140,412 KB |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | TLE | - |
testcase_16 | -- | - |
testcase_17 | -- | - |
testcase_18 | -- | - |
testcase_19 | -- | - |
testcase_20 | -- | - |
testcase_21 | -- | - |
testcase_22 | -- | - |
testcase_23 | -- | - |
testcase_24 | -- | - |
testcase_25 | -- | - |
ソースコード
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 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(): h, w, y, x = i_map() y -= 1 x -= 1 nums = [i_list() for i in range(h)] hque = [] heappush(hque, (nums[y][x], y, x)) move = [[0, 1], [0, -1], [1, 0], [-1, 0]] count = 0 score = 0 cou = 0 while hque and cou < 10**6: point, Y, X = heappop(hque) if not (Y == y and X == x): if point < score: nums[Y][X] = 0 count += 1 score += point cou += 1 else: heappush(hque, (point, Y, X)) cou += 1 continue else: nums[Y][X] = 0 count += 1 score += point cou += 1 if count == h * w: print('Yes') exit() for i, j in move: yi = Y + i xj = X + j if not (0 <= yi < h and 0 <= xj < w): continue if nums[yi][xj] == 0: continue cost = nums[yi][xj] heappush(hque, (cost, yi, xj)) #print(nums) print('No') if __name__ == '__main__': main()