提出 #59566335

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
#define rep(i, f, t) for (int i(f); i <= t; ++i)
#define re(i, t) for (int i(1); i <= t; ++i)
#define per(i, t, f) for (int i(t); i >= f; --i)
#define pe(i, t) for (int i(t); i >= 1; --i)
#define each(i, x) for (auto &i : (x))
#define nx(i, u) for (int i(head[u]); i; i = e[i].nxt)
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<double, int> pdi;
typedef pair<int, int> pii;
typedef pair<int, pair<int, int>> pipii;
typedef pair<string, bool> psb;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define mkp make_pair
#define ix(l, r) ((l + r) | (l != r))
#define lowbit(x) (x & -x)
#define inf (2e9)
#define INF (2e18)
#define dinf 1000000000000.0
#define eps 1e-10
#define FileIn(x) freopen(x, "r", stdin)
#define FileOut(x) freopen(x, "w", stdout)
#define FileIO(x, y) \
    FileIn(x);       \
    FileOut(y)
#define SYSP system("pause")
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define CIOO                     \
    ios::sync_with_stdio(false); \
    cin.tie(0);                  \
    cout.tie(0)
#define range(x) x.begin(), x.end()
template <class T>
void read(T &x)
{
    bool sign = false;
    x = 0;
    char c = getchar();
    while (!isdigit(c))
    {
        if (c == '-')
            sign = true;
        c = getchar();
    }
    while (isdigit(c))
    {
        x = x * 10 + (c - '0');
        c = getchar();
    }
    sign ? x = -x : x;
}
template <class T, class... Args>
void read(T &x, Args &...args) { read(x), read(args...); }
template <class T>
void write(T x)
{
    if (x < 0)
        x = -x, putchar('-');
    if (x > 9)
        write(x / 10);
    putchar(x % 10 + 48);
}
template <class T>
void write(T x, char c)
{
    write(x);
    putchar(c);
}
template <class T, class... Args>
void write(T x, char c, Args... args) { write(x, c), write(args...); }
#define ls(x) (x << 1)
#define rs(x) (x << 1 | 1)
// #define ls(x) t[x].son[0]
// #define rs(x) t[x].son[1]
// #define int long long
// #pragma GCC optimize(1)
// #pragma GCC optimize(2)
// #pragma GCC optimize(3,"Ofast")
const int N = 105;
int n, k;
char s[N];
int main()
{
    CIOO;
    cin >> n >> k;
    cin >> (s + 1);
    int now = 0, ans = 0;
    s[n + 1] = 'X';
    re(i, n + 1)
    {
        if (s[i] == 'O')
            now++;
        else
        {
            ans += now / k;
            now = 0;
        }
    }
    cout << ans << '\n';
}

提出情報

ジャッジ結果