习题6-1(uva-673)

#include <iostream>
#include <istream>
#include <sstream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>


#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;
int main()
{
	string in;
	int n;
	while (cin >> n) {
		cin.ignore();
		while (n--) {
			int ch, top, isok = 1;
			getline(cin, in);

			stack<char> ms;

			for (int i = 0; i < in.size(); ++i) {
				ch = in[i];
				if (ch == '(' || ch == '[') ms.push(ch);
				else {
					if (ms.empty()) { isok = false; break; }
					top = ms.top(); ms.pop();
					if (top == '(' && ch == ')') continue;
					else if (top == '[' && ch == ']') continue;

					isok = false;
					break;
				}
			}
			if (isok && ms.empty()) cout << "Yes" << endl;
			else cout << "No" << endl;
		}
	}

	return 0;
}