結果
問題 | No.2064 Smallest Sequence on Grid |
ユーザー | McGregorsh |
提出日時 | 2022-09-02 21:52:59 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,844 bytes |
コンパイル時間 | 212 ms |
コンパイル使用メモリ | 82,172 KB |
実行使用メモリ | 103,984 KB |
最終ジャッジ日時 | 2024-04-27 21:24:18 |
合計ジャッジ時間 | 7,091 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 117 ms
89,324 KB |
testcase_01 | AC | 117 ms
89,340 KB |
testcase_02 | AC | 119 ms
89,308 KB |
testcase_03 | AC | 123 ms
89,256 KB |
testcase_04 | AC | 117 ms
89,296 KB |
testcase_05 | AC | 121 ms
89,236 KB |
testcase_06 | WA | - |
testcase_07 | AC | 119 ms
89,280 KB |
testcase_08 | AC | 118 ms
89,248 KB |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | AC | 181 ms
102,268 KB |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | AC | 182 ms
98,552 KB |
testcase_30 | WA | - |
ソースコード
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(): H, W = i_map() fild = [input() for i in range(H)] def dfs(x, y): ans.append(fild[x][y]) if x == H-1 and y == W-1: return if x + 1 < H: num1 = fild[x+1][y] else: num1 = '{' if y + 1 < W: num2 = fild[x][y+1] else: num2 = '{' if num1 > num2: dfs(x, y+1) else: dfs(x+1, y) ans = [] dfs(0, 0) print(''.join(ans)) if __name__ == '__main__': main()