結果

問題 No.380 悪の台本
ユーザー aimy
提出日時 2017-05-02 15:31:07
言語 Haskell
(9.10.1)
結果
AC  
実行時間 24 ms / 1,000 ms
コード長 933 bytes
コンパイル時間 3,401 ms
コンパイル使用メモリ 171,264 KB
実行使用メモリ 8,448 KB
最終ジャッジ日時 2024-11-06 23:23:20
合計ジャッジ時間 4,069 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 8
権限があれば一括ダウンロードができます
コンパイルメッセージ
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:8:49: 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."
  |
8 |  | otherwise = if null ps then [xs] else (xs \\ head ps) : splitBy p (head ps)
  |                                                 ^^^^

Main.hs:8:71: 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."
  |
8 |  | otherwise = if null ps then [xs] else (xs \\ head ps) : splitBy p (head ps)
  |                                                                       ^^^^
[2 of 2] Linking a.out

ソースコード

diff # 

import Data.Char
import Data.Bool
import Data.List

splitBy p xs
 | null xs = []
 | isPrefixOf p xs = splitBy p (xs \\ p)
 | otherwise = if null ps then [xs] else (xs \\ head ps) : splitBy p (head ps)
  where ps = filter (isPrefixOf p) (tails xs)

isSym c = (not.isAlphaNum) c && isPrint c 

main = interact $ unlines . map (bool "WRONG!" "CORRECT (maybe)" . daihon) . lines

daihon str = case span (/= ' ') str of
 ("digi",  (' ':srf)) -> (isSuffixOf "nyo")  $ map toLower $ reverse $ dropWhile isSym $ take 6 $ reverse srf
 ("petit", (' ':srf)) -> (isSuffixOf "nyu")  $ map toLower $ reverse $ dropWhile isSym $ take 6 $ reverse srf
 ("rabi",  (' ':srf)) -> any isAlphaNum srf
 ("gema",  (' ':srf)) -> (isSuffixOf "gema") $ map toLower $ reverse $ dropWhile isSym $ take 7 $ reverse srf
 ("piyo",  (' ':srf)) -> (isSuffixOf "pyo")  $ map toLower $ reverse $ dropWhile isSym $ take 6 $ reverse srf
 (_,(' ':"")) -> False
 _ -> False
0