2018.1.30【 CodeForces - 612C 】解题报告（STL，栈，strlen使用注意）

C. Replace To Make Regular Bracket Sequence

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given string s consists of opening and closing brackets of four kinds <>, {}, [], (). There are two types of brackets: opening and closing. You can replace any bracket by another of the same type. For example, you can replace < by the bracket {, but you can't replace it by ) or >.

The following definition of a regular bracket sequence is well-known, so you can be familiar with it.

Let's define a regular bracket sequence (RBS). Empty string is RBS. Let s1 and s2 be a RBS then the strings <s1>s2, {s1}s2, [s1]s2, (s1)s2 are also RBS.

For example the string "[[(){}]<>]" is RBS, but the strings "[)()" and "][()()" are not.

Determine the least number of replaces to make the string s RBS.

Input

The only line contains a non empty string s, consisting of only opening and closing brackets of four kinds. The length of s does not exceed 106.

Output

If it's impossible to get RBS from s print Impossible.

Otherwise print the least number of replaces needed to get RBS from s.

Examples

input

[<}){}

output

2

input

{()}[]

output

0

input

]]

output

Impossible

【题目大意】

括号匹配问题，同侧不同类型的可以替换，不同侧的不可以替换，给定一串四种括号构成的字符串，输出最少的替换次数，或者输出不可能。

【解题思路】

利用STL里的stack，根据输入push或者pop检测即可。

注意strlen的使用。萌新在for循环判断语句里用了strlen，直接导致TLE，以后一定避免多次重复调用统一函数，先把数值存起来。

【解题代码】

#include <cstdio> 
#include <cstring>
#include <stack>
#define maxn 1000010
using namespace std;
char c[maxn];
int main()
{
	stack<char> s;
	scanf("%s", c);
	int count = 0;
	int i,flag = 0;
	int len=strlen(c);
	if (len % 2) flag = 1;//根据偶数配对先行判断一次 
	else
	{
		for (i = 0; i < len; i++)//就是在这里栽跟头了，循环判断里不应调用strlen
		{
			if (c[i] == '<' || c[i] == '(' || c[i] == '{' || c[i] == '[')
				s.push(c[i]);
			else if (!s.empty())
			{
				char getc=s.top();
				s.pop();
				if(c[i]=='>'&&getc!='<') count++;
				else if(c[i]=='}'&&getc!='{') count++;
				else if(c[i]==')'&&getc!='(') count++;
				else if(c[i]==']'&&getc!='[') count++;
				if(flag) break;
			}
			else
			{
				flag=1;
				break;
			}
		}
	}
	if (flag || s.size())
		printf("Impossible\n");
	else printf("%d\n",count);
	return 0;

}

【收获与反思】

1.循环里不要多次调用产生同一效果的函数，不然会TLE爆掉。

2.STL栈的使用熟悉：

stack <char> c;

stack <数据类型> 栈的名称;

来自学长整理的一点资料补充，放在这里方便日后查看。

常用：if(!c.empty());   char getc=c.top() ; c.pop();  c.push();