QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#619453 | #7894. Many Many Heads | qz2003 | WA | 0ms | 3864kb | C++20 | 739b | 2024-10-07 14:15:00 | 2024-10-07 14:15:02 |
Judging History
answer
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int t;
int a[100005];
int main() {
// ios::sync_with_stdio(0);
// cin.tie(0);
cin>>t;
while(t--){
bool ok=1;
stack<bool> l,r;
string s;
cin>>s;
int len=s.size();
for(int i=0;i<len;i++){
if(s[i]=='('||s[i]==')'){
a[i]=0;
}
else{
a[i]=1;
}
}
for(int i=1;i<len-1;i++){
if(a[i]==a[i-1]&&a[i]==a[i+1]){
ok=0;
break;
}
}
int f=0,tp=0;
for(int i=0;i<len-1;i++){
if(a[i]==a[i+1]){
f++;
tp=f;
}
else if(tp!=f){
f--;
tp=f;
}
if(f>=2){
ok=0;
break;
}
}
if(ok){
cout<<"Yes\n";
}
else{
cout<<"No\n";
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3864kb
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: -100
Wrong Answer
time: 0ms
memory: 3860kb
input:
2 (([([[([ ]]))])]])]
output:
No No
result:
wrong answer expected YES, found NO [1st token]