結果

問題 No.2871 Universal Serial Bus
ユーザー torus711torus711
提出日時 2024-09-06 21:56:51
言語 Haskell
(9.10.1)
結果
AC  
実行時間 13 ms / 2,000 ms
コード長 1,647 bytes
コンパイル時間 7,516 ms
コンパイル使用メモリ 181,428 KB
実行使用メモリ 9,728 KB
最終ジャッジ日時 2024-09-06 21:57:58
合計ジャッジ時間 8,531 ms
ジャッジサーバーID
(参考情報)
judge1 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 18
権限があれば一括ダウンロードができます
コンパイルメッセージ
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 BinaryLiterals #-}
{-# LANGUAGE MultiWayIf #-}
{-# LANGUAGE NumDecimals #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE TupleSections #-}
{-# LANGUAGE FlexibleContexts #-}
{-# OPTIONS_GHC -O2 #-}
{-# OPTIONS_GHC -Wno-tabs #-}
import Control.Applicative
import Control.Arrow
import Control.Monad
import Control.Monad.ST
import Data.Char
import Data.List
import Data.Maybe
import qualified Data.ByteString.Char8 as B
import Data.Array
import Data.Array.ST.Safe
import Data.STRef
import Debug.Trace
import Text.Printf
readInt = readLn :: IO Int
readInteger = readLn :: IO Integer
readInts = map ( fst . fromJust . B.readInt ) . B.words <$> B.getLine
readIntegers = map ( fst . fromJust . B.readInteger ) . B.words <$> B.getLine
which a b f = if f then a else b
mp [ a, b ] = ( a, b )
modifyArray a i f = writeArray a i =<< f <$> readArray a i
printList [] = putChar '\n'
printList [a] = print a
printList (a:as) = putStr ( show a ) >> putChar ' ' >> printList as
main = do
[ h, w ] <- readInts
[ ss, ts ] <- replicateM 2 $ replicateM h getLine
let
es :: Maybe [Double] = case ( match ss ts, match ( rev ss ) ts ) of
( True, True ) -> Just $ f 1 [ 0 .. ]
( True, False ) -> Just $ f 1 [ 0, 2 .. ]
( False, True ) -> Just $ f 1 [ 1, 3 .. ]
( False, False ) -> Nothing
case es of
Just es -> printf "%.12f\n" $ sum $ take 100000 es
otherwise -> print (-1)
rev = reverse . map reverse
match ss ts = and $ zipWith match' ss ts
where
match' s t = and $ zipWith (/=) s t
f _ [] = []
f p (i:is) = ( i + 1 ) * p * p' : f ( p * ( 1 - p' ) ) is
where
p' = 1 - ( 2 ** (-i) )
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0