結果

問題 No.393 2本の竹
ユーザー Leonardone
提出日時 2016-07-12 06:10:48
言語 Haskell
(9.10.1)
結果
TLE  
実行時間 -
コード長 840 bytes
コンパイル時間 8,336 ms
コンパイル使用メモリ 168,832 KB
実行使用メモリ 21,576 KB
最終ジャッジ日時 2024-10-15 01:02:54
合計ジャッジ時間 10,690 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
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
        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]
        r = bar ks 0 0 0
        b = r : a
        bar [] _ _ i = i
        bar (t:ts) v1 v2 i = a3 where
            j = i + 1
            w1 = v1 + t
            w2 = v2 + t
            a1 = if w1 <= mn then bar ts w1 v2 j else 0
            a2 = if w2 <= mx then bar ts v1 w2 j else 0
            a3 = if w1 > mn && w2 > mx then i else maximum [a1, a2]
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0