Submission #59568063

---

Source Code Expand

#include <bits/extc++.h>

using namespace std;

#define int long long
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define mod 1000000007
#define INF LONG_LONG_MAX
#define cmin(a, b) a = min(a, b)
#define cmax(a, b) a = max(a, b)

template<typename T> using ordered_set = __gnu_pbds::tree<T, __gnu_pbds::null_type,
        less<T>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update>;

template<typename T> using matrix = vector<vector<T>>;

namespace io {
    template<typename T, typename F>
    istream &operator>>(istream &cin, pair<T, F> &p) {
        cin >> p.first >> p.second;
        return cin;
    }

    template<typename T, typename F>
    ostream &operator<<(ostream &cout, pair<T, F> &p) {
        cout << p.first << ' ' << p.second << '\n';
        return cout;
    }

    template<typename T>
    istream &operator>>(istream &cin, vector<T> &a) {
        for (T &i: a) cin >> i;
        return cin;
    }

    template<typename T>
    ostream &operator<<(ostream &cout, vector<T> &a) {
        for (T i: a) cout << i << ' ';
        return cout;
    }

    template<typename T>
    istream &operator>>(istream &cin, deque<T> &a) {
        for (T &i: a) cin >> i;
        return cin;
    }

    template<typename T>
    ostream &operator<<(ostream &cout, deque<T> &a) {
        for (T i: a) cout << i << ' ';
        return cout;
    }
}
using namespace io;

void solution() {
    int n, k, o = 0, p = 0;
    string s;
    cin >> n >> k >> s;
    for (char i : s) {
        if (i == 'O') o++;
        else o = 0;
        p += o / k, o %= k;
    }
    cout << p;
}

signed main() {
    ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr), cerr.tie(nullptr);
    int t = 1;
//    cin >> t;
    while (t--) {
        solution();
        cout << '\n';
    }
    return 0;
}

Submission Info

Judge Result