結果

問題 No.406 鴨等間隔の法則
コンテスト
ユーザー Leonardone
提出日時 2016-08-09 06:31:42
言語 Haskell
(9.14.1)
コンパイル:
ghc -rtsopts -with-rtsopts=-K1G -o a.out -O2 _filename_
実行:
./a.out
結果
WA  
実行時間 -
コード長 326 bytes
記録
記録タグの例:
初AC ショートコード 純ショートコード 純主流ショートコード 最速実行時間
コンパイル時間 2,444 ms
コンパイル使用メモリ 197,248 KB
実行使用メモリ 25,216 KB
最終ジャッジ日時 2026-05-07 13:48:59
合計ジャッジ時間 8,778 ms
ジャッジサーバーID
（参考情報） 		judge2_0 / judge1_1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2 WA * 1
other AC * 27 WA * 2
権限があれば一括ダウンロードができます
コンパイルメッセージ
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:6:45: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘tail’
    (imported from Prelude, 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"."
  |
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.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 |     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.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"."
   |
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.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"."
   |
11 |     ed = head $ reverse ys
   |          ^^^^

[2 of 2] Linking a.out

ソースコード

diff #
raw source code 

-- 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 == ed then "YES" else "NO"
0