| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1111688 | noyancanturk | Homework (CEOI22_homework) | C++17 | 258 ms | 97024 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
using pii=pair<int,int>;
const int lim=6e6+100;
int n=0;
string s;
int part[lim];
pii parse(int l,int r){
if(l==r){
return {1,1};
}
int com=-1;
if(s[l+4]=='?')com=l+5;
else com=part[l+7]+1;
pii res1=parse(l+4,com-1),res2=parse(com+1,r-1);
pii res;
if(s[l+1]=='a'){
res.first=res1.first+res2.first;
res.second=min(res1.second,res2.second);
}else{
res.second=res1.second+res2.second;
res.first=min(res1.first,res2.first);
}
return res;
}
int main(){
#ifdef Local
freopen(".in","r",stdin);
freopen(".out","w",stdout);
#endif
cin>>s;
for(int i=0;i<s.size();i++)n+=s[i]=='?';
stack<int>inds;
for(int i=0;i<s.size();i++){
if(s[i]=='('){
inds.push(i);
}else if(s[i]==')'){
part[inds.top()]=i;
inds.pop();
}
}
pii res=parse(0,s.size()-1);
cout<<n-res.second-res.first+2;
}Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
