oj.uz

Submission #739272

# Submission time Handle Problem Language Result Execution time Memory
739272 2023-05-10T09:23:11 Z Toxtaq Miners (IOI07_miners) C++17
92 / 100
 918 ms 524288 KB 
#include<bits/stdc++.h>
using namespace std;
int n;
string s; /// M-1, B-2, F-3
long long table[100001][3][4][4][4][4];
long long rec(int indx, int mine, int last11, int last12, int last21, int last22){
    vector<int>v(4);
    v[0] = last11;
    v[1] = last12;
    v[2] = last21;
    v[3] = last22;
    long long res = 0;
    set<int>st;
    if(indx == n)return 0;
    if(table[indx][mine][last11][last12][last21][last22] != -1e18)return table[indx][mine][last11][last12][last21][last22];
    if(mine == 1){
        if(last11 != 0)st.insert(last11);
        if(last12 != 0)st.insert(last12);
        last12 = last11;
        if(s[indx] == 'M')last11 = 1;
        if(s[indx] == 'B')last11 = 2;
        if(s[indx] == 'F')last11 = 3;
    }
    else{
        if(last21 != 0)st.insert(last21);
        if(last22 != 0)st.insert(last22);
        last22 = last21;
        if(s[indx] == 'M')last21 = 1;
        if(s[indx] == 'B')last21 = 2;
        if(s[indx] == 'F')last21 = 3;
    }
    if(s[indx] == 'M')st.insert(1);
    if(s[indx] == 'B')st.insert(2);
    if(s[indx] == 'F')st.insert(3);
    res = st.size() + max(rec(indx + 1, 1, last11, last12, last21, last22), rec(indx + 1, 2, last11, last12, last21, last22));
    return table[indx][mine][v[0]][v[1]][v[2]][v[3]] = res;
}
int main()
{
//    ios_base::sync_with_stdio(0);
//    cin.tie(0);
    cin >> n >> s;
    for(int i = 0;i < n;++i){
        for(int j = 0;j < 3;++j){
            for(int l = 0;l < 4;++l){
                for(int r = 0;r < 4;++r){
                    for(int k = 0;k < 4;++k){
                        for(int z = 0;z < 4;++z){
                            table[i][j][l][r][k][z] = -1e18;
                        }
                    }
                }
            }
        }
    }
    cout << max(rec(0, 1, 0, 0, 0, 0), rec(0, 2, 0, 0, 0, 0));
}

Subtask #1
9.0 / 9.0

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

Subtask #2
9.0 / 9.0

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

Subtask #3
9.0 / 9.0

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

Subtask #4
9.0 / 9.0

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

Subtask #5
9.0 / 9.0

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

Subtask #6
7.0 / 7.0

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

Subtask #7
8.0 / 8.0

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

Subtask #8
8.0 / 8.0

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

Subtask #9
8.0 / 8.0

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

Subtask #10
8.0 / 8.0

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

Subtask #11
8.0 / 8.0

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

Subtask #12
0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 201 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -