Submission #1236109

#	Time	Username	Problem	Language	Result	Execution time	Memory
1236109		rhm_gan	Miners (IOI07_miners)	C++20	27 / 100	6 ms	584 KiB

miners

#include <bits/stdc++.h>
using namespace std;

#ifdef LOCAL
#include "debug.h"
#else
#define dbg(...) 42
#endif

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;

    string s;
    cin >> s;

    string a(1, s[0]), b(1, s[1]);
    for (int i = 2; i < n; i++) {
        if (a.back() != s[i] && b.back() != s[i]) {
            if (a.size() == 1) a.push_back(s[i]);
            else if (b.size() == 1) a.push_back(s[i]);
            else {
                if (a[a.size() - 2] != s[i]) {
                    a.push_back(s[i]);
                }
                else {
                    b.push_back(s[i]);
                }
            }
        }
        else if (a.back() != s[i]) {
            a.push_back(s[i]);
        }
        else if (b.back() != s[i]) {
            b.push_back(s[i]);
        }
        else {
            if (a.size() == 1) a.push_back(s[i]);
            else if (b.size() == 1) b.push_back(s[i]);
            else {
                if (a[a.size() - 2] != s[i]) {
                    a.push_back(s[i]);
                }
                else {
                    b.push_back(s[i]);
                }
            }
        }
    }

    int res = 0;
    for (int i = 0; i < a.size(); i++) {
        set<char> st;
        for (int j = i; j >= max(i - 2, 0); j--) {
            st.insert(a[j]);
        }
        res += st.size();
    }
    for (int i = 0; i < b.size(); i++) {
        set<char> st;
        for (int j = i; j >= max(i - 2, 0); j--) {
            st.insert(b[j]);
        }
        res += st.size();
    }

    cout << res << '\n';

    return 0;
}

• Subtask 1: 9 / 9
• Subtask 2: 0 / 9
• Subtask 3: 9 / 9
• Subtask 4: 0 / 9
• Subtask 5: 9 / 9
• Subtask 6: 0 / 7
• Subtask 7: 0 / 8
• Subtask 8: 0 / 8
• Subtask 9: 0 / 8
• Subtask 10: 0 / 8
• Subtask 11: 0 / 8
• Subtask 12: 0 / 8