結果

問題 No.358 も～っと！門松列
ユーザー momen999
提出日時 2017-04-24 18:50:49
言語 Haskell
(9.10.1)
結果
AC  
実行時間 2 ms / 1,000 ms
コード長 879 bytes
コンパイル時間 1,613 ms
コンパイル使用メモリ 171,896 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-09-13 12:03:54
合計ジャッジ時間 2,535 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 23
権限があれば一括ダウンロードができます
コンパイルメッセージ
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:3:28: 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."
  |
3 | anyKadomatsu as = any (== (head as)) (tail as) || any (== (last as)) (init as)
  |                            ^^^^

Main.hs:3:39: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘tail’
    (imported from Data.List, but defined in GHC.List):
    "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  |
3 | anyKadomatsu as = any (== (head as)) (tail as) || any (== (last as)) (init as)
  |                                       ^^^^
[2 of 2] Linking a.out

ソースコード

diff #
プレゼンテーションモードにする

import Data.List
anyKadomatsu as = any (== (head as)) (tail as) || any (== (last as)) (init as)
isKadomatsu (x:y:z:zs) = ( (x > y) && (z > y) ) || ( (x < y) && (z < y) )
solve as
    | anyKadomatsu as   = 0     -- おなじ長さの竹があるので門松でない
    | isKadomatsu as    = -1    -- すでに門松なので、無限門松
    | otherwise         = mottoKadomatsu ((last . sort) as) as  -- 有限門松
    where
        mottoKadomatsu 0 _  = 0
        mottoKadomatsu p as = x + mottoKadomatsu (p - 1) as
            where
                bs = map (`mod` p) as
                x   | not (anyKadomatsu bs) && isKadomatsu bs   = 1
                    | otherwise                                 = 0
answer a
    | a == -1   = "INF"
    | otherwise = show a
main = do
    as <- map (read :: String -> Int) . words <$> getLine
    putStrLn $ answer $ solve as
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0