結果

問題 No.204 ゴールデン・ウィーク(2)
ユーザー aimy
提出日時 2017-04-30 10:51:20
言語 Haskell
(9.10.1)
結果
WA  
実行時間 -
コード長 702 bytes
コンパイル時間 1,879 ms
コンパイル使用メモリ 171,648 KB
実行使用メモリ 6,948 KB
最終ジャッジ日時 2024-09-13 23:30:00
合計ジャッジ時間 3,171 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge6
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 24 WA * 21 RE * 1
権限があれば一括ダウンロードができます
コンパイルメッセージ
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:13:41: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘head’
    (imported from Data.List, 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."
   |
13 |   chead = maximum $ map length $ filter head $ group $ replicate d True ++ cs
   |                                         ^^^^

Main.hs:14:41: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘head’
    (imported from Data.List, 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."
   |
14 |   clast = maximum $ map length $ filter head $ group $ cs ++ replicate d True
   |                                         ^^^^

Main.hs:20:50: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘head’
    (imported from Data.List, 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."
   |
20 |    return $ maximum $ (0:) $ map length $ filter head $ group cs'
   |                                                  ^^^^
[2 of 2] Linking a.out

ソースコード

diff # 

import Data.Char
import Data.List
import Control.Monad

main = do
 d <- readLn
 cs <- map (\c -> if c=='o' then True else False) . filter isAlpha <$> getContents
 print (gw2 d cs)

gw2 :: Int -> [Bool] -> Int
gw2 d cs = maximum [chead, clast, maximum (0:cinter)]
 where
  chead = maximum $ map length $ filter head $ group $ replicate d True ++ cs
  clast = maximum $ map length $ filter head $ group $ cs ++ replicate d True
  cinter = do
   i <- [0 .. 14-d]
   let pat = replicate i False ++ replicate d True ++ replicate (14-(d+i)) False
   let cs' = zipWith (||) pat cs
   guard (length (filter id cs') == length (filter id cs) + d)
   return $ maximum $ (0:) $ map length $ filter head $ group cs'
0