【小米oj】 括号配对

堆栈的基本应用

#define mm(a) memset(a,0,sizeof(a));
#define max(x,y) (x)>(y)?(x):(y)
#define min(x,y) (x)<(y)?(x):(y)
#define Fopen freopen("1.in","r",stdin); freopen("m.out","w",stdout);
#define rep(i,a,b) for(ll i=(a);i<=(b);i++)
#define per(i,b,a) for(ll i=(b);i>=(a);i--)
#include<bits/stdc++.h>
typedef long long ll;
#define PII pair<ll,ll>
using namespace std;
const int INF=0x3f3f3f3f;
const int MAXN=(int)2e6+5;

char s[MAXN];
stack<char>stk;
map<char,char>mp;
int main()
{
    mp['(']=')';
    mp[')']='(';
    mp['{']='}';
    mp['}']='{';
    mp['[']=']';
    mp[']']='[';
    scanf("%s",s);
    for(int i=0;s[i];i++){
        if(stk.empty())stk.push(s[i]);
        else {
            if(stk.top()==mp[s[i]])stk.pop();
            else stk.push(s[i]);
        }
    }
    printf("%d",stk.empty()?1:0);
    return 0;
}