QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #914391 | #10080. The Interview Problem | Screenwalkers (Hirotaka Yoneda, Masataka Yoneda, Daiki Kodama)# | WA | 1ms | 3712kb | C++20 | 987b | 2025-02-25 12:19:42 | 2025-02-25 12:19:42 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
pair<int, int> calc(int n, int c, int d) {
const int a = (n + c) / 2;
const int b = (n - c) / 2;
int r = (b >= d ? c + d : c + b - (d - b));
int l = (a >= d ? c - d : c - a + (d - a));
return {l, r};
}
bool solve(const string& s) {
int l = 0, r = 0, n = 0;
for (const char c : s) {
if (c == '(') {
l += 1, r += 1;
n += 1;
} else if (c == ')') {
l -= 1, r -= 1;
n += 1;
} else {
const int d = c - '0';
auto [l1, r1] = calc(n, l, d);
auto [l2, r2] = calc(n, r, d);
l = min(l1, l2);
r = max(r1, r2);
// if (r < 0) return false;
// while (l < 0) l += 2;
n -= d;
}
// cerr << l << " " << r << endl;
}
return l % 2 == 0 && l <= 0 && r >= 0;
}
int main() {
cin.tie(nullptr)->sync_with_stdio(false);
int t;
cin >> t;
while (t--) {
string s;
cin >> s;
cout << (solve(s) ? "Yes" : "No") << '\n';
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3712kb
input:
2 ((()(3)1 (()1)
output:
Yes No
result:
ok 2 token(s): yes count is 1, no count is 1
Test #2:
score: 0
Accepted
time: 1ms
memory: 3712kb
input:
5 ()1() (()) ()1((((2()())))3)() ((2))() ((1()))(1)()
output:
No Yes Yes No Yes
result:
ok 5 token(s): yes count is 3, no count is 2
Test #3:
score: -100
Wrong Answer
time: 1ms
memory: 3584kb
input:
10000 ((1((11())(1)(1)11(1))1))(1()2) ((1()))1 ()()((2()((2)2())))(1(3)3(()2())((5)(3(1((3)))((23(2()2)))()))) (()((()2)((()())((6((()))()(35(()))()(((())()))((())()(())() (())()()((1())(()()()(())))(()((()))(())1()()) (((())())))())() ()((()))(())((())()(()((()())()))) ()))((()))(()) ()((1)1((((())...
output:
Yes Yes No Yes Yes No Yes No Yes Yes Yes Yes Yes No No Yes Yes Yes Yes Yes Yes Yes No Yes Yes No Yes Yes Yes Yes Yes Yes Yes No No Yes Yes Yes No Yes Yes Yes Yes Yes Yes No Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes No Yes Yes Yes Yes Yes Yes Yes No No Yes Yes Yes Yes Yes Yes Yes Yes Yes No...
result:
wrong answer expected NO, found YES [4th token]