QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#896333 | #10080. The Interview Problem | rotcar07 | WA | 15ms | 3712kb | C++23 | 958b | 2025-02-13 09:42:23 | 2025-02-13 09:42:25 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
inline bool solve(){
string s;cin>>s;
stack<int> op;queue<int> cl;
int a=0,b=0;
for(char c:s){
if(c=='(') a++;
else if(c==')') a--;
else b+=c-'0';
}
if((a+b&1)) return 0;
a=(b-a)/2,b-=a;
for(int i=0;char c:s){
if(c=='(') op.emplace(i);
else if(c==')') cl.emplace(i);
else{
int x=c-'0';
while(a&&x&&!cl.empty()) a--,x--,cl.pop();
while(b&&x&&!op.empty()) b--,x--,op.pop();
if(x) return 0;
}
i++;
}
vector<pair<int,int>> v;
while(!op.empty()) v.emplace_back(op.top(),1),op.pop();
while(!cl.empty()) v.emplace_back(cl.front(),-1),cl.pop();
sort(v.begin(),v.end());
a=0;
for(auto [x,y]:v){
a+=y;if(a<0) return 0;
}return 1;
}
int main(){
int t;cin>>t;
while(t--)puts(solve()?"Yes":"No");
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3584kb
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: 3584kb
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: 15ms
memory: 3712kb
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 No Yes No Yes No Yes Yes Yes No Yes No Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes 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 Yes Yes Yes No Yes Yes Yes Yes No Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes ...
result:
wrong answer expected NO, found YES [15th token]