結果

問題 No.313 π
ユーザー こまる
提出日時 2020-11-08 00:42:11
言語 Haskell
(9.10.1)
結果
AC  
実行時間 9 ms / 5,000 ms
コード長 1,793 bytes
コンパイル時間 3,298 ms
コンパイル使用メモリ 215,544 KB
実行使用メモリ 8,192 KB
最終ジャッジ日時 2024-07-22 14:59:19
合計ジャッジ時間 4,794 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 32
権限があれば一括ダウンロードができます
コンパイルメッセージ
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    #-}
{-# LANGUAGE OverloadedLists #-}
import           Control.Monad
import           Control.Monad.State
import           Data.Coerce
import           Data.Maybe
import           Data.Word
import           Unsafe.Coerce
import qualified Data.ByteString                   as BS
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
piDist :: VU.Vector Int
piDist = [20104, 20063, 19892, 20011, 19874, 20199, 19898, 20163, 19956, 19841]
{-# INLINE piDist #-}
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 #-}
main :: IO ()
main = do
  bs <- (VU.map (subtract (48 :: Word8))) <$> seqInput 200002
  dp <- VUM.replicate 10 (0 :: Int)
  rep 200002 $ \i -> when (bs VU.! i /= 254) $ VUM.unsafeModify dp succ (unsafeCoerce $ bs VU.! i)
  xs <- VU.unsafeFreeze dp
  let ys = VU.zipWith (-) piDist xs
      a  = fromJust $ VU.findIndex (< 0) ys
      b  = fromJust $ VU.findIndex (> 0) ys
  putStrLn $ show a <> " " <> show b
type CParser a = StateT BSC8.ByteString Maybe a
runCParser :: CParser a -> BSC8.ByteString -> Maybe (a, BSC8.ByteString)
runCParser = runStateT
{-# INLINE runCParser #-}
byte :: CParser Word8
byte = coerce BS.uncons
{-# INLINE byte #-}
seqInput :: Int -> IO (VU.Vector Word8)
seqInput n = VU.unfoldrN n (runCParser byte) <$> BSC8.getLine
{-# INLINE seqInput #-}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0