結果

問題 No.216 FAC
コンテスト
ユーザー poapoa
提出日時 2020-08-10 15:49:45
言語 Haskell
(9.10.1)
結果
RE  
実行時間 -
コード長 1,093 bytes
コンパイル時間 5,852 ms
コンパイル使用メモリ 180,836 KB
実行使用メモリ 6,820 KB
最終ジャッジ日時 2024-10-07 19:30:37
合計ジャッジ時間 6,838 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 20 WA * 3 RE * 1
権限があれば一括ダウンロードができます
コンパイルメッセージ
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:25: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."
   |
25 |                   isK     = 0 == (snd . head $ xs)
   |                                         ^^^^

Main.hs:26: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."
   |
26 |                   kScore  = fst . head $ xs
   |                                   ^^^^

Main.hs:27: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."
   |
27 |                   others  = fst $ List.maximumBy (Ord.comparing snd) (tail xs)
   |                                                                       ^^^^
[2 of 2] Linking a.out

ソースコード

diff # 

import           Control.Arrow         ((&&&))
import qualified Data.Char             as Char
import qualified Data.List             as List
import qualified Data.ByteString.Char8 as BSC8
import qualified Data.Bool             as Bool
import qualified Data.Ord              as Ord

getInt :: IO [Int]
getInt = List.unfoldr f <$> BSC8.getLine
  where
    -- f :: BSC8.ByteString -> Maybe (Int, BSC8.ByteString)
    f s = do
      (n, s') <- BSC8.readInt s
      return (n, BSC8.dropWhile Char.isSpace s')

main :: IO ()
main = do
  n <- readLn :: IO Int
  xs <- getInt
  ys <- getInt
  putStrLn $ Bool.bool "NO" "YES" $ solver n (zip xs ys)

solver n zs = let
                  xs      = map (f &&& g) $ List.groupBy (\a b -> snd a == snd b) $ List.sortBy (Ord.comparing snd) zs
                  isK     = 0 == (snd . head $ xs)
                  kScore  = fst . head $ xs
                  others  = fst $ List.maximumBy (Ord.comparing snd) (tail xs)
              in  isK && (kScore >= others)
f []          = 0
f ((a, b):[]) = a
f ((a, b):xs) = a + f xs

g []          = 0
g ((a, b):xs) = b
0