結果
問題 | No.265 数学のテスト |
ユーザー | ともき |
提出日時 | 2015-08-08 03:30:20 |
言語 | Haskell (9.8.2) |
結果 |
AC
|
実行時間 | 33 ms / 2,000 ms |
コード長 | 2,419 bytes |
コンパイル時間 | 743 ms |
コンパイル使用メモリ | 179,880 KB |
実行使用メモリ | 14,396 KB |
最終ジャッジ日時 | 2023-08-16 02:04:26 |
合計ジャッジ時間 | 2,435 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 7 ms
11,816 KB |
testcase_01 | AC | 12 ms
13,588 KB |
testcase_02 | AC | 22 ms
14,396 KB |
testcase_03 | AC | 22 ms
13,000 KB |
testcase_04 | AC | 22 ms
13,000 KB |
testcase_05 | AC | 22 ms
13,248 KB |
testcase_06 | AC | 22 ms
12,936 KB |
testcase_07 | AC | 22 ms
12,952 KB |
testcase_08 | AC | 33 ms
13,968 KB |
testcase_09 | AC | 22 ms
12,856 KB |
testcase_10 | AC | 22 ms
12,936 KB |
testcase_11 | AC | 22 ms
13,248 KB |
testcase_12 | AC | 2 ms
7,232 KB |
testcase_13 | AC | 12 ms
11,852 KB |
testcase_14 | AC | 6 ms
11,196 KB |
testcase_15 | AC | 2 ms
6,924 KB |
testcase_16 | AC | 5 ms
10,584 KB |
testcase_17 | AC | 2 ms
6,876 KB |
testcase_18 | AC | 2 ms
6,984 KB |
testcase_19 | AC | 2 ms
7,028 KB |
testcase_20 | AC | 3 ms
7,548 KB |
testcase_21 | AC | 3 ms
6,924 KB |
testcase_22 | AC | 12 ms
11,152 KB |
testcase_23 | AC | 2 ms
6,964 KB |
testcase_24 | AC | 3 ms
6,872 KB |
testcase_25 | AC | 12 ms
11,848 KB |
testcase_26 | AC | 2 ms
6,904 KB |
testcase_27 | AC | 2 ms
6,924 KB |
testcase_28 | AC | 3 ms
8,488 KB |
testcase_29 | AC | 2 ms
6,940 KB |
testcase_30 | AC | 4 ms
9,024 KB |
testcase_31 | AC | 2 ms
6,980 KB |
testcase_32 | AC | 2 ms
6,952 KB |
testcase_33 | AC | 2 ms
6,880 KB |
testcase_34 | AC | 2 ms
6,932 KB |
testcase_35 | AC | 2 ms
6,948 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
ソースコード
{-# OPTIONS_GHC -O2 -funbox-strict-fields #-} import Control.Applicative import Control.Monad.Reader import qualified Data.List as L data Exp = Con Int | Var | Mult Exp Exp | Plus Exp Exp | Bibun Exp deriving (Show) parse :: String -> Exp parse s = case expression s of (a, "") -> a (a, s ) -> error ("remain: " ++ s) expression :: String -> (Exp, String) expression s = case r of '+' : t -> (Plus h k, a) where (k,a) = expression t _ -> (h, r) where (h,r) = term s term :: String -> (Exp, String) term s = case r of '*' : t -> (Mult h k, a) where (k,a) = (term t) _ -> (h, r) where (h,r) = factor s factor :: String -> (Exp, String) factor ('d' : r) = (Bibun h, a) where (h,k) = expression (tail r) -- remove '{' a = tail k -- remove '}' factor ('x' : r) = (Var, r) factor s = (Con x, r) where [(x,r)] = reads s -- list size is constant. -- eval :: Exp -> [Int] -- eval (Con a) = a : [0,0 ..] -- eval (Var _) = 0 : 1 : [0,0..] -- eval (Mult x (Var _)) = 0 : (eval x) -- eval (Mult x (Con a)) = map (* a) $ eval x -- eval (Mult (Var _) x) = 0 : (eval x) -- eval (Mult (Con a) x) = map (* a) $ eval x -- eval (Mult _ _) = error "mult" -- eval (Plus l r) = zipWith (+) (eval l) (eval r) -- eval (Bibun r) = zipWith (*) (tail $ eval r) [1..] -- solve :: Int -> String -> [Int] -- solve max_degree = (take (max_degree+1)) . eval . parse eval :: Exp -> Reader Int [Int] eval (Con a) = do {m <- ask; return $ take m (a : [0,0 ..])} eval Var = do {m <- ask; return $ take m (0 : 1 : [0,0..])} eval (Mult x Var) = do {r <- eval x; return $ 0 : (init r)} eval (Mult (Con a) x) = do {r <- eval x; return $ map (* a) r} eval (Mult Var x) = do {r <- eval x; return $ 0 : (init r)} eval (Mult x (Con a)) = do {r <- eval x; return $ map (* a) r} eval (Mult _ _) = error "mult" eval (Plus l r) = do {a <- eval l; b <- eval r; return $ zipWith (+) a b} eval (Bibun r) = do {k <- eval r; return $ zipWith (*) ((tail k) ++ [0]) [1..]} solve :: Int -> String -> [Int] solve m s = runReader (eval (parse s)) (m+1) main :: IO () main = do n <- read <$> getLine :: IO Int d <- read <$> getLine :: IO Int s <- getLine putStrLn $ foldr (++) "" (L.intersperse " " (map show (solve d s)))