結果

問題 No.393 2本の竹
ユーザー Leonardone
提出日時 2016-07-12 07:54:06
言語 Haskell
(9.10.1)
結果
WA  
実行時間 -
コード長 1,212 bytes
コンパイル時間 8,075 ms
コンパイル使用メモリ 169,344 KB
実行使用メモリ 14,500 KB
最終ジャッジ日時 2024-10-15 01:05:16
合計ジャッジ時間 5,171 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other WA * 27 TLE * 1
権限があれば一括ダウンロードができます
コンパイルメッセージ
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:6:48: 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."
  |
6 | main = putStrLn . unlines . solve . map read . tail . words =<< getContents
  |                                                ^^^^
[2 of 2] Linking a.out

ソースコード

diff #
プレゼンテーションモードにする

-- Try yukicoder
-- author: Leonardone @ NEETSDKASU
import Data.List (foldl', sort)
main = putStrLn . unlines . solve . map read . tail . words =<< getContents
solve x = map show . reverse $ foo [] x where
    foo a [] = a
    foo a (n1:n2:m:xs) = foo b zs where
        (ys, zs) = splitAt m xs
        ss = sort ys
        [mn, mx] = sort [n1, n2]
        (ms, fs) = span (<= mn) ss
        bar tts v1 oo t1 =
            case compare v1 mn of
                EQ -> (True, v1, oo ++ tts)
                GT -> (False, v1 - t1, t1 : oo ++ tts)
                LT -> case tts of
                    [] -> (False, v1, oo)
                    t:ts -> rv where
                        (wb, wv, ws) = bar ts (v1 + t) oo t
                        (qb, qv, qs) = bar ts v1 (t : oo) t1
                        rv = case True of
                            _ | wb -> (wb, wv, ws)
                            _ | qb -> (qb, qv, qs)
                            _ | wv > qv -> (wb, wv, ws)
                            _ -> (qb, qv, qs)
        (_, _, rs) = bar ms 0 [] 0
        (_ , ei) = foldl' (\(dv, di) v -> let u = dv + v in if u > mx then (dv, di + 1) else (u, di)) (0, 0) . sort $ rs ++ fs
        b = m - ei : a
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0