QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#748954 | #7894. Many Many Heads | surenjamts# | WA | 1ms | 3740kb | C++20 | 792b | 2024-11-14 22:08:10 | 2024-11-14 22:08:10 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mk make_pair
#define S second
#define F first
void solve(){
string s;
cin >> s;
int n = s.size();
vector<int> stk;
int cnt1 = 0, cnt2 = 0;
int sum1 = 0, sum2 = 0;
for(int i = 0; i < n; i++){
int num = 0;
if(s[i] == '[' || s[i] == ']') num = 1;
if(num == 0){
if(i % 2 == 0) sum1 ++;
else sum1--;
} else {
if(i % 2 == 0) sum2 ++;
else sum2--;
}
if(sum1 == 0) cnt1++;
if(sum2 == 0) cnt2++;
}
//cout << cnt << endl;
if(cnt1 > 1 || cnt2 > 1) cout << "No\n";
else cout << "Yes\n";
}
int main(){
int t; cin >> t; while(t--) solve();
}
詳細信息
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 3740kb
input:
6 )) ((() [()] ()[()]() ([()]) ([])([])
output:
No No No No No No
result:
wrong answer expected YES, found NO [1st token]