結果
問題 | No.10 +か×か |
ユーザー |
![]() |
提出日時 | 2017-05-20 05:03:52 |
言語 | Haskell (9.8.2) |
結果 |
AC
|
実行時間 | 1,805 ms / 5,000 ms |
コード長 | 1,308 bytes |
コンパイル時間 | 3,070 ms |
コンパイル使用メモリ | 197,376 KB |
実行使用メモリ | 72,196 KB |
最終ジャッジ日時 | 2024-12-14 15:39:29 |
合計ジャッジ時間 | 9,703 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,820 KB |
testcase_01 | AC | 2 ms
6,816 KB |
testcase_02 | AC | 1 ms
6,816 KB |
testcase_03 | AC | 1,742 ms
72,196 KB |
testcase_04 | AC | 1,012 ms
44,680 KB |
testcase_05 | AC | 2 ms
6,816 KB |
testcase_06 | AC | 1,805 ms
67,076 KB |
testcase_07 | AC | 1,020 ms
37,500 KB |
testcase_08 | AC | 226 ms
30,336 KB |
testcase_09 | AC | 522 ms
51,584 KB |
testcase_10 | AC | 5 ms
7,552 KB |
testcase_11 | AC | 2 ms
6,820 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:18:19: 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." | 18 | writeArray arr (head xs) 0 | ^^^^ Main.hs:32:16: 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." | 32 | ) arr (tail xs) | ^^^^ [2 of 2] Linking a.out
ソースコード
{-# LANGUAGE FlexibleContexts, OverloadedStrings #-} import Control.Applicative import Control.Monad import qualified Data.ByteString.Char8 as B import Data.Maybe (fromJust) import Text.Printf import Debug.Trace import Data.Array.IArray import Data.Array.ST getInts :: IO [Int] getInts = map (fst . fromJust . B.readInt) . B.words <$> B.getLine inf = 114514 g tot xs = runSTArray $ do arr <- newArray (0,tot) (-inf) writeArray arr (head xs) 0 foldM (\a x -> do a' <- newArray (0,tot) (-inf) plused <- forM [i | i <- [0..tot], i+x <= tot] (\i -> readArray a i >>= \s -> return (i+x, s*2 + 1)) forM_ plused (\(i,x) -> writeArray a' i x) multied <- forM [i | i <- [0..tot], i*x <= tot] (\i -> readArray a i >>= \s -> return (i*x, s*2)) forM_ multied $ \(i,x) -> do px <- readArray a' i if x > px then writeArray a' i x else return () return a' ) arr (tail xs) solve tot xs = (g tot xs)!tot conv x n = (\(_,_,s) -> reverse s) $ until (\(i,_,_) -> i <= 1) (\(i,x,s) -> (i-1, x `div` 2, s ++ (if x`mod`2 == 0 then "*" else "+"))) (n,x,"") main = do [n] <- getInts [tot] <- getInts xs <- getInts putStrLn $ conv (solve tot xs) n