結果

問題 No.37 遊園地のアトラクション
ユーザー こまるこまる
提出日時 2020-10-21 15:29:57
言語 Haskell
(9.10.1)
結果
AC  
実行時間 5 ms / 5,000 ms
コード長 2,276 bytes
コンパイル時間 14,952 ms
コンパイル使用メモリ 249,584 KB
実行使用メモリ 6,820 KB
最終ジャッジ日時 2024-10-10 13:45:52
合計ジャッジ時間 14,886 ms
ジャッジサーバーID
(参考情報)
judge2 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 4
other AC * 27
権限があれば一括ダウンロードができます
コンパイルメッセージ
Loaded package environment from /home/judge/.ghc/x86_64-linux-9.8.2/environments/default
[1 of 2] Compiling Main             ( Main.hs, Main.o )
[2 of 2] Linking a.out

ソースコード

diff #
プレゼンテーションモードにする

{-# LANGUAGE BangPatterns #-}
import Control.Monad
import Control.Monad.Fix
import Control.Monad.State
import Data.Char
import Data.Coerce
import Data.IORef
import qualified Data.ByteString.Char8 as BSC8
import qualified Data.Vector.Fusion.Stream.Monadic as VFSM
import qualified Data.Vector.Unboxed as VU
import qualified Data.Vector.Unboxed.Mutable as VUM
main :: IO ()
main = do
t <- readLn :: IO Int
m <- readLn :: IO Int
cs <- seqInput m
vs <- seqInput m
dp <- VUM.replicate 10010 (0 :: Int)
rep m $ \i -> rehf (vs VU.! i) $ \j -> rev t (cs VU.! i) $ \k -> do
item <- VUM.unsafeRead dp (k - cs VU.! i)
VUM.unsafeModify dp (max (item + j)) k
print =<< VUM.unsafeRead dp t
stream :: Monad m => Int -> Int -> VFSM.Stream m Int
stream !l !r = VFSM.Stream step l
where
step x
| x < r = return $ VFSM.Yield x (x + 1)
| otherwise = return $ VFSM.Done
{-# INLINE [0] step #-}
{-# INLINE [1] stream #-}
rep :: Monad m => Int -> (Int -> m ()) -> m ()
rep n = flip VFSM.mapM_ (stream 0 n)
{-# INLINE rep #-}
streamHalf :: Monad m => Int -> Int -> VFSM.Stream m Int
streamHalf !l !r = VFSM.Stream step r
where
step x
| x > l = return $ VFSM.Yield x (x `div` 2)
| otherwise = return $ VFSM.Done
{-# INLINE [0] step #-}
{-# INLINE [1] streamHalf #-}
rehf :: Monad m => Int -> (Int -> m ()) -> m ()
rehf n = flip VFSM.mapM_ (streamHalf 0 n)
{-# INLINE rehf #-}
streamR :: Monad m => Int -> Int -> VFSM.Stream m Int
streamR !l !r = VFSM.Stream step r
where
step x
| x >= l = return $ VFSM.Yield x (x - 1)
| otherwise = return $ VFSM.Done
{-# INLINE [0] step #-}
{-# INLINE [1] streamR #-}
rev :: Monad m => Int -> Int -> (Int -> m ()) -> m ()
rev r l = flip VFSM.mapM_ (streamR l r)
{-# INLINE rev #-}
type CParser a = StateT BSC8.ByteString Maybe a
runCParser :: CParser a -> BSC8.ByteString -> Maybe (a, BSC8.ByteString)
runCParser = runStateT
{-# INLINE runCParser #-}
int :: CParser Int
int = coerce $ BSC8.readInt . BSC8.dropWhile isSpace
{-# INLINE int #-}
seqInput :: Int -> IO (VU.Vector Int)
seqInput n = VU.unfoldrN n (runCParser int) <$> BSC8.getLine
{-# INLINE seqInput #-}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0