| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 933724 | tamir1 | Homework (CEOI22_homework) | C++14 | 148 ms | 46068 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>
#define ff first
#define ss second
using namespace std;
string s;
int i,n,x;
pair<int,int> solve(){
if(s[x]=='?') return {1,n};
x++;
char c=s[x];
pair<int,int> a,b;
x+=3;
a=solve();
x+=2;
b=solve();
x++;
if(c=='i'){
return {min(a.ff,b.ff),a.ss+b.ss-n-1};
}
return {a.ff+b.ff,max(a.ss,b.ss)};
}
int main(){
cin >> s;
for(i=0;i<s.size();i++){
if(s[i]=='?') n++;
}
pair<int,int> ans=solve();
cout << ans.ss-ans.ff+1;
}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... | ||||
