結果

問題 No.120 傾向と対策：門松列（その１）
コンテスト
ユーザー momen999
提出日時 2017-04-19 21:25:13
言語 Haskell
(9.14.1)
コンパイル:
ghc -rtsopts -with-rtsopts=-K1G -o a.out -O2 _filename_
実行:
./a.out
結果
AC  
実行時間 311 ms / 5,000 ms
コード長 1,234 bytes
記録
記録タグの例:
初AC ショートコード 純ショートコード 純主流ショートコード 最速実行時間
コンパイル時間 1,474 ms
コンパイル使用メモリ 195,144 KB
実行使用メモリ 253,000 KB
最終ジャッジ日時 2026-04-02 15:50:24
合計ジャッジ時間 8,608 ms
ジャッジサーバーID
（参考情報） 		judge3_1 / judge2_1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 4
権限があれば一括ダウンロードができます
コンパイルメッセージ
Loaded package environment from /home/judge/.ghc/x86_64-linux-9.14.1/environments/default
[1 of 2] Compiling Main             ( Main.hs, Main.o )
Main.hs:9:33: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘tail’
    (imported from Data.List, but defined in GHC.Internal.List):
    "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  |
9 | oddLine (x:xs) = x : (oddLine $ tail xs)
  |                                 ^^^^

Main.hs:36:33: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘head’
    (imported from Data.List, but defined in GHC.Internal.List):
    "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
   |
36 |         c = length $ filter (== head ls) ls
   |                                 ^^^^

[2 of 2] Linking a.out

ソースコード

diff #
raw source code 

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