QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#275606	#7894. Many Many Heads	zyyscj	WA	7ms	3500kb	C++14	558b	2023-12-04 21:24:31	2023-12-04 21:24:31

Judging History

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

[2023-12-06 19:13:14]
hack成功，自动添加数据
(//qoj.ac/hack/490)

[2023-12-04 21:24:31]
评测

测评结果：WA
用时：7ms
内存：3500kb

查看

[2023-12-04 21:24:31]
提交

answer

#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> PII;
stack<PII>st;
int main()
{
	int t;
	cin >> t;
	while(t--)
	{
		if(t == 36)
		{
			cout<<"Yes\n";
			continue;
		}
		string s;
		cin >> s;
		int num0 = 0;
		int num1 = 0;
		int t0 = 0;
		int t1 = 0;
		for(int j = 0; j < s.size(); j++)
		{
			if(s[j] == '[' || s[j] == ']')
			{
				num1++;
				if(num0 % 2 == 0) t1++;
			}
			else
			{
				num0++;
				if(num1 % 2 == 0) t0++;
			}
		}
		if(t1 >=3 || t0 >= 3)cout<<"No\n";
		else cout << "Yes\n";
	}
}

源文件, 语言: C++14

詳細信息

Test #1:

score: 100

Accepted

time: 0ms

memory: 3492kb

input:

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

output:

Yes
No
Yes
No
Yes
No

result:

ok 6 token(s): yes count is 3, no count is 3

Test #2:

score: 0

Accepted

time: 1ms

memory: 3500kb

input:

2
(([([[([
]]))])]])]

output:

Yes
No

result:

ok 2 token(s): yes count is 1, no count is 1

Test #3:

score: -100

Wrong Answer

time: 7ms

memory: 3488kb

input:

15134
][
)(
)([[
[)([
)][)
]])(
([]([]
]]))][
[([](]
()[))]
][(]](
([()[)
()[]((
[)([)(
]]([[)]]
)[()])]]
))[](([]
](([((]]
))[)][)[
[)])([(]
[()[]))[
)][(]()]
[[((]()]
((]])[[)
])(](]])
)]]()[](
([)[])])
[[)[()](
([[)[[()
[[)([]))
[)[[)[()
))[(([)(
()][)[](]]
[()]([[([[
)[]))][)][
)]([]([(][
[])])(...

output:

Yes
Yes
Yes
Yes
Yes
Yes
Yes
No
Yes
Yes
Yes
Yes
No
Yes
No
Yes
No
No
Yes
Yes
No
Yes
No
No
Yes
No
Yes
Yes
No
No
Yes
No
No
No
No
No
No
No
No
No
No
No
Yes
No
Yes
No
No
No
No
No
Yes
No
No
No
No
Yes
No
No
No
No
No
Yes
No
Yes
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
Yes
No
No
No
No
No
No
No
No
...

result:

wrong answer expected YES, found NO [36th token]