結果
問題 | No.2299 Antitypoglycemia |
ユーザー | mtwtkman |
提出日時 | 2023-05-14 21:00:42 |
言語 | Haskell (9.8.2) |
結果 |
AC
|
実行時間 | 58 ms / 2,000 ms |
コード長 | 674 bytes |
コンパイル時間 | 2,478 ms |
コンパイル使用メモリ | 174,464 KB |
実行使用メモリ | 16,000 KB |
最終ジャッジ日時 | 2024-05-07 14:28:58 |
合計ジャッジ時間 | 3,812 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 36 ms
14,976 KB |
testcase_04 | AC | 37 ms
14,848 KB |
testcase_05 | AC | 22 ms
11,264 KB |
testcase_06 | AC | 37 ms
14,848 KB |
testcase_07 | AC | 10 ms
9,088 KB |
testcase_08 | AC | 33 ms
13,952 KB |
testcase_09 | AC | 37 ms
14,720 KB |
testcase_10 | AC | 15 ms
9,984 KB |
testcase_11 | AC | 15 ms
10,368 KB |
testcase_12 | AC | 41 ms
14,080 KB |
testcase_13 | AC | 54 ms
14,976 KB |
testcase_14 | AC | 6 ms
7,296 KB |
testcase_15 | AC | 6 ms
6,784 KB |
testcase_16 | AC | 18 ms
10,880 KB |
testcase_17 | AC | 12 ms
10,112 KB |
testcase_18 | AC | 41 ms
15,488 KB |
testcase_19 | AC | 41 ms
15,360 KB |
testcase_20 | AC | 58 ms
15,872 KB |
testcase_21 | AC | 58 ms
16,000 KB |
testcase_22 | AC | 41 ms
15,488 KB |
testcase_23 | AC | 1 ms
5,376 KB |
testcase_24 | AC | 1 ms
5,376 KB |
testcase_25 | AC | 1 ms
5,376 KB |
testcase_26 | AC | 1 ms
5,376 KB |
testcase_27 | AC | 1 ms
5,376 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:26:29: 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." | 26 | let [n, a, b] = map read [head vs, vs !! 1, vs !! 2] | ^^^^ [2 of 2] Linking a.out
ソースコード
split :: String -> [String] split = go ("", []) where go :: (String, [String]) -> String -> [String] go (a, acc) "" = acc <> [a] go (a, acc) (' ' : xs) = go ("", acc <> [a]) xs go (a, acc) (x : xs) = go (a <> [x], acc) xs prompt :: IO [String] prompt = do split <$> getLine m = 998244353 fac :: Integer -> Integer fac 0 = 1 fac n = (fac (n - 1) * n) `mod` m solve :: Integer -> Integer -> Integer -> Integer solve n a b = let r = (fac n + ((m - 2) * fac (n - 1)) `mod` m) `mod` m in if a /= b then (r + fac (n - 2)) `mod` m else r main :: IO () main = do vs <- prompt let [n, a, b] = map read [head vs, vs !! 1, vs !! 2] print $ solve n a b