結果

問題 No.216 FAC
ユーザー tottoripaper
提出日時 2015-05-26 22:33:44
言語 Haskell
(9.10.1)
結果
AC  
実行時間 2 ms / 1,000 ms
コード長 515 bytes
コンパイル時間 10,239 ms
コンパイル使用メモリ 170,632 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-10-15 00:31:36
合計ジャッジ時間 11,037 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
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:15:24: 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."
   |
15 |   let cs = map ((fst . head) &&& (sum . map snd)) . groupBy (\a b -> fst a == fst b) sortBy(comparingfst) sortBy (comparing fst)  zip bs as
   |                        ^^^^

Main.hs:16:19: 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."
   |
16 |       f = if fst (head cs) /= 0
   |                   ^^^^

Main.hs:18:21: 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."
   |
18 |           else snd (head cs)
   |                     ^^^^
[2 of 2] Linking a.out

ソースコード

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

{-# LANGUAGE Arrows #-}
import Control.Monad
import Control.Arrow
import Data.List
import Data.Ord
getInts :: IO [Int]
getInts = liftM (map read . words) getLine
    
main = do
  _ <- getLine
  as <- getInts
  bs <- getInts
  let cs = map ((fst . head) &&& (sum . map snd)) . groupBy (\a b -> fst a == fst b) $ sortBy (comparing fst) $ zip bs as
      f = if fst (head cs) /= 0
          then 0
          else snd (head cs)
  putStrLn $ if f >= maximum (map snd cs)
             then "YES"
             else "NO"
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0