ANARC09A - Seinfeld


I’m out of stories. For years I’ve been writing stories, some rather silly, just to make simple problems look difficult and complex problems look easy. But, alas, not for this one.

You’re given a non empty string made in its entirety from opening and closing braces. Your task is to find the minimum number of “operations” needed to make the string stable. The definition for being stable is as follows:

  1. An empty string is stable.
  2. If S is stable, then {S} is also stable.
  3. If S and T are both stable, then ST (the concatenation of the two) is also stable.

All of these strings are stable: {}, {}{}, and {{}{}}; But none of these: }{, {{}{, nor {}{.
The only operation allowed on the string is to replace an opening brace with a closing brace, or visa-versa.

Input

Your program will be tested on one or more data sets. Each data set is described on a single line. The line is a non-empty string of opening and closing braces and nothing else. No string has more than 2000 braces. All sequences are of even length.

The last line of the input is made of one or more ’-’ (minus signs.)

Output

For each test case, print the following line:

k. N

Where k is the test case number (starting at one,) and N is the minimum number of operations needed to convert the given string into a balanced one.

Example

Input:
}{
{}{}{}
{{{}
---

Output: 1. 2
2. 0
3. 1

hide comments
sherlocklives: 2016-12-28 09:06:28

k._n where _ is a whitespace.

vengatesh15: 2016-12-24 07:46:46

AC in 1 go simple stack Approach

aakash_s: 2016-12-23 14:50:10

Can anyone tell me why spoj said " You improved your score in Seinfield , Your previous score was 429"? It's classical not challenge.

akashranjan28: 2016-12-10 20:29:45

AC in 1 go... used stack approach :)

ta4ibanakanade: 2016-12-08 06:52:28

How to solve with DP?

akt_1998: 2016-10-19 16:38:07

sas #pr0_/\_

sas1905: 2016-10-12 21:53:26

Easy..!!No need of dp..!!Done using both stack approach and adhoc approach..:)

Last edit: 2016-10-12 21:56:58
lalywr: 2016-10-12 19:43:18

Was getting WAs :( but then wore Apoorv Gaurav Singh's 4k wala T-shirt . Finally AC :D

herkeyrefugee: 2016-09-20 13:28:06

Last edit: 2016-09-20 14:30:48
tana_konda: 2016-09-18 09:41:28

I used a stack b/c that's how my mind worked and it didn't time out lol.


Added by:Mohammad Kotb
Date:2009-11-28
Time limit:3.236s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64 BASH JS-RHINO
Resource:http://www.icpc-anarc.org