#pragma GCC optimize("O3,inline")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
using ll = long long;
#define int ll
using ii = pair<int, int>;
using iii = pair<ii, int>;
constexpr int INF = 1e18 + 5;
constexpr int MAXN = 1000000 + 5;
constexpr int MOD = 1e9 + 7;
string s;
int ctr = 0;
iii dfs() {
if (s[ctr] == '?') return iii{ii{0, 1}, 0};
bool ismax = s[ctr] == 'a';
ctr++;
iii ch1 = dfs();
ctr++;
iii ch2 = dfs();
int sumall = ch1.first.first + ch1.first.second + ch1.second + ch2.first.first + ch2.first.second + ch2.second;
iii ans;
if (ismax) {
ans.first.first = ch1.first.first + ch2.first.first + min(ch1.first.second, ch2.first.second);
ans.second = min(ch1.second, ch2.second);
ans.first.second = sumall - ans.first.first - ans.second;
}
else {
ans.first.first = min(ch1.first.first, ch2.first.first);
ans.second = ch1.second + ch2.second + min(ch1.first.second, ch2.first.second);
ans.first.second = sumall - ans.second - ans.first.first;
}
return ans;
}
signed main() {
ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
string t; cin >> t;
t += " ";
for (int i = 0; i < t.size() - 2; ++i) {
if (t[i] == 'a') continue;
if (t[i] == 'x') continue;
if (t[i] == 'i') continue;
if (t[i] == 'n') continue;
if (t[i] == ',') continue;
if (t[i] == '(') continue;
if (t[i] == ')') continue;
if (t[i] != 'm') s += t[i];
else if (t[i+1] == 'a') s += 'a';
else s += 'b';
}
int ans = dfs().first.second;
cout << ans;
}
| # | 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... |