QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#545445	#7683. Hard Brackets Problem	zzz666	WA	142ms	4572kb	C++20	737b	2024-09-03 13:00:17	2024-09-03 13:00:17

Judging History

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

[2024-09-03 13:00:17]
评测

测评结果：WA
用时：142ms
内存：4572kb

查看

[2024-09-03 13:00:17]
提交

answer

#include<bits/stdc++.h>
using namespace std;
const int N = 1e6+4;
void slove()
{
	string s;
	cin>>s;
	stack<char>sta;
	char ans[N];
	int cnt = 0 ;
	for(int i = 0 ; i < s.size() ; i++)
	{
		if(s[i] == '(')
		{
			sta.push('(');
			continue;
		}
		if(sta.empty() && s[i] == ')')
		{
			ans[++cnt] = ')';
			continue;
		}
		if(!sta.empty() && s[i] == ')')
		{
			ans[++cnt] = '(';
			sta.pop();
			continue;
		}
	}
	if(cnt == 0)
	{
		cout<<"impossible"<<endl;
		return;
	}
	while(!sta.empty())
	{
		ans[++cnt] = sta.top();
		sta.pop();
	}
	
	for(int i = 1 ; i <= cnt ; i ++ )
	{
		cout<<ans[i]; 
	}
	cout<<endl;
}
int main()
{
	int tcase;
	cin>>tcase;
	while(tcase--)
	{
		slove();
	}
}

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 1ms

memory: 4548kb

input:

3
((()))
(
)))()

output:

(((
impossible
)))(

result:

ok 3 cases (3 test cases)

Test #2:

score: -100

Wrong Answer

time: 142ms

memory: 4572kb

input:

100000
())(()()()
()())()))
)()()()()
())()(())(
((())()))
)(())()))(
)()))())))
)))))(((()
()))((()((
()((()()))
(()())())
())(()))()
(())(())))
))))(()(()
()))(())((
()((())())
()))()))()
()((())())
()()))((()
()))(()))
(()(())))
())((()))
())()((())
(()(())))
()(((()())
))))())))(
((((()()()
(()(...

output:

()((((
(()())
)((((
()((((
(((()
)((())(
)())()))
)))))((((
())(((((
(((((
(((()
()(()(
(((())
))))((((
())((((
(((((
())())(
(((((
(())(((
())(()
(((()
()(((
()((((
(((()
((((((
))))()))(
(((((((
((((((
)((((((
()(()(
))(((((
(((()(
)()(((((
)))(()(
(()()(
((()()
(((()
)((((((
(((()
)((((
(((()
)((...

result:

wrong answer the result string is incorrect (test case 1)