oj.uz

Submission #98414

# Submission time Handle Problem Language Result Execution time Memory
98414 2019-02-23T10:03:07 Z ahmad_salah Miners (IOI07_miners) C++14
25 / 100
 33 ms 696 KB 
#include <bits/stdc++.h>

using namespace std;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int n, ans = 0;
    string s, m1, m2;
    cin >> n >> s;

    for (int i = 0; i < n; i++) {
        set<char> s1, s2;
        if (m1.size() >= 2)
            s1.insert(m1[m1.size() - 2]);
        if (m1.size())
            s1.insert(m1.back());
        s1.insert(s[i]);

        if (m2.size() >= 2)
            s2.insert(m2[m2.size() - 2]);
        if (m2.size())
            s2.insert(m2.back());
        s2.insert(s[i]);

        if (i == n - 1) {
            if (m1.size() == 2) {
                m1 += s[i], ans += s1.size();
                break;
            }

            if (m2.size() == 2) {
                m2 += s[i], ans += s2.size();
                break;
            }
        }
        ans += max(s1.size(), s2.size());

        if (s1.size() > s2.size())
            m1 += s[i];
        else if (s2.size() > s1.size())
            m2 += s[i];
        else
            m1.size() < m2.size() ? m1 += s[i] : m2 += s[i];
    }

    cout << ans << "\n";
    return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 412 KB Output isn't correct

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 384 KB Output isn't correct

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Output isn't correct

Subtask #6
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct

Subtask #7
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 384 KB Output isn't correct

Subtask #8
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 384 KB Output isn't correct

Subtask #9
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 384 KB Output isn't correct

Subtask #10
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 476 KB Output isn't correct

Subtask #11
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 15 ms 640 KB Output isn't correct

Subtask #12
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 33 ms 696 KB Output isn't correct