結果

問題 No.370 道路の掃除
ユーザー aimy
提出日時 2017-05-03 08:39:47
言語 Haskell
(9.10.1)
結果
WA  
実行時間 -
コード長 328 bytes
コンパイル時間 5,381 ms
コンパイル使用メモリ 173,568 KB
実行使用メモリ 8,192 KB
最終ジャッジ日時 2024-09-14 07:00:20
合計ジャッジ時間 6,780 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 6 WA * 28
権限があれば一括ダウンロードができます
コンパイルメッセージ
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:11:56: 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."
   |
11 |  where move ds = guard ((not.null) ds) >> return (abs (head ds), map (subtract (head ds)) (tail ds))
   |                                                        ^^^^

Main.hs:11:81: 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."
   |
11 |  where move ds = guard ((not.null) ds) >> return (abs (head ds), map (subtract (head ds)) (tail ds))
   |                                                                                 ^^^^

Main.hs:11:92: 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."
   |
11 |  where move ds = guard ((not.null) ds) >> return (abs (head ds), map (subtract (head ds)) (tail ds))
   |                                                                                            ^^^^
[2 of 2] Linking a.out

ソースコード

diff # 

import Data.List
import Data.Ord
import Control.Monad

main = do
 [n,_] <- map read . words <$> getLine
 ds <- map read . words <$> getContents
 print (clean n ds)

clean n = sum . take n . unfoldr move . sortBy (comparing abs)
 where move ds = guard ((not.null) ds) >> return (abs (head ds), map (subtract (head ds)) (tail ds))
0