結果

問題 No.716 距離
ユーザー momen999
提出日時 2019-04-02 17:25:35
言語 Haskell
(9.10.1)
結果
AC  
実行時間 6 ms / 2,000 ms
コード長 229 bytes
コンパイル時間 2,640 ms
コンパイル使用メモリ 172,416 KB
実行使用メモリ 8,320 KB
最終ジャッジ日時 2024-11-30 08:35:10
合計ジャッジ時間 3,432 ms
ジャッジサーバーID
(参考情報)
judge5 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
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:9:12: 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."
  |
9 |     amin = head $ sort $ zipWith (-) (tail as) (init as)
  |            ^^^^

Main.hs:9:39: 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."
  |
9 |     amin = head $ sort $ zipWith (-) (tail as) (init as)
  |                                       ^^^^

Main.hs:10:22: 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."
   |
10 |     amax = last as - head as
   |                      ^^^^
[2 of 2] Linking a.out

ソースコード

diff #

import Data.List (sort)

main = do
    getLine
    as <- map read . words <$> getLine
    mapM print $ solve as

solve as = [amin, amax] where
    amin = head $ sort $ zipWith (-) (tail as) (init as)
    amax = last as - head as
0