oj.uz

Submission #709148

# Submission time Handle Problem Language Result Execution time Memory
709148 2023-03-13T06:55:18 Z vjudge1 Homework (CEOI22_homework) C++17
13 / 100
 27 ms 14120 KB 
#pragma GCC optimize("O3", "unroll-loops") // "Ofast" 	
#pragma GCC target("avx2", "bmi", "bmi2", "lzcnt", "popcnt") 

#include <bits/stdc++.h>

#define int long long
#define vt vector
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define f first
#define s second
#define dbg(x) cerr << #x << " = " << x << '\n'
#define bit(x, i) ((x) >> (i) & 1)

using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;

const int N = 1e6 + 5, mod = 1e9 + 7;
const ll inf = 1e18 + 7;
const ld eps = 1e-6;

ll add (ll a, ll b) {
	a += b;
	if (a < 0) a += mod;
	if (a >= mod) a -= mod;
	return a;
}

ll mul (ll a, ll b) {
	a *= b;
	if (a >= mod) a %= mod;
	return a;
}

string s;

void solve () {
	cin >> s;
	int cnt = count(all(s), '?');
	for (int i = 0; i < sz(s); i++) {
		if (s[i] == 'm' && s[i + 1] == s[1]) cnt--;
		if (s[i] == 'm' && s[i + 1] != s[1]) break;
	}
	cout << cnt;
	cout << '\n';
}

bool testcases = 0;

signed main() {
	cin.tie(0) -> sync_with_stdio(0);
	int test = 1;
	if (testcases) cin >> test;
	for (int cs = 1; cs <= test; cs++) {
		solve();
	}
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 14120 KB Output is correct
2 Correct 27 ms 14100 KB Output is correct
3 Correct 18 ms 14108 KB Output is correct
4 Correct 19 ms 14020 KB Output is correct
5 Correct 22 ms 14116 KB Output is correct
6 Correct 20 ms 14116 KB Output is correct
7 Correct 20 ms 14084 KB Output is correct
8 Correct 18 ms 14028 KB Output is correct
9 Correct 18 ms 14092 KB Output is correct
10 Correct 19 ms 14100 KB Output is correct
11 Correct 18 ms 14112 KB Output is correct
12 Correct 18 ms 14116 KB Output is correct
13 Correct 0 ms 212 KB Output is correct

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 34.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -