結果

問題 No.1110 好きな歌
ユーザー satanicsatanic
提出日時 2020-07-22 21:18:43
言語 Haskell
(9.8.2)
結果
WA  
実行時間 -
コード長 860 bytes
コンパイル時間 7,164 ms
コンパイル使用メモリ 172,160 KB
実行使用メモリ 131,840 KB
最終ジャッジ日時 2024-06-22 12:24:45
合計ジャッジ時間 53,041 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 WA -
testcase_02 WA -
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
testcase_33 WA -
testcase_34 WA -
testcase_35 WA -
testcase_36 WA -
testcase_37 WA -
testcase_38 WA -
testcase_39 WA -
testcase_40 WA -
testcase_41 WA -
testcase_42 WA -
testcase_43 WA -
testcase_44 WA -
testcase_45 WA -
testcase_46 WA -
testcase_47 WA -
testcase_48 WA -
testcase_49 WA -
testcase_50 WA -
testcase_51 WA -
testcase_52 WA -
testcase_53 WA -
権限があれば一括ダウンロードができます
コンパイルメッセージ
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:12:20: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘head’
    (imported from Data.List, 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."
   |
12 |     | otherwise = (head a, p) : makePairAry' (tail a) (p+1)
   |                    ^^^^

Main.hs:12:47: 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."
   |
12 |     | otherwise = (head a, p) : makePairAry' (tail a) (p+1)
   |                                               ^^^^

Main.hs:20:22: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘head’
    (imported from Data.List, 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 |     | null b = (snd (head a), 0) : calc' (tail a) b p
   |                      ^^^^

Main.hs:20:43: 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."
   |
20 |     | null b = (snd (head a), 0) : calc' (tail a) b p
   |                                           ^^^^

Main.hs:21:12: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘head’
    (imported from Data.List, but defined in GHC.List):
    "This is a pa

ソースコード

diff # 

{-# LANGUAGE ScopedTypeVariables #-}
module Main where
import Data.List
import Control.Monad

readLine :: Read a => IO [a]
readLine = map read . words <$> getLine

makePairAry a = makePairAry' a 0
makePairAry' a p
    | null a = []
    | otherwise = (head a, p) : makePairAry' (tail a) (p+1)

calc :: [(Int, Int)] -> [Int] -> [(Int, Int)]
calc a b = calc' a b 0

calc' :: [(Int, Int)] -> [Int] -> Int -> [(Int, Int)]
calc' a b p
    | null a = []
    | null b = (snd (head a), 0) : calc' (tail a) b p
    | fst (head a) >= head b = calc' a (tail b) (p+1)
    | otherwise = (snd (head a), p) : calc' (tail a) b p

main :: IO ()
main = do
    [n, d] <- readLine
    a <- replicateM n readLn
    -- ai - aj >= d
    -- ai >= aj + d
    let b = map (+d) (sort a) ++ [maxBound :: Int]
    putStrLn $ unlines $ map (show . snd) (sort (calc (sort (makePairAry a)) b))
0