题解 | 乒乓球

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
const int MOD = 1000000007;
const int INF = 1e18;
const int N = 3e5 + 10;

void solve() {
    string s;
    cin >> s;
    int s0 = s.size(), w = 0, l = 0;
    for (int i = 0; i < s0; i++) {
        if (s[i] == 'W') {
            w++;
        } else {
            l++;
        }
	  //当局结束就输出，不结束最后输出
        if ((w >= 11 && w - l >= 2) || (l >= 11 && l - w >= 2)) {
            cout << w << ":" << l << endl;
            w = 0;
            l = 0;
        }
    }

    cout << w << ":" << l << endl;
  //一定要记得变为0，换行
    w = l = 0;
    cout << endl;
    for (int i = 0; i < s0; i++) {
        if (s[i] == 'W') {
            w++;
        } else {
            l++;
        }
        if ((w >= 21 && w - l >= 2) || (l >= 21 && l - w >= 2)) {
            cout << w << ":" << l << endl;
            w = 0;
            l = 0;
        }
    }
    cout << w << ":" << l << endl;

}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int T = 1;
    // cin >> T;
    while (T--)
        solve();
    return 0;
}