結果
問題 | No.609 Noelちゃんと星々 |
ユーザー | nebukuro09 |
提出日時 | 2017-12-12 16:26:47 |
言語 | Haskell (9.8.2) |
結果 |
AC
|
実行時間 | 668 ms / 2,000 ms |
コード長 | 710 bytes |
コンパイル時間 | 6,521 ms |
コンパイル使用メモリ | 175,232 KB |
実行使用メモリ | 58,240 KB |
最終ジャッジ日時 | 2024-05-08 04:34:42 |
合計ジャッジ時間 | 16,135 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 445 ms
35,456 KB |
testcase_01 | AC | 232 ms
26,240 KB |
testcase_02 | AC | 158 ms
20,224 KB |
testcase_03 | AC | 215 ms
22,144 KB |
testcase_04 | AC | 108 ms
16,896 KB |
testcase_05 | AC | 603 ms
50,944 KB |
testcase_06 | AC | 490 ms
35,456 KB |
testcase_07 | AC | 299 ms
31,872 KB |
testcase_08 | AC | 60 ms
12,800 KB |
testcase_09 | AC | 176 ms
21,248 KB |
testcase_10 | AC | 365 ms
35,456 KB |
testcase_11 | AC | 339 ms
34,560 KB |
testcase_12 | AC | 424 ms
35,456 KB |
testcase_13 | AC | 80 ms
14,080 KB |
testcase_14 | AC | 33 ms
11,008 KB |
testcase_15 | AC | 504 ms
35,584 KB |
testcase_16 | AC | 616 ms
54,912 KB |
testcase_17 | AC | 459 ms
35,584 KB |
testcase_18 | AC | 159 ms
20,096 KB |
testcase_19 | AC | 496 ms
35,456 KB |
testcase_20 | AC | 631 ms
58,240 KB |
testcase_21 | AC | 633 ms
57,984 KB |
testcase_22 | AC | 661 ms
58,112 KB |
testcase_23 | AC | 657 ms
57,856 KB |
testcase_24 | AC | 668 ms
57,856 KB |
コンパイルメッセージ
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
ソースコード
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 (-1000000000) xs print $ min (min (check 0 lo xs) (check 0 (lo + 1) xs)) (check 0 (lo + 2) xs)