結果

問題 No.154 市バス
ユーザー dot_haraaidot_haraai
提出日時 2021-05-29 15:44:18
言語 Nim
(2.0.2)
結果
WA  
実行時間 -
コード長 1,064 bytes
コンパイル時間 5,182 ms
コンパイル使用メモリ 86,144 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-11-07 23:31:21
合計ジャッジ時間 6,118 ms
ジャッジサーバーID
(参考情報)
judge5 / judge1
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 20 ms
5,248 KB
testcase_01 AC 20 ms
5,248 KB
testcase_02 AC 20 ms
5,248 KB
testcase_03 AC 20 ms
5,248 KB
testcase_04 WA -
testcase_05 AC 2 ms
5,248 KB
testcase_06 AC 2 ms
5,248 KB
testcase_07 AC 18 ms
5,248 KB
testcase_08 WA -
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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(1, 25) Warning: imported and not used: 'sequtils' [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]
/home/judge/data/code/Main.nim(2, 8) Warning: imported and not used: 'critbits' [UnusedImport]

ソースコード

diff #

import times, strutils, sequtils, math, algorithm, tables, sets, lists, intsets
import critbits, future, strformat, deques
template `max=`(x,y) = x = max(x,y)
template `min=`(x,y) = x = min(x,y)
template `mod=`(x,y) = x = x mod y
template 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().parseInt
proc scanf(): float = read().parseFloat
proc toInt(c:char): int =
    return int(c) - int('0')



proc solve()=
  var
    t = scan()
  for i in 0..<t:
    var
      v = read()
      q = initDeque[char]()
      terminal = false
      isP = true
    for j in countdown(v.len-1,0):
      if v[j] == 'W':
        if not terminal:
          isP = false
      elif v[j] == 'R':
        q.addLast(v[j])
      elif v[j] == 'G':
        if q.len>0:
          q.popLast()
          terminal = true
        else:
          isP = false
    #echo q
    if isP and q.len==0:
      echo "possible"
    else:
      echo "impossible"
    


solve()
0