結果

問題 No.609 Noelちゃんと星々
ユーザー nebukuro09nebukuro09
提出日時 2017-12-12 16:21:21
言語 Haskell
(9.8.2)
結果
WA  
実行時間 -
コード長 698 bytes
コンパイル時間 9,957 ms
コンパイル使用メモリ 175,312 KB
実行使用メモリ 58,240 KB
最終ジャッジ日時 2024-05-08 04:32:04
合計ジャッジ時間 14,920 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 WA -
testcase_02 WA -
testcase_03 WA -
testcase_04 WA -
testcase_05 AC 626 ms
50,816 KB
testcase_06 AC 509 ms
35,456 KB
testcase_07 AC 317 ms
32,000 KB
testcase_08 WA -
testcase_09 WA -
testcase_10 AC 384 ms
35,328 KB
testcase_11 AC 358 ms
34,432 KB
testcase_12 WA -
testcase_13 AC 85 ms
14,080 KB
testcase_14 AC 37 ms
10,880 KB
testcase_15 WA -
testcase_16 AC 655 ms
55,040 KB
testcase_17 WA -
testcase_18 AC 163 ms
20,352 KB
testcase_19 WA -
testcase_20 AC 638 ms
58,240 KB
testcase_21 WA -
testcase_22 WA -
testcase_23 AC 640 ms
58,112 KB
testcase_24 WA -
権限があれば一括ダウンロードができます
コンパイルメッセージ
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:39: 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."
  |
4 |     | otherwise = check (acm + (abs ((head xs) - v))) v (tail xs)
  |                                       ^^^^

Main.hs:4:58: 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."
  |
4 |     | otherwise = check (acm + (abs ((head xs) - v))) v (tail xs)
  |                                                          ^^^^
[2 of 2] Linking a.out

ソースコード

diff # 

check :: Integer -> Integer -> [Integer] -> Integer
check acm v xs
    | null xs   = acm
    | otherwise = check (acm + (abs ((head xs) - v))) v (tail xs)

ternary :: Integer -> Integer -> [Integer] -> Integer
ternary hi lo xs
    | hi - lo <= 2 = lo
    | (check 0 mid1 xs) > (check 0 mid2 xs) = ternary mid1 lo xs
    | otherwise = ternary hi mid2 xs
    where
        mid1 = (2 * hi + lo) `div` 3
        mid2 = (hi + 2 * lo) `div` 3

main :: IO ()
main = do
    [n] <- fmap (map read . words) getLine :: IO [Integer]
    xs  <- fmap (map read . words) getLine :: IO [Integer]
    let lo = ternary 1000000000 0 xs
    print $ min (min (check 0 lo xs) (check 0 (lo + 1) xs)) (check 0 (lo + 2) xs)
0