結果
問題 | No.672 最長AB列 |
ユーザー | torus711 |
提出日時 | 2019-01-26 15:36:39 |
言語 | Haskell (9.8.2) |
結果 |
AC
|
実行時間 | 142 ms / 2,000 ms |
コード長 | 1,188 bytes |
コンパイル時間 | 2,602 ms |
コンパイル使用メモリ | 163,052 KB |
実行使用メモリ | 60,860 KB |
最終ジャッジ日時 | 2023-10-14 10:14:32 |
合計ジャッジ時間 | 5,444 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 3 ms
6,644 KB |
testcase_01 | AC | 3 ms
6,652 KB |
testcase_02 | AC | 3 ms
6,636 KB |
testcase_03 | AC | 3 ms
6,616 KB |
testcase_04 | AC | 3 ms
6,760 KB |
testcase_05 | AC | 2 ms
6,640 KB |
testcase_06 | AC | 3 ms
6,664 KB |
testcase_07 | AC | 2 ms
6,644 KB |
testcase_08 | AC | 2 ms
6,688 KB |
testcase_09 | AC | 133 ms
60,860 KB |
testcase_10 | AC | 132 ms
56,760 KB |
testcase_11 | AC | 133 ms
56,764 KB |
testcase_12 | AC | 142 ms
55,944 KB |
testcase_13 | AC | 142 ms
56,340 KB |
testcase_14 | AC | 142 ms
56,508 KB |
testcase_15 | AC | 133 ms
56,152 KB |
testcase_16 | AC | 142 ms
56,436 KB |
testcase_17 | AC | 132 ms
56,688 KB |
testcase_18 | AC | 123 ms
56,740 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 ) Main.hs:35:1: warning: [GHC-94817] [-Wtabs] Tab character found here, and in 12 further locations. Suggested fix: Please use spaces instead. | 35 | plusminus <- map ( \c -> if c == 'A' then 1 else -1 ) <$> getLine | ^^^^^^^^ [2 of 2] Linking a.out
ソースコード
{-# LANGUAGE BangPatterns #-} {-# LANGUAGE BinaryLiterals #-} {-# LANGUAGE MultiWayIf #-} {-# LANGUAGE NumDecimals #-} {-# LANGUAGE ScopedTypeVariables #-} {-# LANGUAGE TupleSections #-} 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.ST.Safe import Data.STRef import Debug.Trace import Text.Printf readInt = readLn :: IO Int readInts = map ( fst . fromJust . B.readInt ) . B.words <$> B.getLine readNInts = readInt >>= flip replicateM readInt which a b f = if f then a else b mp [ a, b ] = ( a, b ) modifyArray array pos f = writeArray array pos =<< f <$> readArray array pos main = do plusminus <- map ( \c -> if c == 'A' then 1 else -1 ) <$> getLine let psum = scanl (+) 0 plusminus print $ maximum $ map maxdiff $ solve psum solve psum = runST $ do let n = succ $ length psum occurrences <- newArray ( -n, n ) [] :: ST s ( STArray s Int [Int] ) forM_ ( zip psum [ 0 .. ] ) $ \( value, pos ) -> modifyArray occurrences value ( pos : ) getElems occurrences maxdiff [] = 0 maxdiff as = head as - last as