結果

問題 No.135 とりあえず1次元の問題
ユーザー はむ吉🐹
提出日時 2015-10-21 21:06:27
言語 Haskell
(9.10.1)
結果
TLE  
実行時間 -
コード長 650 bytes
コンパイル時間 9,526 ms
コンパイル使用メモリ 182,272 KB
実行使用メモリ 19,072 KB
最終ジャッジ日時 2025-01-03 07:58:55
合計ジャッジ時間 34,799 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 19 TLE * 3
権限があれば一括ダウンロードができます
コンパイルメッセージ
Loaded package environment from /home/judge/.ghc/x86_64-linux-9.10.1/environments/default
[1 of 2] Compiling Main             ( Main.hs, Main.o )
Main.hs:4:25: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘head’
    (imported from Prelude, 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"."
  |
4 | allTheSame xs = all (== head xs) xs
  |                         ^^^^

Main.hs:20:57: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘head’
    (imported from Prelude, 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 | main = print . findMinimumDistance . map read . words . head . drop 1 . lines =<< getContents
   |                                                         ^^^^

[2 of 2] Linking a.out

ソースコード

diff # 

import Data.List (nub, sort)

allTheSame :: (Eq a) => [a] -> Bool
allTheSame xs = all (== head xs) xs

adjacentElements :: Int -> [a] -> [[a]]
adjacentElements = adjacentElements' []
    where
        adjacentElements' ys n xs@(_ : xr)
            | length xs >= n = adjacentElements' (ys ++ [take n xs]) n xr
            | otherwise      = ys

findMinimumDistance :: [Int] -> Int
findMinimumDistance xs
    | allTheSame ys = 0
    | otherwise     = minimum $ map (\(x : y : _) -> y - x) $ adjacentElements 2 ys
    where ys = sort $ nub xs

main :: IO ()
main = print . findMinimumDistance . map read . words . head . drop 1 . lines =<< getContents
0