結果
問題 | No.406 鴨等間隔の法則 |
ユーザー | Leonardone |
提出日時 | 2016-08-09 06:31:42 |
言語 | Haskell (9.8.2) |
結果 |
WA
|
実行時間 | - |
コード長 | 326 bytes |
コンパイル時間 | 10,907 ms |
コンパイル使用メモリ | 173,056 KB |
実行使用メモリ | 24,320 KB |
最終ジャッジ日時 | 2024-04-24 20:14:32 |
合計ジャッジ時間 | 11,767 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 155 ms
13,952 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 1 ms
5,376 KB |
testcase_03 | WA | - |
testcase_04 | AC | 417 ms
23,040 KB |
testcase_05 | AC | 121 ms
13,056 KB |
testcase_06 | AC | 134 ms
13,952 KB |
testcase_07 | AC | 136 ms
14,336 KB |
testcase_08 | AC | 414 ms
23,040 KB |
testcase_09 | AC | 484 ms
23,296 KB |
testcase_10 | AC | 157 ms
14,848 KB |
testcase_11 | AC | 332 ms
20,992 KB |
testcase_12 | AC | 205 ms
17,152 KB |
testcase_13 | AC | 187 ms
16,128 KB |
testcase_14 | AC | 255 ms
19,968 KB |
testcase_15 | WA | - |
testcase_16 | AC | 24 ms
9,728 KB |
testcase_17 | AC | 12 ms
8,576 KB |
testcase_18 | AC | 20 ms
9,216 KB |
testcase_19 | AC | 24 ms
10,112 KB |
testcase_20 | AC | 33 ms
10,880 KB |
testcase_21 | AC | 42 ms
10,624 KB |
testcase_22 | AC | 60 ms
12,288 KB |
testcase_23 | AC | 223 ms
16,896 KB |
testcase_24 | AC | 219 ms
19,072 KB |
testcase_25 | AC | 472 ms
24,192 KB |
testcase_26 | AC | 336 ms
23,168 KB |
testcase_27 | WA | - |
testcase_28 | AC | 319 ms
24,320 KB |
testcase_29 | AC | 336 ms
23,040 KB |
testcase_30 | AC | 325 ms
23,040 KB |
testcase_31 | AC | 440 ms
24,064 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
ソースコード
-- 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"