oj.uz

Submission #708656

# Submission time Handle Problem Language Result Execution time Memory
708656 2023-03-12T06:51:32 Z ngano_upat_na Miners (IOI07_miners) C++17
25 / 100
 21 ms 540 KB 
#include "bits/stdc++.h"
using namespace std;
using ll = long long;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int n;
    string s;
    cin >> n >> s;
    char cur1 = '?', prev1 = '?';
    char cur2 = '?', prev2 = '?';
    
    int ans = 0;
    
    string A, B;
    for (int i=0; i<n; i++) {
        set<char> a, b;
        a.insert(s[i]);
        if (cur1 != '?') a.insert(cur1);
        if (prev1 != '?') a.insert(prev1);
        b.insert(s[i]);
        if (cur2 != '?') b.insert(cur2);
        if (prev2 != '?') b.insert(prev2);
        
        ans = ans + max((int)a.size(),(int)b.size());
        if ((int)a.size() > (int)b.size()) {
            prev1 = cur1;
            cur1 = s[i];
            A.push_back(s[i]);
        }   
        if ((int)a.size() < (int)b.size()) {
            prev2 = cur2;
            cur2 = s[i];
            B.push_back(s[i]);
        }   
        if ((int)a.size() == (int)b.size()) {
            if ((cur1 == s[i] && cur2 == s[i]) || (cur1 != s[i] && cur2 != s[i])) {
                if ((int)A.size() >= (int)B.size()) {
                    prev2 = cur2;
                    cur2 = s[i];
                    B.push_back(s[i]);
                }   
                else {
                    prev1 = cur1;
                    cur1 = s[i];
                    A.push_back(s[i]);
                }
            }
            else {
                if (cur1 != s[i]) {
                    prev1 = cur1;
                    cur1 = s[i];
                    A.push_back(s[i]);
                }   
                else {
                    prev2 = cur2;
                    cur2 = s[i];
                    B.push_back(s[i]);
                }   
            }   
        }
    }   
    cout << ans;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
9.0 / 9.0

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

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct

Subtask #7
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #11
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 468 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #12
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 21 ms 540 KB Output isn't correct
2 Halted 0 ms 0 KB -