結果

問題 No.393 2本の竹
ユーザー Leonardone
提出日時 2016-07-12 08:02:20
言語 Haskell
(9.10.1)
結果
TLE  
実行時間 -
コード長 1,357 bytes
コンパイル時間 1,859 ms
コンパイル使用メモリ 169,216 KB
実行使用メモリ 18,304 KB
最終ジャッジ日時 2024-10-15 01:05:53
合計ジャッジ時間 5,784 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other TLE * 1 -- * 27
権限があれば一括ダウンロードができます
コンパイルメッセージ
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 (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 i =
            case compare v1 mn of
                EQ -> (True, v1, oo ++ tts, i)
                GT -> (False, v1 - t1, t1 : oo ++ tts, i - 1)
                LT -> case tts of
                    [] -> (False, v1, oo, i)
                    t:ts -> rv where
                        ww = bar ts (v1 + t) oo t (i + 1)
                        (wb, wv, ws, wi) = ww
                        qq = bar ts v1 (t : oo) t1 i
                        (qb, qv, qs, qi) = qq
                        rv = case True of
                            _ | wi > qi -> ww
                            _ | wi < qi -> qq
                            _ | wb -> ww
                            _ | qb -> qq
                            _ | wv > qv -> ww
                            _ -> qq
        (_, _, rs, _) = bar ms 0 [] 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