Codeforces 612C

Description
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 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.

Sample Input
Input
[<}){}
Output
2
Input
{()}[]
Output
0
Input
]]
Output
Impossible

题意：符号可以改变，符号的方向不能改变，提问要改变多少个符号可以匹配成对的“ 括号 ”

#include <cstdio>
#include <stack>
#include <cstring>
using namespace std;
#define M 1000010
int n;
void sta(char a[])
{
    stack<char> s;
    int ans = 0;
    for(int i=0; i<n; i++)
    {
        if(a[i] == '<' || a[i] == '(' || a[i] == '{' || a[i] == '[')
        {
            s.push(a[i]); //将所有左括号压入栈里 
        }
        else
        {
            if(s.empty())//如果左括号没有了，但是右括号还有 
            {
                printf("Impossible\n");
                return ;
            }
            switch(a[i])//匹配没有一个括号 
            {
                case ')':
                    {
                        if(s.top() != '(')  ans++;//括号不一样者改变 
                        break;
                    }
                case '>':
                    {
                        if(s.top() != '<')  ans++;
                        break;
                    }
                case '}':
                    {
                        if(s.top() != '{')  ans++;
                        break;
                    }
                case ']':
                    {
                        if(s.top() != '[')  ans++;
                        break;
                    }
            }
            s.pop();//注意要退栈 
        }
    }
    if(s.empty())//正好完全匹配 
    {
        printf("%d\n", ans);
    }
    else
    {
        printf("Impossible\n");
    }
}
int main()
{
    char a[M];
    while(scanf("%s", a) != EOF)
    {
        n = strlen(a);
        sta(a);
    }

    return 0;
}