結果

問題 No.154 市バス
ユーザー AyachiGinAyachiGin
提出日時 2016-06-11 16:13:31
言語 Haskell
(9.8.2)
結果
WA  
実行時間 -
コード長 1,158 bytes
コンパイル時間 2,555 ms
コンパイル使用メモリ 169,984 KB
実行使用メモリ 19,200 KB
最終ジャッジ日時 2024-04-21 09:32:30
合計ジャッジ時間 8,973 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 WA -
testcase_02 WA -
testcase_03 WA -
testcase_04 WA -
testcase_05 AC 2 ms
6,940 KB
testcase_06 AC 2 ms
6,940 KB
testcase_07 TLE -
testcase_08 -- -
権限があれば一括ダウンロードができます
コンパイルメッセージ
Loaded package environment from /home/judge/.ghc/x86_64-linux-9.8.2/environments/default
[1 of 2] Compiling Main             ( Main.hs, Main.o )

Main.hs:40:18: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘head’
    (imported from Prelude, but defined in GHC.List):
    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
   |
40 |                  head xs == 'G' && length xs >= 2 && all (=='W') xs
   |                  ^^^^
[2 of 2] Linking a.out

ソースコード

diff # 

module Main where

main :: IO ()
main = do
  i <- readLn
  s <- getContents
  mapM_ (putStrLn . isPossible) . take i . lines $ s

-- | tests
-- >>> isPossible "WWWWWWWWWGR"
-- "possible"
-- >>> isPossible "WWWWGWGRR"
-- "possible"
-- >>> isPossible "WWWWWWWWWWWWWWGRRG"
-- "impossible"
-- >>> isPossible "WGRWGR"
-- "possible"
-- >>> isPossible "WWWWWWWWWWWWWWWWWGGWGWGGWGWGGGWGG"
-- "impossible"
-- >>> WGWR
-- "impossible"
-- >>> WGRW
-- "impossible"
isPossible :: String -> String
isPossible s = if take1RGW s then
                 "possible"
               else
                 "impossible"
  where
    take1RGW = takeR . reverse
    takeR :: String -> Bool
    takeR ('R':'G':ls) = length ls > 0 && all (=='W') ls || takeG ('G':ls)
    takeR ('R':xs) = takeG xs
    takeR _ = False
    takeG xs = if elem 'R' xs then
                 case break (=='G') xs of
                  (_, "") -> False
                  (ys, (_:zs)) -> takeW (ys ++ zs)
               else
                 head xs == 'G' && length xs >= 2 && all (=='W') xs
    takeW xs
      | elem 'W' xs = let (as, (_:bs)) = break (=='W') xs in takeR $ as ++ bs
      | otherwise   = False
0