結果
問題 | No.154 市バス |
ユーザー |
|
提出日時 | 2021-05-29 15:54:24 |
言語 | Nim (2.2.0) |
結果 |
AC
|
実行時間 | 78 ms / 2,000 ms |
コード長 | 1,227 bytes |
コンパイル時間 | 4,250 ms |
コンパイル使用メモリ | 86,656 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-11-07 23:36:04 |
合計ジャッジ時間 | 5,584 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 8 |
コンパイルメッセージ
/home/judge/data/code/Main.nim(2, 18) Warning: Use the new 'sugar' module instead; future is deprecated [Deprecated] /home/judge/data/code/Main.nim(1, 8) Warning: imported and not used: 'times' [UnusedImport] /home/judge/data/code/Main.nim(2, 26) Warning: imported and not used: 'strformat' [UnusedImport] /home/judge/data/code/Main.nim(2, 8) Warning: imported and not used: 'critbits' [UnusedImport] /home/judge/data/code/Main.nim(2, 18) Warning: imported and not used: 'future' [UnusedImport] /home/judge/data/code/Main.nim(1, 41) Warning: imported and not used: 'algorithm' [UnusedImport] /home/judge/data/code/Main.nim(1, 52) Warning: imported and not used: 'tables' [UnusedImport] /home/judge/data/code/Main.nim(1, 60) Warning: imported and not used: 'sets' [UnusedImport] /home/judge/data/code/Main.nim(1, 66) Warning: imported and not used: 'lists' [UnusedImport] /home/judge/data/code/Main.nim(1, 73) Warning: imported and not used: 'intsets' [UnusedImport]
ソースコード
import times, strutils, sequtils, math, algorithm, tables, sets, lists, intsetsimport critbits, future, strformat, dequestemplate `max=`(x,y) = x = max(x,y)template `min=`(x,y) = x = min(x,y)template `mod=`(x,y) = x = x mod ytemplate scan2 = (scan(), scan())template scan3 = (scan(), scan())let read* = iterator: string {.closure.} =while true: (for s in stdin.readLine.split: yield s)proc scan(): int = read().parseIntproc scanf(): float = read().parseFloatproc toInt(c:char): int =return int(c) - int('0')proc solve()=vart = scan()for i in 0..<t:varv = read()q = initDeque[char]()series = newseq[bool](0)isP = truefor j in countdown(v.len-1,0):if v[j] == 'W':if series.len==0:isP = falseelse:for i in 0..<series.len:if series[i]==false:series[i]=truebreakelif v[j] == 'R':q.addLast(v[j])elif v[j] == 'G':if q.len>0:q.popLast()series.add(false)else:isP = false#echo qif isP and q.len==0 and series.allIt(it):echo "possible"else:echo "impossible"solve()