結果
問題 | No.406 鴨等間隔の法則 |
ユーザー | SamuSoft |
提出日時 | 2016-10-07 18:28:13 |
言語 | Haskell (9.8.2) |
結果 |
WA
|
実行時間 | - |
コード長 | 388 bytes |
コンパイル時間 | 11,336 ms |
コンパイル使用メモリ | 174,336 KB |
実行使用メモリ | 22,912 KB |
最終ジャッジ日時 | 2024-04-24 21:16:20 |
合計ジャッジ時間 | 11,536 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 83 ms
10,368 KB |
testcase_01 | AC | 1 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | WA | - |
testcase_04 | AC | 186 ms
16,640 KB |
testcase_05 | AC | 72 ms
10,496 KB |
testcase_06 | AC | 75 ms
9,984 KB |
testcase_07 | AC | 75 ms
10,496 KB |
testcase_08 | AC | 186 ms
16,768 KB |
testcase_09 | AC | 202 ms
16,768 KB |
testcase_10 | AC | 83 ms
10,624 KB |
testcase_11 | AC | 154 ms
12,928 KB |
testcase_12 | AC | 105 ms
12,288 KB |
testcase_13 | AC | 98 ms
12,288 KB |
testcase_14 | AC | 287 ms
18,944 KB |
testcase_15 | WA | - |
testcase_16 | AC | 19 ms
8,448 KB |
testcase_17 | AC | 11 ms
8,192 KB |
testcase_18 | AC | 19 ms
8,192 KB |
testcase_19 | AC | 28 ms
9,984 KB |
testcase_20 | AC | 39 ms
10,496 KB |
testcase_21 | AC | 29 ms
8,576 KB |
testcase_22 | AC | 69 ms
12,032 KB |
testcase_23 | AC | 110 ms
12,288 KB |
testcase_24 | AC | 245 ms
16,896 KB |
testcase_25 | AC | 206 ms
16,896 KB |
testcase_26 | AC | 365 ms
22,016 KB |
testcase_27 | WA | - |
testcase_28 | AC | 188 ms
14,848 KB |
testcase_29 | AC | 363 ms
22,144 KB |
testcase_30 | AC | 358 ms
22,912 KB |
testcase_31 | AC | 197 ms
16,640 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:4:52: 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." | 4 | main = getContents >>= putStrLn . compute . sort . tail . map readInt . words | ^^^^ [2 of 2] Linking a.out
ソースコード
import Data.List(sort) main :: IO () main = getContents >>= putStrLn . compute . sort . tail . map readInt . words readInt :: String -> Int readInt = read compute :: [Int] -> String compute (x1:x2:xs) = checkList xs (x2-x1) x2 checkList :: [Int] -> Int -> Int -> String checkList [] _ _ = "YES" checkList (x:xs) diff lst | lst == x - diff = checkList xs diff x | otherwise = "NO"