結果
問題 | No.1021 Children in Classrooms |
ユーザー | ouoz1V |
提出日時 | 2020-04-11 14:58:44 |
言語 | Nim (2.0.2) |
結果 |
AC
|
実行時間 | 53 ms / 2,000 ms |
コード長 | 678 bytes |
コンパイル時間 | 3,614 ms |
コンパイル使用メモリ | 74,624 KB |
実行使用メモリ | 12,760 KB |
最終ジャッジ日時 | 2023-10-19 06:01:30 |
合計ジャッジ時間 | 5,565 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,348 KB |
testcase_01 | AC | 1 ms
4,348 KB |
testcase_02 | AC | 1 ms
4,348 KB |
testcase_03 | AC | 2 ms
4,348 KB |
testcase_04 | AC | 2 ms
4,348 KB |
testcase_05 | AC | 2 ms
4,348 KB |
testcase_06 | AC | 2 ms
4,348 KB |
testcase_07 | AC | 3 ms
4,348 KB |
testcase_08 | AC | 2 ms
4,348 KB |
testcase_09 | AC | 52 ms
12,760 KB |
testcase_10 | AC | 53 ms
12,760 KB |
testcase_11 | AC | 52 ms
12,760 KB |
testcase_12 | AC | 52 ms
12,760 KB |
testcase_13 | AC | 52 ms
12,760 KB |
testcase_14 | AC | 52 ms
12,760 KB |
testcase_15 | AC | 41 ms
11,072 KB |
testcase_16 | AC | 42 ms
11,088 KB |
testcase_17 | AC | 43 ms
11,208 KB |
testcase_18 | AC | 52 ms
11,148 KB |
testcase_19 | AC | 10 ms
4,396 KB |
コンパイルメッセージ
/home/judge/data/code/Main.nim(1, 45) Warning: Use the new 'sugar' module instead; future is deprecated [Deprecated] /home/judge/data/code/Main.nim(1, 75) Warning: imported and not used: 'intsets' [UnusedImport] /home/judge/data/code/Main.nim(1, 67) Warning: imported and not used: 'hashes' [UnusedImport] /home/judge/data/code/Main.nim(1, 28) Warning: imported and not used: 'algorithm' [UnusedImport] /home/judge/data/code/Main.nim(1, 59) Warning: imported and not used: 'tables' [UnusedImport] /home/judge/data/code/Main.nim(1, 45) Warning: imported and not used: 'future' [UnusedImport] /home/judge/data/code/Main.nim(1, 53) Warning: imported and not used: 'sets' [UnusedImport]
ソースコード
import sequtils, strutils, algorithm, math, future, sets, tables, hashes, intsets, deques let read = iterator : string {.closure.} = (while true: (for s in stdin.readLine.split : yield s)) var n,m = read().parseint a = newSeqWith(n, read().parseint) s = read() room = initDeque[int]() for i in 0 ..< n: room.addlast a[i] for i in 0 ..< s.len: if s[i] == 'L': room.addlast 0 var a = room.popfirst b = room.popfirst room.addfirst a + b if s[i] == 'R': room.addfirst 0 var a = room.poplast b = room.poplast room.addlast a + b echo toseq(room).join(" ")