結果
問題 | No.216 FAC |
ユーザー |
![]() |
提出日時 | 2020-08-10 15:55:49 |
言語 | Haskell (9.10.1) |
結果 |
AC
|
実行時間 | 2 ms / 1,000 ms |
コード長 | 1,175 bytes |
コンパイル時間 | 8,019 ms |
コンパイル使用メモリ | 181,044 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-10-07 19:51:27 |
合計ジャッジ時間 | 8,588 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 24 |
コンパイルメッセージ
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:22:13: 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." | 22 | then if head ys == 0 then putStrLn "YES" else putStrLn "NO" | ^^^^ Main.hs:26:41: 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." | 26 | isK = 0 == (snd . head $ xs) | ^^^^ Main.hs:27:35: 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." | 27 | kScore = fst . head $ xs | ^^^^ Main.hs:28:71: warning: [GHC-63394] [-Wx-partial] In the use of ‘tail’ (imported from Prelude, 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." | 28 | others = fst $ List.maximumBy (Ord.comparing fst) (tail xs) | ^^^^ [2 of 2] Linking a.out
ソースコード
importControl.ArrowimportqualifiedData.CharasCharimportqualifiedData.ListasListimportqualifiedData.ByteString.CharasBSCimportqualifiedData.BoolasBoolimportqualifiedData.OrdasOrdgetInt::IOIntgetInt = List.unfoldr f <$> BSC8.getLinewhere-- f :: BSC8.ByteString -> Maybe (Int, BSC8.ByteString)f s = do(n, s') <- BSC8.readInt sreturn (n, BSC8.dropWhile Char.isSpace s')main::IO()main = don <- readLn :: IO Intxs <- getIntys <- getIntif n == 1then if head ys == 0 then putStrLn "YES" else putStrLn "NO"else putStrLn $ Bool.bool "NO" "YES" $ solver n (zip xs ys)solver n zs = letxs = map (f &&& g) $ List.groupBy (\a b -> snd a == snd b) $ List.sortBy (Ord.comparing snd) zsisK = 0 == (snd . head $ xs)kScore = fst . head $ xsothers = fst $ List.maximumBy (Ord.comparing fst) (tail xs)in isK && (kScore >= others)f [] = 0f ((a, b):[]) = af ((a, b):xs) = a + f xsg [] = 0g ((a, b):xs) = b