Codeforces Round #734 (Div. 3)

A. Polycarp and Coin

#include <iostream>
using namespace std;
int main() {
    int t, n;
    cin >> t;
    while (t--) {
        cin >> n;
        switch (n % 3) {
        case 0:
            cout << n / 3 << ' ' << n / 3 << endl;
            break;
        case 1:
            cout << n / 3 + 1 << ' ' << n / 3 << endl;
            break;
        case 2:
            cout << n / 3 << ' ' << n / 3 + 1 << endl;
            break;
        }
    }
    return 0;
}

B1. Wonderful Coloring - 1

#include <iostream>
#include <string>
using namespace std;
int main() {
    int t, cnt[26], ans;
    string s;
    cin >> t;
    while (t--) {
        cin >> s;
        ans = 0;
        for (int i = 0; i < 26; i++)
            cnt[i] = 0;
        for (auto k : s)
            cnt[k - 'a']++;
        for (int i = 0; i < 26; i++)
            ans += min(cnt[i], 2);
        cout << ans / 2 << endl;
    }
    return 0;
}

B2. Wonderful Coloring - 2（没过）

不知道哪里错了

#include <cstring>
#include <iostream>
using namespace std;
int t, n, k, j, m[200010], nc[200010], cnt[200010], cl[200010], sum;
int main() {
    cin >> t;
    while (t--) {
        cin >> n >> k;
        sum = 0;
        memset(cl, 0, sizeof(cl));
        memset(nc, 0, sizeof(nc));
        memset(cnt, 0, sizeof(cnt));
        for (int i = 1; i <= n; i++) {
            cin >> m[i];
            nc[m[i]]++;
        }
        for (int i = 1; i <= 200010; i++)
            sum += min(nc[i], k);
        for (int i = 1; i <= n; i++) {
            while (++cl[m[i]] <= k) {
                if (cnt[cl[m[i]]] < sum / k) {
                    cnt[cl[m[i]]]++;
                    cout << cl[m[i]] << " ";
                    break;
                }
            }
            if (cl[m[i]] > k)
                cout << 0 << " ";
        }
        cout << endl;
    }
    return 0;
}