結果

問題 No.490 yukiソート
コンテスト
ユーザー Leonardone
提出日時 2017-03-11 00:51:39
言語 Haskell
(9.10.1)
結果
WA  
実行時間 -
コード長 609 bytes
コンパイル時間 8,316 ms
コンパイル使用メモリ 172,288 KB
実行使用メモリ 8,320 KB
最終ジャッジ日時 2024-06-24 10:38:35
合計ジャッジ時間 3,145 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 13 WA * 21
権限があれば一括ダウンロードができます
コンパイルメッセージ
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:20: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."
   |
20 |     ap = head xs3
   |          ^^^^

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

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

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

ソースコード

diff # 

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

import Data.List (sort)

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

solve (n:xs) = sort xs :: [Int] -- 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