結果
| 問題 |
No.79 過小評価ダメ・ゼッタイ
|
| コンテスト | |
| ユーザー |
torus711
|
| 提出日時 | 2019-06-22 14:22:25 |
| 言語 | Haskell (9.10.1) |
| 結果 |
AC
|
| 実行時間 | 153 ms / 5,000 ms |
| コード長 | 880 bytes |
| コンパイル時間 | 8,700 ms |
| コンパイル使用メモリ | 180,300 KB |
| 実行使用メモリ | 17,792 KB |
| 最終ジャッジ日時 | 2024-12-26 08:55:24 |
| 合計ジャッジ時間 | 11,231 ms |
|
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| 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:35:1: warning: [GHC-94817] [-Wtabs]
Tab character found here, and in 7 further locations.
Suggested fix: Please use spaces instead.
|
35 | getLine
| ^^^^^^^^
Main.hs:40:17: 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."
|
40 | print $ head $ head $ filter ( ( == maxLength ) . length ) histogram
| ^^^^
Main.hs:40: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."
|
40 | print $ head $ head $ filter ( ( == maxLength ) . length ) histogram
| ^^^^
[2 of 2] Linking a.out
ソースコード
{-# LANGUAGE BangPatterns #-}
{-# LANGUAGE BinaryLiterals #-}
{-# LANGUAGE MultiWayIf #-}
{-# LANGUAGE NumDecimals #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE TupleSections #-}
import Control.Applicative
import Control.Arrow
import Control.Monad
import Control.Monad.ST
import Data.Char
import Data.List
import Data.Maybe
import qualified Data.ByteString.Char8 as B
import Data.Array.ST.Safe
import Data.STRef
import Debug.Trace
import Text.Printf
import GHC.Exts
readInt = readLn :: IO Int
readInts = map ( fst . fromJust . B.readInt ) . B.words <$> B.getLine
readNInts = readInt >>= flip replicateM readInt
which a b f = if f then a else b
mp [ a, b ] = ( a, b )
main = do
getLine
ls <- reverse . sort <$> readInts
let
histogram = group ls
maxLength = maximum $ map length histogram
print $ head $ head $ filter ( ( == maxLength ) . length ) histogram
torus711