結果
問題 |
No.457 (^^*)
|
ユーザー |
|
提出日時 | 2017-05-13 19:20:29 |
言語 | Haskell (9.10.1) |
結果 |
TLE
|
実行時間 | - |
コード長 | 954 bytes |
コンパイル時間 | 5,146 ms |
コンパイル使用メモリ | 168,448 KB |
実行使用メモリ | 15,648 KB |
最終ジャッジ日時 | 2024-09-15 12:18:04 |
合計ジャッジ時間 | 8,639 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge6 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 12 TLE * 1 -- * 7 |
コンパイルメッセージ
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:12:68: 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." | 12 | | star == "" = iter (hat ++ tail ws) | ^^^^ Main.hs:13:68: 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." | 13 | | (length . filter (== '^')) hat < 2 = iter (hat ++ tail star ++ ws) | ^^^^ [2 of 2] Linking a.out
ソースコード
breakLastRParenthesis xs = reverse $ snd $ break (== ')') $ reverse xs breakHeadLParenthesis xs = snd $ break (== '(') xs solve xs = [show (hidarimuki xs), show (migimuki xs)] hidarimuki :: String -> Int hidarimuki [] = 0 hidarimuki (x:xs) = iter xs + hidarimuki (breakHeadLParenthesis xs) where iter cs | ws == "" = 0 | star == "" = iter (hat ++ tail ws) | (length . filter (== '^')) hat < 2 = iter (hat ++ tail star ++ ws) | otherwise = (length . filter (== ')')) ws where (w, ws) = break (== ')') cs (hat, star) = break (== '*') w migimuki :: String -> Int migimuki xs = hidarimuki $ reverse $ map (\x -> if x == ')' then '(' else if x == '(' then ')' else x) xs main = getLine >>= putStrLn . unwords . solve . breakLastRParenthesis . breakHeadLParenthesis