QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#277359#7894. Many Many HeadsSSH#WA 1ms3792kbC++201.2kb2023-12-06 17:59:442023-12-06 17:59:44

Judging History

你现在查看的是最新测评结果

  • [2023-12-06 17:59:44]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:3792kb
  • [2023-12-06 17:59:44]
  • 提交

answer

#include <bits/stdc++.h>
#define int long long
using namespace std;
void solve();
signed main() {
	cin.sync_with_stdio(0);
	cin.tie(0);
	int T = 1;
	cin >> T;
	while (T--) {
		solve();
	}
	return 0;
}
bool judge(string s) {
	stack<char> st;
	for (int i = 0; i < (int)s.size(); i++) {
		if (s[i] == '(') {
			st.push(s[i]);
		} else if (s[i] == ')') {
			if (!(st.size() && st.top() == '(')) {
				return false;
			}
			st.pop();
		} else if (s[i] == '[') {
			st.push(s[i]);
		} else {
			if (!(st.size() && st.top() == '[')) {
				return false;
			}
			st.pop();
		}
	}
	if (st.size())return false;
	return true;
}
void solve() {
	string s;
	cin >> s;
	int n = s.size();
	if (n >= 24) {
		cout << "No\n";
		return;
	}
	int ans = 0;
	for (int i = 0; i < (1ll << n); i++) {
		string ss = s;
		for (int j = 0; j < n; j++) {
			if ((i >> j) & 1) {
				if (s[j] == '(' || s[j] == ')') ss[j] = '(';
				else ss[j] = '[';
			} else {
				if (s[j] == '(' || s[j] == ')') ss[j] = ')';
				else ss[j] = ']';
			}
		}
		if (judge(ss)) {
			cout << ss << "\n";
			ans++;
		}
	}
	if (ans == 1) {
		cout << "Yes\n";
	} else cout << "No\n";
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0
Wrong Answer
time: 1ms
memory: 3792kb

input:

6
))
((()
[()]
()[()]()
([()])
([])([])

output:

()
Yes
(())
()()
No
[()]
Yes
(([()]))
()[()]()
No
([()])
Yes
([[()]])
([]()[])
([])([])
No

result:

wrong output format YES or NO expected, but () found [1st token]