Codeforces Round 923 (Div. 3) | JorbanS

A - Make it White

int solve() {
    cin >> n >> s;
    int l = -1, r = -1;
    for (int i = 0; i < n; i ++) {
        if (s[i] == 'W') continue;
        if (l == -1) l = i;
        r = i;
    }
    return r - l + 1;
}

B - Following the String

vector<char> a[N];

void solve() {
    cin >> n;
    for (char c = 'a'; c <= 'z'; c ++) a[0].emplace_back(c);
    string s;
    map<int, int> mp;
    for (int i = 0; i < n; i ++) {
        int x; cin >> x;
        cout << a[x][0];
        a[x + 1].push_back(a[x][0]);
        a[x].erase(a[x].begin());
        mp[x] --; mp[x + 1] ++;
    }
    for (auto [i, j] : mp) a[i].clear();
    cout << endl;
}

C - Choose the Different Ones!

bool aa[N], bb[N], cc[N];

string solve() {
    cin >> n >> m >> k;
    for (int i = 0; i <= k; i ++) aa[i] = bb[i] = false;
    int nn = 0, mm = 0;
    for (int i = 0; i < n; i ++) {
        int x; cin >> x;
        aa[x] = true;
    }
    for (int i = 0; i < m; i ++) {
        int x; cin >> x;
        bb[x] = true;
    }
    set<int> st;
    int na = 0, nb = 0, nc = 0;
    for (int i = 1; i <= k; i ++) {
        if (aa[i] && !bb[i]) {
            na ++;
        } else if (!aa[i] && bb[i]) {
            nb ++;
        } else if (!aa[i] && !bb[i]) {
            return no;
        } else nc ++;
    }
    if (na + nb + nc < k || na + nc < k / 2 || nb + nc < k / 2) return no;
    return yes;
}

D - Find the Different Ones!

void solve() {
    cin >> n;
    for (int i = 0; i < n; i ++) cin >> a[i];
    vector<int> e;
    for (int i = 1; i < n; i ++)
        if (a[i - 1] != a[i]) e.emplace_back(i);
    cin >> q;
    while (q --) {
        int l, r; cin >> l >> r;
        auto it = lower_bound(e.begin(), e.end(), l);
        if (it != e.end() && *it < r) cout << *it << ' ' << *it + 1 << endl;
        else cout << "-1 -1" << endl;
    }
    cout << endl;
}

E - Klever Permutation

void solve() {
    cin >> n >> m;
    int idx = 1;
    for (int i = 1; i <= m; i ++) {
        if (i & 1)
            for (int j = i; j <= n; j += m) a[j] = idx ++;
        else {
            int num = (n - i) / m;
            for (int j = i + num * m; j >= i; j -= m) a[j] = idx ++;
        }
    }
    for (int i = 1; i <= n; i ++) cout << a[i] << ' ';
    cout << endl;
}