Parentheses Balance

You are given a string consisting of parentheses () and []. A string of this type is said to be correct:
(a) if it is the empty string
(b) if A and B are correct, AB is correct,
© if A is correct, (A) and [A] is correct.
Write a program that takes a sequence of strings of this type and check their correctness. Your
program can assume that the maximum string length is 128.
Input
The file contains a positive integer n and a sequence of n strings of parentheses ‘()’ and ‘[]’, one string
a line.
Output
A sequence of ‘Yes’ or ‘No’ on the output file.
Sample Input
3
([])
(([()])))
([()])()
Sample Output
Yes
No
Yes
题意： A由()或[]组成且满足（a）空字符串（b）A和B，AB （c）(A)和[A]就输出Yes,否则输出No.
方法：用栈实现

#include <bits/stdc++.h>

using namespace std;

int main()
{   string a;
    int m;
    cin>>m;
    getchar();
    while(m--)
    {   stack<char> s;
        cin.clear();
        getline(cin,a);
        int  f=1;
        for(int i=0;i<a.size();i++)
        { if(a[i]=='('||a[i]=='[')
             s.push(a[i]);
        else if(!s.empty()&&a[i]==')'&&s.top()=='(')
            s.pop();
       else if(!s.empty()&&a[i]==']'&&s.top()=='[')
            s.pop();
        else {f=0;break;}
        }
             if(f&&s.empty())
                cout<<"Yes"<<endl;
             else
                cout<<"No"<<endl;
    }
    return 0;
}