結果

問題 No.120 傾向と対策:門松列(その1)
ユーザー momen999momen999
提出日時 2017-04-19 21:25:13
言語 Haskell
(9.6.2)
結果
AC  
実行時間 453 ms / 5,000 ms
コード長 1,234 bytes
コンパイル時間 766 ms
コンパイル使用メモリ 159,832 KB
実行使用メモリ 58,676 KB
最終ジャッジ日時 2023-09-26 15:24:22
合計ジャッジ時間 3,426 ms
ジャッジサーバーID
(参考情報)
judge15 / judge12
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 442 ms
58,564 KB
testcase_01 AC 443 ms
58,592 KB
testcase_02 AC 212 ms
34,936 KB
testcase_03 AC 453 ms
58,676 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Loaded package environment from /home/judge/.ghc/x86_64-linux-9.6.1/environments/default
[1 of 2] Compiling Main             ( Main.hs, Main.o )
[2 of 2] Linking a.out

ソースコード

diff #

import Control.Monad
import Data.List
import Data.Tuple
import Debug.Trace

oddLine :: (Ord a) => [a] -> [a]
oddLine [] = []
oddLine (x:[]) = [x]
oddLine (x:xs) = x : (oddLine $ tail xs)

evenLine :: (Ord a) => [a] -> [a]
evenLine [] = []
evenLine (_:[]) = []
evenLine (_:[x]) = [x]
evenLine (_:x:xs) = x : (evenLine xs)

searchKadomatsu _ [] = 0
searchKadomatsu _ (a:[]) = 0
searchKadomatsu _ (a:b:[]) = 0
searchKadomatsu n (a:b:c:l)
    | n < 3         = 0
    | otherwise     = 1 + searchKadomatsu (n-3) l'
    where
        abc = filter (>0) [a - 1, b - 1, c - 1]
        l'  | length abc == 0   = l
            | otherwise         = reverse $ sort (abc ++ l)

kadomatsu _ [] _ = []
kadomatsu _ _ [] = []
kadomatsu 0 _ _ = []
kadomatsu t (n:ns) (l:ls) = searchKadomatsu n l : kadomatsu (t-1) ns ls

kadomatsuList [] = []
kadomatsuList ls = c : kadomatsuList ls'
    where
        c = length $ filter (== head ls) ls
        ls' = drop c ls

main = do
    t <- readLn
    str <- replicateM (t * 2) getLine
    let
        xs = map (map read . words) str :: [[Int]]
        n = [x !! 0 | x <- oddLine xs]
        l = [sort x | x <- evenLine xs]
        l' = map (reverse . sort . kadomatsuList) l
    mapM_ print $ kadomatsu t n l'
0