結果

問題 No.120 傾向と対策：門松列（その１）
コンテスト
ユーザー momen999
提出日時 2017-04-19 15:06:22
言語 Haskell
(9.10.1)
結果
WA  
実行時間 -
コード長 1,592 bytes
コンパイル時間 2,185 ms
コンパイル使用メモリ 171,392 KB
実行使用メモリ 56,064 KB
最終ジャッジ日時 2024-07-19 09:25:57
合計ジャッジ時間 4,588 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other WA * 4
権限があれば一括ダウンロードができます
コンパイルメッセージ
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:11:33: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘tail’
    (imported from Data.List, 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."
   |
11 | oddLine (x:xs) = x : (oddLine $ tail xs)
   |                                 ^^^^
[2 of 2] Linking a.out

ソースコード

diff # 

import Control.Monad
import Data.List
import Data.Tuple

sndSort a b | snd a < snd b = LT
            | otherwise     = GT

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         -- そもそも竹が3本ない
    | otherwise     = searchKadomatsu (n-3) l' + 1
    where
        decrementSnd x = (fst x, snd x - 1)
        abc = [decrementSnd a,decrementSnd b,decrementSnd c]
        abc' = filter ((>0).snd) abc 
        l'  | length abc' == 0  = l
            | otherwise         = abc' ++ l

kadomatsu _ [] _ = []
kadomatsu _ _ [] = []
kadomatsu 0 _ _ = []
kadomatsu t (n:ns) (lt:lts) = searchKadomatsu n lt : kadomatsu (t-1) ns lts

kadomatsuTuple [] = []
kadomatsuTuple (l:ls)= (l, c + 1) : kadomatsuTuple ls'
    where
        iter _ [] = 0
        iter x (a:as)   | x == a    = iter x as + 1
                        | otherwise = 0
        c = iter l 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]   -- [[Int]]
        l' = [kadomatsuTuple x | x <- l]        -- [[(Int,Int)]]
        l'' = [reverse $ sortBy sndSort x | x <- l']
    mapM_ print $ kadomatsu t n l''
0