結果
問題 |
No.366 ロボットソート
|
ユーザー |
|
提出日時 | 2018-05-29 12:37:03 |
言語 | Haskell (9.10.1) |
結果 |
AC
|
実行時間 | 10 ms / 2,000 ms |
コード長 | 724 bytes |
コンパイル時間 | 5,711 ms |
コンパイル使用メモリ | 171,520 KB |
実行使用メモリ | 8,448 KB |
最終ジャッジ日時 | 2024-06-30 08:00:45 |
合計ジャッジ時間 | 6,507 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 23 |
コンパイルメッセージ
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:21:37: 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." | 21 | isSorted xs = and $ zipWith (<) xs (tail xs) | ^^^^ [2 of 2] Linking a.out
ソースコード
import Control.Applicative ((<$>), (<*>)) import Data.List (transpose, foldl', sort) import Data.List.Split (chunksOf) main :: IO () main = solve <$> f <*> f >>= print where f = map read <$> words <$> getLine solve :: [Int] -> [Int] -> Int solve [_, k] = g . foldr f (0, []) . transpose . chunksOf k where f xs (ct, ls) = let (ct', ls') = (swapCount xs, sort xs) in (ct + ct', ls' : ls) g (ct, xs) | (isSorted . concat . transpose) xs = ct | otherwise = -1 swapCount = fst . foldl' f (0, []) where f (ct, ys) x = let ct' = length . filter (x<) $ ys in (ct + ct', x:ys) isSorted :: [Int] -> Bool isSorted xs = and $ zipWith (<) xs (tail xs)