結果
問題 | No.1026 OGAWA's New Keyboard |
ユーザー | McGregorsh |
提出日時 | 2023-04-14 14:52:01 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 260 ms / 1,000 ms |
コード長 | 1,555 bytes |
コンパイル時間 | 338 ms |
コンパイル使用メモリ | 82,432 KB |
実行使用メモリ | 105,344 KB |
最終ジャッジ日時 | 2024-04-18 13:22:11 |
合計ジャッジ時間 | 5,391 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 133 ms
89,644 KB |
testcase_01 | AC | 138 ms
89,504 KB |
testcase_02 | AC | 141 ms
89,464 KB |
testcase_03 | AC | 132 ms
89,728 KB |
testcase_04 | AC | 260 ms
105,344 KB |
testcase_05 | AC | 165 ms
90,496 KB |
testcase_06 | AC | 165 ms
90,516 KB |
testcase_07 | AC | 225 ms
96,972 KB |
testcase_08 | AC | 158 ms
90,524 KB |
testcase_09 | AC | 135 ms
89,600 KB |
testcase_10 | AC | 147 ms
89,696 KB |
testcase_11 | AC | 149 ms
89,592 KB |
testcase_12 | AC | 138 ms
89,344 KB |
testcase_13 | AC | 137 ms
89,160 KB |
testcase_14 | AC | 127 ms
89,856 KB |
testcase_15 | AC | 135 ms
89,224 KB |
testcase_16 | AC | 140 ms
89,540 KB |
testcase_17 | AC | 188 ms
91,468 KB |
testcase_18 | AC | 152 ms
89,600 KB |
testcase_19 | AC | 177 ms
91,484 KB |
testcase_20 | AC | 134 ms
89,524 KB |
testcase_21 | AC | 138 ms
89,520 KB |
testcase_22 | AC | 142 ms
89,544 KB |
testcase_23 | AC | 144 ms
89,748 KB |
testcase_24 | AC | 215 ms
96,640 KB |
testcase_25 | AC | 154 ms
90,464 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 = int(input()) que = deque() for i in range(N): a, b = s_map() if a == '0': que.append(b) else: que.appendleft(b) que = list(que) print(''.join(que)) if __name__ == '__main__': main()