Star's Blog

1
#include <iostream>
2

3
using namespace std;
4

5
const int N = 1000010;
6

7
int a[N];
8

9
int main() {
10
    int n;
11
    scanf("%d", &n);
12
    for (int i = 0; i < n; ++i) scanf("%d", &a[i]);
13
    int res = 0;
14
    for (int i = 0; i < n; ++i) {
15
        if (a[i] == a[(i + n / 2) % n]) res++;
16
    }
17
    printf("%d\n", res);
18
    return 0;
19
}

1
#include <iostream>
2
#include <cstring>
3

4
using namespace std;
5

6
char s[110];
7
int cnt[26];
8

9
int main() {
10
    int n, m;
11
    scanf("%d%d", &n, &m);
12
    for (int i = 1; i <= n; ++i) {
13
        memset(cnt, 0, sizeof(cnt));
14
        scanf("%s", s + 1);
15
        for (int i = 1; i <= m; ++i) cnt[s[i] - 'a']++;
16
        bool f = true;
17
        for (int i = 2; i <= m; ++i) {
18
            if (cnt[s[i] - 'a'] == 1 && cnt[s[i - 1] - 'a'] == 1 || cnt[s[i] - 'a'] > 1 && cnt[s[i - 1] - 'a'] > 1) {
19
                f = false;
20
                break;
21
            }
22
        }
23
        if (f) printf("T\n");
24
        else printf("F\n");
25
    }
26
    return 0;
27
}

1
#include <iostream>
2

3
using namespace std;
4

5
char a[30], b[30], res[50];
6
bool g[26]; // 0, 1 = 1, 2
7

8
int main() {
9
    int n, m, T;
10
    scanf("%d%d%s%s%d", &n, &m, a, b, &T);
11
    for (int i = 0; i < m; ++i) g[b[i] - 'A'] = true;
12
    for (int i = 0; i < n; ++i) res[i] = a[n - i - 1];
13
    for (int i = 0; i < m; ++i) res[n + i] = b[i];
14

15
    while (T--) {
16
        for (int i = 0; i < n + m - 1; ++i) {
17
            if (g[res[i] - 'A'] == false && g[res[i + 1] - 'A'] == true) {
18
                swap(res[i], res[i + 1]);
19
                i++;
20
            }
21
        }
22
    }
23
    printf("%s\n", res);
24
    return 0;
25
}

1
#include <iostream>
2
#include <cstring>
3

4
using namespace std;
5

6
const int N = 2510;
7

8
int s[N], f[N];
9
char t[N];
10

11
int main() {
12
    int n, m;
13
    scanf("%d%d%s", &n, &m, t);
14
    for (int i = 1; i <= n; ++i) {
15
        s[i] = s[i - 1] + (t[i - 1] == 'H');
16
    }
17
    memset(f, 0x3f, sizeof(f));
18
    f[0] = 0;
19
    for (int i = 1; i <= n; ++i) {
20
        for (int j = 0; j < i; ++j) {
21
            if (abs(i - j - (s[i] - s[j]) * 2) <= m || s[i] - s[j] == 0 || s[i] - s[j] == i - j) {
22
                f[i] = min(f[i], f[j] + 1);
23
            }
24
        }
25
    }
26
    printf("%d\n", f[n]);
27
    return 0;
28
}

1
#include <iostream>
2
#include <set>
3
#include <vector>
4

5
using namespace std;
6

7
const int N = 110;
8
set<int> s[N];
9

10
int main() {
11
    int n, m, t = 0;
12
    scanf("%d%d", &n, &m);
13
    for (int i = 1; i <= m; ++i) {
14
        int k;
15
        bool f = false;
16
        scanf("%d", &k);
17
        vector<int> p(k);
18
        for (int j = 0; j < k; ++j) {
19
            scanf("%d", &p[j]);
20
            if (p[j] == 1) f = true;
21
        }
22
        if (f) {
23
            t++;
24
            for (int j : p) s[j].insert(t);
25
        }
26
        else {
27
            set<int> tmp;
28
            for (int j : p) {
29
                for (int song : s[j]) tmp.insert(song);
30
            }
31
            for (int j : p) s[j] = tmp;
32
        }
33
    }
34
    for (int i = 1; i <= n; ++i) {
35
        if (s[i].size() == t) printf("%d\n", i);
36
    }
37
    return 0;
38
}