結果

問題 No.406 鴨等間隔の法則
ユーザー LeonardoneLeonardone
提出日時 2016-08-09 06:33:42
言語 Haskell
(9.8.2)
結果
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
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 126 ms
13,696 KB
testcase_01 AC 1 ms
6,820 KB
testcase_02 AC 2 ms
6,820 KB
testcase_03 AC 2 ms
6,940 KB
testcase_04 AC 316 ms
21,888 KB
testcase_05 AC 104 ms
12,672 KB
testcase_06 AC 106 ms
13,056 KB
testcase_07 AC 115 ms
13,568 KB
testcase_08 AC 317 ms
22,912 KB
testcase_09 AC 348 ms
23,936 KB
testcase_10 AC 122 ms
13,824 KB
testcase_11 AC 266 ms
19,840 KB
testcase_12 AC 169 ms
16,640 KB
testcase_13 AC 143 ms
15,872 KB
testcase_14 AC 269 ms
19,840 KB
testcase_15 AC 14 ms
8,320 KB
testcase_16 AC 25 ms
9,728 KB
testcase_17 AC 14 ms
8,576 KB
testcase_18 AC 22 ms
8,960 KB
testcase_19 AC 24 ms
9,856 KB
testcase_20 AC 36 ms
10,624 KB
testcase_21 AC 46 ms
10,496 KB
testcase_22 AC 63 ms
12,288 KB
testcase_23 AC 176 ms
15,744 KB
testcase_24 AC 238 ms
18,944 KB
testcase_25 AC 350 ms
23,936 KB
testcase_26 AC 351 ms
22,912 KB
testcase_27 AC 193 ms
20,864 KB
testcase_28 AC 207 ms
21,120 KB
testcase_29 AC 348 ms
22,912 KB
testcase_30 AC 334 ms
22,912 KB
testcase_31 AC 328 ms
22,912 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
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