結果

問題 No.1110 好きな歌
コンテスト
ユーザー satanic
提出日時 2020-07-22 21:18:43
言語 Haskell
(9.14.1)
コンパイル:
ghc -rtsopts -with-rtsopts=-K1G -o a.out -O2 _filename_
実行:
./a.out
結果
WA  
実行時間 -
コード長 860 bytes
記録
記録タグの例:
初AC ショートコード 純ショートコード 純主流ショートコード 最速実行時間
コンパイル時間 5,222 ms
コンパイル使用メモリ 194,772 KB
実行使用メモリ 138,880 KB
最終ジャッジ日時 2026-03-06 17:58:04
合計ジャッジ時間 37,411 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample WA * 3
other WA * 51
権限があれば一括ダウンロードができます
コンパイルメッセージ
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:12:20: 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"."
   |
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.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"."
   |
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.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"."
   |
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.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"."
   |
20 |     | null b = (snd (head a), 0) : calc' (tail a) b p
   |                                           ^^^^

Main.hs:21:12: war

ソースコード

diff #
raw source code 

{-# 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