結果
問題 | No.1021 Children in Classrooms |
ユーザー |
![]() |
提出日時 | 2020-04-10 22:01:51 |
言語 | Nim (2.2.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,021 bytes |
コンパイル時間 | 4,322 ms |
コンパイル使用メモリ | 72,832 KB |
実行使用メモリ | 11,008 KB |
最終ジャッジ日時 | 2024-09-15 20:20:30 |
合計ジャッジ時間 | 5,728 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge6 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | WA * 13 RE * 4 |
コンパイルメッセージ
/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, 67) Warning: imported and not used: 'hashes' [UnusedImport] /home/judge/data/code/Main.nim(1, 75) Warning: imported and not used: 'intsets' [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 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() cur = 0 maxv = int.low minv = int.high for i in 0 ..< m: if s[i] == 'R': cur += 1 maxv = max(maxv, cur) if s[i] == 'L': cur -= 1 minv = min(minv, cur) var ans = newseqwith(n, 0) if abs(minv) > n - 1: minv = 1 - n var leftsum = a[0 ..< abs(minv) + 1].sum if abs(minv) + cur < 0: ans[0] = leftsum echo ans.join(" ") quit() else: ans[abs(minv) + cur] = leftsum if maxv > n - 1: maxv = n - 1 var rightsum = a[n - maxv - 1 ..< n].sum if n - maxv - 1 + cur > n - 1: ans[n - 1] = rightsum echo ans.join(" ") quit() else: ans[n - maxv - 1 + cur] = rightsum for i in abs(minv) + 1 ..< n - maxv - 1: ans[i] = a[i + cur] echo ans.join(" ")