codeforces 612C Replace To Make Regular Bracket Sequence 傻瓜栈 符号匹配

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.

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

符号可以改变，符号的方向不能改变，提问要改变多少个符号可以匹配成对的“ 括号 ”
一个简单的符号匹配 用栈就好。傻缺了。。还想着模拟中间变化。

#include <bits/stdc++.h>
using namespace std;

int d[5];

stack<char> ss;
int main()
{
    int ff=0;

    string s;
    cin>>s;
    int a=0,b=0;
    int len=s.length();
    int sum=0;
    int flag=0;
    for(int i=0;i<len;i++)
    {

        if(s[i]=='('||s[i]=='['||s[i]=='{'||s[i]=='<')
        ss.push(s[i]);
        else
        {
            if(ss.size()==0)
            {
            flag=1; 
            break;
            }
            if(s[i]==')')
            {
                if(ss.top()=='(')
                ss.pop();
                else 
                {
                    ss.pop();
                    sum++;
                }
            }
            else if(s[i]==']')
            {
                if(ss.top()=='[')
                ss.pop();
                else
                {
                    ss.pop();
                    sum++;
                }
            }
           else if(s[i]=='}')
            {

                if(ss.top()=='{')
                ss.pop();
                else
                {
                    ss.pop();
                    sum++;
                }
            }
            else if(s[i]=='>')
            {
                if(ss.top()=='<')
                ss.pop();
                else
                {
                    ss.pop();
                    sum++;
                }
            }
        }
    }
    if(flag||!ss.empty())
    cout<<"Impossible"<<endl;
    else cout<<sum<<endl;
}