Codeforces Round

发表于 更新于 分类于

A. The Ultimate Square

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
#include <bits/stdc++.h>
#define endl '\n'
#define int long long
// #define x first
// #define y second
using namespace std;

// typedef pair<int, int> PII;

void solve() {
    int n;
    cin >> n;
    cout << (int)ceil(1.0 * n / 2) << endl;
}

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

B. Diverse Substrings

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
#include <bits/stdc++.h>
#define endl '\n'
#define int long long
// #define x first
// #define y second
using namespace std;

// typedef pair<int, int> PII;

void solve() {
    int n;
    cin >> n;
    string s;
    cin >> s;
    int ans = 0;
    for (int i = 0; i < n; i++) {
        vector<int> ap(10, 0);  // 出现个数
        int maxe = -1;          // 最大字符
        int cnt = 0;
        for (int j = i; j < n; j++) {
            int x = s[j] - '0';
            if (ap[x] == 0) cnt++;
            ap[x]++;
            maxe = max(maxe, ap[x]);
            if (maxe <= cnt) {
                ans++;
            } else {
                if (cnt == 10) break;
            }
        }
    }
    cout << ans << endl;
}

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