結果

問題 No.406 鴨等間隔の法則
ユーザー Leonardone
提出日時 2016-08-09 06:33:42
言語 Haskell
(9.10.1)
結果
AC  
実行時間 351 ms / 2,000 ms
コード長 336 bytes
コンパイル時間 5,775 ms
コンパイル使用メモリ 174,976 KB
実行使用メモリ 23,936 KB
最終ジャッジ日時 2024-07-07 11:35:43
合計ジャッジ時間 11,896 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 29
権限があれば一括ダウンロードができます
コンパイルメッセージ
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:6:45: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘tail’
    (imported from Prelude, 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."
  |
6 | main = putStrLn . solve . sort . map read . tail . words =<< getContents
  |                                             ^^^^

Main.hs:9:42: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘tail’
    (imported from Prelude, 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."
  |
9 |     ys = sort . map (\(a, b) -> a - b) $ tail xs `zip` xs
  |                                          ^^^^

Main.hs:10:10: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘head’
    (imported from Prelude, 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."
   |
10 |     hd = head ys
   |          ^^^^

Main.hs:11:10: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘head’
    (imported from Prelude, 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."
   |
11 |     ed = head $ reverse ys
   |          ^^^^
[2 of 2] Linking a.out

ソースコード

diff # 

-- yukicoder My Practice
-- author: Leonardone @ NEETSDKASU

import Data.List (sort)

main = putStrLn . solve . sort . map read . tail . words =<< getContents

solve xs = ans where
    ys = sort . map (\(a, b) -> a - b) $ tail xs `zip` xs
    hd = head ys
    ed = head $ reverse ys
    ans = if hd > 0 && hd == ed then "YES" else "NO"
0