結果
問題 |
No.716 距離
|
ユーザー |
![]() |
提出日時 | 2019-09-17 22:25:20 |
言語 | Haskell (9.10.1) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 752 bytes |
コンパイル時間 | 2,421 ms |
コンパイル使用メモリ | 180,788 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-07-07 13:51:55 |
合計ジャッジ時間 | 4,186 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 40 |
コンパイルメッセージ
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:28:24: 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." | 28 | ma = last xs - head xs | ^^^^ [2 of 2] Linking a.out
ソースコード
import Control.Applicative ((<$>)) import Data.List (unfoldr) import Data.Char (isSpace) import Data.ByteString.Char8 (ByteString) import qualified Data.ByteString.Char8 as B getL :: (ByteString -> [Int]) -> IO [Int] getL f = f <$> B.getLine readIL :: (ByteString -> Maybe (Int, ByteString)) -> (ByteString -> [Int]) readIL f = unfoldr g where g s = do (n, s') <- f s return (n, B.dropWhile isSpace s') main :: IO () main = do B.getLine [mi, ma] <- solve <$> getL (readIL B.readInt) print mi print ma solve :: [Int] -> [Int] solve xs = [mi, ma] where mi = minimum $ f xs ma = last xs - head xs f :: [Int] -> [Int] f [] = [] f [_] = [] f (x:y:zs) = (y-x) : f (y:zs)