#include<bits/stdc++.h>
using namespace std;
#define foru(i,a,b) for(int i=(a); i<=(b); ++i)
#define ford(i,a,b) for(int i=(a); i>=(b); --i)
#define rep(i,a) for(int i=0; i<(a); ++i)
#define sz(a) (int)(a).size()
#define all(a) (a).begin(),(a).end()
#define bit(s,i) (((s)>>(i))&1)
#define vi vector<int>
#define vii vector<ii>
#define ii pair<int,int>
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define ll long long
#define _ << " " <<
template <class X, class Y> bool maxi(X &x, Y y){return x<y?x=y,true:false;}
template <class X, class Y> bool mini(X &x, Y y){return x>y?x=y,true:false;}
const int N=2e7+5;
int pos,cur,num[N],l[N],r[N];
string s;
int dfs(){
if(s[pos]=='?'){
++cur;
num[cur]=1;
l[cur]=r[cur]=1;
++pos;
return cur;
}
int ahihi=++cur;
int sign;
if(s.substr(pos,3)=="min") sign=0;
else sign=1;
pos+=3;
++pos; int ln=dfs();
++pos; int rn=dfs();
++pos;
num[ahihi]=num[ln]+num[rn];
if(sign==0){
l[ahihi]=min(l[ln],l[rn]);
r[ahihi]=r[ln]+r[rn]-1;
} else{
l[ahihi]=l[ln]+l[rn];
r[ahihi]=max(r[ln]+num[rn],r[rn]+num[ln]);
}
// cout<<cur _ l[cur] _ r[cur]<<'\n';
return ahihi;
}
void solve(){
cin>>s;
int root=dfs();
// cout<<l[root] _ r[root]<<'\n';
cout<<r[root]-l[root]+1<<'\n';
}
int32_t main(){
#define task "test"
if(fopen(task".inp","r")){
freopen(task".inp","r",stdin);
freopen(task".out","w",stdout);
}
cin.tie(0)->sync_with_stdio(0);
int tc=1; //cin>>tc;
rep(i,tc){
solve();
}
}
Compilation message (stderr)
Main.cpp: In function 'int32_t main()':
Main.cpp:70:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
70 | freopen(task".inp","r",stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
Main.cpp:71:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
71 | freopen(task".out","w",stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~| # | 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... |