# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
666184 | Kahou | Homework (CEOI22_homework) | C++14 | 101 ms | 68132 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 F first
#define S second
#define mk make_pair
#define endl '\n'
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int N = 2e6 + 50;
int n;
string s;
pii ch[N];
bool mark[N];
int cnt[N];
pii dp[N];
stack<int> st;
void input() {
cin >> s;
for (int i = 0; i < (int)s.size(); i++) {
if (s[i] == 'm') {
n++;
st.push(n);
mark[n] = (s[i+1] == 'a');
i += 3;
continue;
}
else if (s[i] == '?') {
# | 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... |