結果

問題 No.490 yukiソート
ユーザー LeonardoneLeonardone
提出日時 2017-03-11 00:46:53
言語 Haskell
(9.8.2)
結果
TLE  
実行時間 -
コード長 564 bytes
コンパイル時間 7,007 ms
コンパイル使用メモリ 170,624 KB
実行使用メモリ 819,872 KB
最終ジャッジ日時 2024-06-24 11:53:14
合計ジャッジ時間 35,017 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 3 ms
5,248 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 TLE -
testcase_05 TLE -
testcase_06 TLE -
testcase_07 TLE -
testcase_08 TLE -
testcase_09 TLE -
testcase_10 TLE -
testcase_11 TLE -
testcase_12 TLE -
testcase_13 TLE -
testcase_14 MLE -
testcase_15 -- -
testcase_16 -- -
testcase_17 -- -
testcase_18 -- -
testcase_19 -- -
testcase_20 -- -
testcase_21 -- -
testcase_22 -- -
testcase_23 -- -
testcase_24 -- -
testcase_25 -- -
testcase_26 -- -
testcase_27 -- -
testcase_28 -- -
testcase_29 -- -
testcase_30 -- -
testcase_31 -- -
testcase_32 -- -
testcase_33 -- -
testcase_34 -- -
testcase_35 -- -
権限があれば一括ダウンロードができます
コンパイルメッセージ
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:18:10: 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."
   |
18 |     ap = head xs3
   |          ^^^^

Main.hs:19:10: 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."
   |
19 |     aq = head xs1
   |          ^^^^

Main.hs:22:25: 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."
   |
22 |     bs = xs4 ++ [bp] ++ tail xs3 ++ [bq] ++ tail xs1
   |                         ^^^^

Main.hs:22:45: 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."
   |
22 |     bs = xs4 ++ [bp] ++ tail xs3 ++ [bq] ++ tail xs1
   |                                             ^^^^
[2 of 2] Linking a.out

ソースコード

diff # 

-- yukicoder My practice
-- author: Leonardone @ NEETSDKASU

main = getContents >>= putStrLn . unwords . map show . solve . map read . words

solve (n:xs) = baz n xs

baz n xs = foldl (bar n) xs [1 .. 2 * n - 4]

bar n xs i = foldl (\xs k -> foo k (i - k) xs) xs
           $ [k | k <- [0 .. i], k < i - k, k < n, i - k < n]
        
foo p q as = bs where
    xs1 = drop q as
    xs2 = take q as
    xs3 = drop p xs2
    xs4 = take p xs2
    ap = head xs3
    aq = head xs1
    bp = min ap aq
    bq = max ap aq
    bs = xs4 ++ [bp] ++ tail xs3 ++ [bq] ++ tail xs1
0