結果

問題 No.1109 調の判定
コンテスト
ユーザー aoshima
提出日時 2020-07-17 10:05:22
言語 Haskell
(9.10.1)
結果
WA  
実行時間 -
コード長 858 bytes
コンパイル時間 5,947 ms
コンパイル使用メモリ 180,376 KB
実行使用メモリ 6,820 KB
最終ジャッジ日時 2024-11-27 19:33:59
合計ジャッジ時間 7,475 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 37 WA * 6
権限があれば一括ダウンロードができます
コンパイルメッセージ
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:24:15: 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."
   |
24 |     ys = map (head Arrow.&&& ok xs) tables
   |               ^^^^
[2 of 2] Linking a.out

ソースコード

diff # 

{-# OPTIONS_GHC -O2 #-}
import qualified Control.Arrow         as Arrow
import qualified Data.List             as List
import qualified Data.ByteString.Char8 as BSC8
import qualified Data.Maybe            as Maybe

readInts :: IO [Int]
readInts = map (fst . Maybe.fromJust . BSC8.readInt) . BSC8.words <$> BSC8.getLine

main :: IO ()
main = do
  n <- readLn :: IO Int
  xs <- readInts
  if n < 3 || n > 7
    then print (-1)
    else print $ solve xs

solve :: [Int] -> Int
solve xs = if l > 1 || l == 0
            then -1
            else g $ filter snd ys
  where
    tables = map major xs
    ys = map (head Arrow.&&& ok xs) tables
    l = length $ filter snd ys
    g [(a, b)] = a

ok :: [Int] -> [Int] -> Bool
ok [] _ = True
ok (x:xs) ys = (List.elem x ys) && (ok xs ys)

major :: Int -> [Int]
major n = [(n + x) `mod` 12 | x <- [0, 2, 4, 5, 7, 9, 11]]
0