| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1323869 | enson | Homework (CEOI22_homework) | C++20 | 118 ms | 19536 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
string exp;
cin >> exp;
int N = (int)count(exp.begin(), exp.end(), '?');
vector<int>mi;
for(int i = 0; i < exp.size()-3; i++){
if (exp.substr(i, 3) == "max"){
mi.push_back(0);
} else if (exp.substr(i, 3) == "min"){
mi.push_back(1);
}
}
int ans = N-1;
for(int i = 1; i < mi.size(); i++){
if (mi[i] == mi[i-1]) ans--;
}
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... | ||||
