結果

問題 No.393 2本の竹
ユーザー Leonardone
提出日時 2016-07-12 07:17:52
言語 Haskell
(9.10.1)
結果
TLE  
実行時間 -
コード長 1,527 bytes
コンパイル時間 1,995 ms
コンパイル使用メモリ 179,316 KB
実行使用メモリ 21,696 KB
最終ジャッジ日時 2024-10-15 01:04:11
合計ジャッジ時間 6,397 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 (any, 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
        n = n1 + n2
        (u, v) = foldl (\(uu, vv) w -> if uu > n then (uu, vv) else (uu + w, vv + 1)) (0, 0) ss
        ks = take v ss
        [mn, mx] = sort [n1, n2]
        fff xx ps = foldl (\(rk, ki) vk -> let xk = rk + vk in if xk <= xx then (xk, ki + 1) else (rk ,ki)) (0, 0) ps
        (dk, di) = fff mn ks
        (h1, h2) = splitAt di ks
        ek = sum (0 : h2)
        r = case mn - dk of
            q | q == mn -> fi where
                (_, fi) = fff mx ks
            0 -> if ek > mx then v - 1 else v
            _ -> if ub then ui + fi else v - 1 where
                (ub, ui, ww) = bar ss 0 0 []
                uu = sort ww
                (_, fi) = fff mx uu
                bar tts v1 i oo =
                    case compare v1 mn of
                    EQ -> (True, i, oo ++ tts)
                    GT -> (False, i, oo ++ tts)
                    LT -> case tts of
                        [] -> (False, i, oo)
                        t:ts -> if zi > ai then (zb, zi, pp) else (ab, ai, ap) where
                            (zb, zi, pp) = bar ts (v1 + t) (i + 1) oo
                            (ab, ai, ap) = if zb then (zb, zi, pp) else (bar ts v1 i (t : oo)) 
        b = r : a
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0