結果
問題 | No.250 atetubouのzetubou |
ユーザー | alpha_virginis |
提出日時 | 2017-02-22 15:53:57 |
言語 | Haskell (9.8.2) |
結果 |
AC
|
実行時間 | 3,541 ms / 5,000 ms |
コード長 | 1,108 bytes |
コンパイル時間 | 1,576 ms |
コンパイル使用メモリ | 161,288 KB |
実行使用メモリ | 15,712 KB |
最終ジャッジ日時 | 2023-08-29 01:24:26 |
合計ジャッジ時間 | 44,947 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2,043 ms
14,672 KB |
testcase_01 | AC | 362 ms
13,416 KB |
testcase_02 | AC | 3,132 ms
15,312 KB |
testcase_03 | AC | 3,541 ms
15,712 KB |
testcase_04 | AC | 3,072 ms
15,280 KB |
testcase_05 | AC | 3,172 ms
15,272 KB |
testcase_06 | AC | 2,452 ms
14,544 KB |
testcase_07 | AC | 1,192 ms
13,932 KB |
testcase_08 | AC | 2,911 ms
14,884 KB |
testcase_09 | AC | 2,202 ms
15,064 KB |
testcase_10 | AC | 3,173 ms
15,340 KB |
testcase_11 | AC | 1,892 ms
14,740 KB |
testcase_12 | AC | 2,892 ms
15,012 KB |
testcase_13 | AC | 1,592 ms
14,188 KB |
testcase_14 | AC | 32 ms
13,180 KB |
testcase_15 | AC | 1,251 ms
14,568 KB |
testcase_16 | AC | 1,243 ms
14,316 KB |
testcase_17 | AC | 1,233 ms
14,176 KB |
testcase_18 | AC | 1,242 ms
14,760 KB |
testcase_19 | AC | 1,253 ms
14,704 KB |
testcase_20 | AC | 3 ms
7,108 KB |
testcase_21 | AC | 4 ms
8,596 KB |
コンパイルメッセージ
Loaded package environment from /home/judge/.ghc/x86_64-linux-9.6.1/environments/default [1 of 2] Compiling Main ( Main.hs, Main.o ) [2 of 2] Linking a.out
ソースコード
{-# LANGUAGE OverloadedStrings #-} module Main where import Data.Maybe import qualified Data.ByteString.Char8 as C import Control.Monad(forM_) import Data.Int import Data.List import Data.Array import Data.Word import Data.Bits import qualified Data.IntMap as IntMap import qualified Data.Map as Map yes :: C.ByteString yes = "AC" no :: C.ByteString no = "ZETUBOU" getInts :: IO [Int] getInts = do ss <- C.getLine return $ map (fst . fromJust . C.readInt) $ C.words ss getIntss :: Int -> IO [[Int]] getIntss 0 = return [] getIntss n = do xs <- getInts xss <- getIntss (n - 1) return $ xs : xss -- end standard template -- fact :: Integer -> Integer fact 0 = 1 fact x = x * (fact (x - 1)) combination :: Integer -> Integer -> Integer combination n r = fact n `div` (fact (n - r) * fact r) main :: IO () main = do [q] <- getInts xss <- getIntss q let res = solve xss forM_ res $ \x -> C.putStrLn x solve :: [[Int]] -> [C.ByteString] solve [] = [] solve ([d,x,t]:xs) = y : solve xs where y = if combination (toEnum (d + x - 1)) (toEnum (d - 1)) <= toEnum t then yes else no