結果
問題 | No.1021 Children in Classrooms |
ユーザー | McGregorsh |
提出日時 | 2022-07-07 22:31:57 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 336 ms / 2,000 ms |
コード長 | 1,759 bytes |
コンパイル時間 | 469 ms |
コンパイル使用メモリ | 86,884 KB |
実行使用メモリ | 129,084 KB |
最終ジャッジ日時 | 2023-08-26 09:42:41 |
合計ジャッジ時間 | 8,187 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 237 ms
92,696 KB |
testcase_01 | AC | 238 ms
92,740 KB |
testcase_02 | AC | 236 ms
92,604 KB |
testcase_03 | AC | 253 ms
94,256 KB |
testcase_04 | AC | 252 ms
93,832 KB |
testcase_05 | AC | 249 ms
94,168 KB |
testcase_06 | AC | 250 ms
94,060 KB |
testcase_07 | AC | 249 ms
93,936 KB |
testcase_08 | AC | 249 ms
94,216 KB |
testcase_09 | AC | 336 ms
128,924 KB |
testcase_10 | AC | 331 ms
128,576 KB |
testcase_11 | AC | 331 ms
129,020 KB |
testcase_12 | AC | 333 ms
129,012 KB |
testcase_13 | AC | 336 ms
129,084 KB |
testcase_14 | AC | 329 ms
129,008 KB |
testcase_15 | AC | 318 ms
121,284 KB |
testcase_16 | AC | 321 ms
121,572 KB |
testcase_17 | AC | 318 ms
121,988 KB |
testcase_18 | AC | 325 ms
128,712 KB |
testcase_19 | AC | 247 ms
93,060 KB |
ソースコード
import sys, re 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(): n, m = i_map() A = i_list() s = input() que = deque(A) for i in range(m): if s[i] == 'L': num1 = que.popleft() num2 = que.popleft() num2 += num1 que.appendleft(num2) que.append(0) else: num1 = que.pop() num2 = que.pop() num2 += num1 que.append(num2) que.appendleft(0) #print(que) print(*que) if __name__ == '__main__': main()