G - Replace To Make Regular Bracket Sequence

最新推荐文章于 2023-04-24 19:15:00 发布

hubayi31072

最新推荐文章于 2023-04-24 19:15:00 发布

阅读量224

点赞数

分类专栏：算法练习，栈和队列文章标签： ACM hpu 算法练习实例栈和队列练习

本文链接：https://blog.csdn.net/hubayi31072/article/details/76087449

版权

算法练习，栈和队列专栏收录该内容

6 篇文章 0 订阅

订阅专栏

点击打开链接

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 s₁ and s₂ be a RBS then the strings <s₁>s₂, {s₁}s₂, [s₁]s₂, (s₁)s₂ 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 10⁶.

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.

Example

Input

[<}){}

Output

Input

{()}[]

Output

Input

]]

Output

Impossible

题意：给定一一个字符串，其中包括( ) { } < > [ ]，如果不能前后配对（必须左括号在左，右括号在右，可以左右不匹配的可以替换），输出Impossible;可以的输出变换的次数。

题解：用栈求解，对字符数组从头开始遍历，若是左括号，存入栈中；若是右括号，则先判断栈是否为空，空的话结束循环，否则num++，一一比较删除顶部元素

#include<cstdio>
#include<cstring>
#include<stack>
using namespace std;
char a[1000001];
int main()
{
	stack<char> stk;
	scanf("%s",a);
	int le=0,r=0;
	int num=0,flag=1,l;
	l=strlen(a);
	for(int i=0;i<l;i++)
	{
		if(a[i]=='<'||a[i]=='('||a[i]=='['||a[i]=='{')
		{
			le++;
			stk.push(a[i]);
		}
		else if(a[i]=='>')
		{
			r++;
			if(stk.empty())
			{
				flag=0;
				break;
			}
			else if(stk.top()=='<')
				stk.pop();
				else{
					num++;
					stk.pop();
				}
		}
		else if(a[i]==')')
		{
			
			r++;
			if(stk.empty())
			{
				flag=0;
				break;
			}
			else if(stk.top()=='(')
				stk.pop();
				else{
					num++;
					stk.pop();
				}
		}else if(a[i]==']')
		{
			
			r++;
			if(stk.empty())
			{
				flag=0;
				break;
			}
			else if(stk.top()=='[')
				stk.pop();
				else{
					num++;
					stk.pop();
				}
		}
		else if(a[i]=='}')
		{
			
			r++;
			if(stk.empty())
			{
				flag=0;
				break;
			}
			else if(stk.top()=='{')
				stk.pop();
				else{
					num++;
					stk.pop();
				}
		}
	}
		if(le!=r)
			flag=0;
		if(flag==1)
			printf("%d\n",num);
		else printf("Impossible\n");
	return 0;
}