QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#623840	#7894. Many Many Heads	Zeoy^#	WA	3ms	3844kb	C++20	1.1kb	2024-10-09 14:10:32	2024-10-09 14:10:33

Judging History

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

[2024-10-09 14:10:33]
评测

测评结果：WA
用时：3ms
内存：3844kb

查看

[2024-10-09 14:10:32]
提交

answer

#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
const int N = 1e6 + 10;
const int inf = 1ll << 60, mod = 1e9 + 7;
int n;
void solve() {
    string s;
    cin >> s;
    stack<int> st;
    int f1 = 0, f0 = 0;
    for(auto c : s) {
        if(c == '(' || c == ')') {
            if(st.size() && st.top() == 0) {
                st.pop();
            }
            else st.push(0);
        }
        else {
            if(st.size() && st.top() == 1) {
                st.pop();
            }
            else st.push(1);
        }
        if(st.empty()) {
            if(c == '(' || c == ')') {
                f0++;
            }
            else {
                f1++;
            }
        }
    }
    if(f1 <= 1 && f0 <= 1) {
        cout << "Yes\n";
    }
    else cout << "No\n";
}
/*
6
))
((()
[()]
()[()]()
([()])
([])([])

2
[((]()[]
[((][]()
*/

signed main() {
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int _ = 1;
    cin >> _;
    while(_--) solve();
}

源文件, 语言: C++20

詳細信息

Test #1:

score: 100

Accepted

time: 0ms

memory: 3580kb

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: 0ms

memory: 3844kb

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: 3ms

memory: 3620kb

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
Yes
No
No
No
No
No
No
Yes
No
Yes
Yes
Yes
No
No
No
Yes
No
No
No
No
Yes
No
No
No
Yes
Yes
Yes
No
Yes
No
No
No
No
No
No
Yes
No
No
No
No
No
No
No
No
No
No
Yes
Yes
No
No
No
No
No
No...

result:

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