結果

問題 No.79 過小評価ダメ・ゼッタイ
ユーザー 情報学生
提出日時 2019-08-20 10:29:34
言語 Haskell
(9.10.1)
結果
AC  
実行時間 221 ms / 5,000 ms
コード長 265 bytes
コンパイル時間 3,762 ms
コンパイル使用メモリ 176,000 KB
実行使用メモリ 18,048 KB
最終ジャッジ日時 2024-10-06 11:44:33
合計ジャッジ時間 5,238 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 22
権限があれば一括ダウンロードができます
コンパイルメッセージ
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:4:89: 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."
  |
4 | main = interact $ show . solve . group . reverse . sort . map (read :: String -> Int) . tail . words
  |                                                                                         ^^^^

Main.hs:7:13: 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."
  |
7 | solve xss = head . head $ filter (\xs -> length xs == x) xss
  |             ^^^^

Main.hs:7:20: 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."
  |
7 | solve xss = head . head $ filter (\xs -> length xs == x) xss
  |                    ^^^^
[2 of 2] Linking a.out

ソースコード

diff # 

import Data.List

main :: IO ()
main = interact $ show . solve . group . reverse . sort . map (read :: String -> Int) . tail . words

solve :: [[Int]] -> Int
solve xss = head . head $ filter (\xs -> length xs == x) xss
    where
        x = maximum $ map length xss
0