結果
問題 | No.1133 キムワイプイーター |
ユーザー | McGregorsh |
提出日時 | 2023-05-07 23:44:08 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 176 ms / 2,000 ms |
コード長 | 1,693 bytes |
コンパイル時間 | 489 ms |
コンパイル使用メモリ | 82,848 KB |
実行使用メモリ | 92,032 KB |
最終ジャッジ日時 | 2024-11-24 22:05:59 |
合計ジャッジ時間 | 7,812 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 139 ms
89,472 KB |
testcase_01 | AC | 142 ms
89,920 KB |
testcase_02 | AC | 160 ms
90,200 KB |
testcase_03 | AC | 169 ms
91,392 KB |
testcase_04 | AC | 176 ms
91,264 KB |
testcase_05 | AC | 174 ms
92,032 KB |
testcase_06 | AC | 171 ms
91,136 KB |
testcase_07 | AC | 165 ms
90,164 KB |
testcase_08 | AC | 159 ms
90,112 KB |
testcase_09 | AC | 164 ms
91,632 KB |
testcase_10 | AC | 175 ms
91,904 KB |
testcase_11 | AC | 174 ms
92,032 KB |
testcase_12 | AC | 168 ms
91,392 KB |
testcase_13 | AC | 175 ms
91,876 KB |
testcase_14 | AC | 158 ms
91,108 KB |
testcase_15 | AC | 164 ms
90,160 KB |
testcase_16 | AC | 161 ms
90,068 KB |
testcase_17 | AC | 150 ms
89,984 KB |
testcase_18 | AC | 149 ms
89,856 KB |
testcase_19 | AC | 146 ms
90,032 KB |
testcase_20 | AC | 149 ms
89,856 KB |
testcase_21 | AC | 150 ms
89,984 KB |
testcase_22 | AC | 150 ms
89,984 KB |
testcase_23 | AC | 139 ms
89,216 KB |
testcase_24 | AC | 141 ms
89,472 KB |
testcase_25 | AC | 147 ms
89,988 KB |
testcase_26 | AC | 140 ms
89,728 KB |
testcase_27 | AC | 142 ms
89,228 KB |
testcase_28 | AC | 148 ms
89,344 KB |
testcase_29 | AC | 143 ms
89,472 KB |
testcase_30 | AC | 152 ms
89,856 KB |
testcase_31 | AC | 139 ms
89,896 KB |
testcase_32 | AC | 139 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(): N, M = i_map() S = input() ans = [[1] * (N+1) for i in range(N+1)] ans[N][0] = 0 x = N y = 0 for i in range(M): if S[i] == 'L': y -= 1 elif S[i] == 'R': y += 1 elif S[i] == 'U': x -= 1 else: x += 1 ans[x][y] = 0 for i in ans: print(*i) if __name__ == '__main__': main()