結果
問題 | No.1949 足し算するだけのパズルゲーム(2) |
ユーザー | McGregorsh |
提出日時 | 2022-07-28 22:08:16 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,146 bytes |
コンパイル時間 | 442 ms |
コンパイル使用メモリ | 87,176 KB |
実行使用メモリ | 159,692 KB |
最終ジャッジ日時 | 2023-09-25 15:41:50 |
合計ジャッジ時間 | 18,371 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 250 ms
92,704 KB |
testcase_01 | AC | 243 ms
92,360 KB |
testcase_02 | AC | 242 ms
92,552 KB |
testcase_03 | AC | 247 ms
92,464 KB |
testcase_04 | AC | 250 ms
92,532 KB |
testcase_05 | AC | 249 ms
92,664 KB |
testcase_06 | AC | 245 ms
92,584 KB |
testcase_07 | AC | 1,028 ms
159,692 KB |
testcase_08 | AC | 286 ms
95,180 KB |
testcase_09 | AC | 1,060 ms
141,596 KB |
testcase_10 | WA | - |
testcase_11 | AC | 1,090 ms
144,248 KB |
testcase_12 | AC | 1,083 ms
145,500 KB |
testcase_13 | AC | 281 ms
95,048 KB |
testcase_14 | WA | - |
testcase_15 | AC | 319 ms
95,924 KB |
testcase_16 | AC | 277 ms
94,720 KB |
testcase_17 | AC | 1,467 ms
149,308 KB |
testcase_18 | AC | 280 ms
94,504 KB |
testcase_19 | AC | 259 ms
92,380 KB |
testcase_20 | AC | 258 ms
92,632 KB |
testcase_21 | WA | - |
testcase_22 | AC | 1,102 ms
141,756 KB |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | AC | 1,115 ms
148,344 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 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 while hque: point, Y, X = heappop(hque) nums[Y][X] = 0 count += 1 score += point 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 if score <= nums[yi][xj]: continue cost = nums[yi][xj] heappush(hque, (cost, yi, xj)) #print(nums) print('No') if __name__ == '__main__': main()