結果

問題 No.22 括弧の対応
ユーザー ducktail
提出日時 2018-01-17 21:28:24
言語 Haskell
(9.10.1)
結果
AC  
実行時間 3 ms / 5,000 ms
コード長 464 bytes
コンパイル時間 4,181 ms
コンパイル使用メモリ 173,696 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-07-20 07:28:50
合計ジャッジ時間 4,916 ms
ジャッジサーバーID
(参考情報)
judge4 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 19
権限があれば一括ダウンロードができます
コンパイルメッセージ
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:11:29: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘head’
    (imported from Prelude, but defined in GHC.List):
    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
   |
11 |                     else if head st == k then i
   |                             ^^^^

Main.hs:12:46: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘head’
    (imported from Prelude, but defined in GHC.List):
    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
   |
12 |                          else if i == k then head st
   |                                              ^^^^

Main.hs:13:47: 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 |                               else f (i + 1) (tail st) cs
   |                                               ^^^^
[2 of 2] Linking a.out

ソースコード

diff #

import Control.Applicative ((<$>), (<*>))

main :: IO ()
main = do
  solve <$> getl (map read . words) <*> getLine >>= print

solve :: [Int] -> String -> Int
solve [n, k] s = f 1 [] s
  where
    f i st (c:cs) = if c == '(' then f (i + 1) (i : st) cs
                    else if head st == k then i
                         else if i == k then head st
                              else f (i + 1) (tail st) cs

getl :: (String -> a) -> IO a
getl f = f <$> getLine
0