QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#748954#7894. Many Many Headssurenjamts#WA 1ms3740kbC++20792b2024-11-14 22:08:102024-11-14 22:08:10

Judging History

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

  • [2024-11-14 22:08:10]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:3740kb
  • [2024-11-14 22:08:10]
  • 提交

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]