oj.uz

Submission #837453

# Submission time Handle Problem Language Result Execution time Memory
837453 2023-08-25T11:00:37 Z borisAngelov Miners (IOI07_miners) C++17
100 / 100
 151 ms 134084 KB 
#include <bits/stdc++.h>

using namespace std;

const int maxn = 100005;

int n;
string s;

int a[maxn];

int dp[maxn][4][4][4][4];
bool bl[maxn][4][4][4][4];

int calc(int x, int y, int z)
{
    int result = 3;

    if (y == 0 || y == x)
    {
        --result;
    }

    if (z == 0 || z == x)
    {
        --result;
    }

    if (y == z && y != x && z != x && y != 0 && z != 0)
    {
        result = 2;
    }

    return result;
}

int f(int pos, int last1, int second1, int last2, int second2)
{
    if (pos == n)
    {
        return 0;
    }

    if (bl[pos][last1][second1][last2][second2] == true)
    {
        return dp[pos][last1][second1][last2][second2];
    }

    bl[pos][last1][second1][last2][second2] = true;

    int result = calc(a[pos], last1, second1) + f(pos + 1, a[pos], last1, last2, second2);
    result = max(result, calc(a[pos], last2, second2) + f(pos + 1, last1, second1, a[pos], last2));

    return dp[pos][last1][second1][last2][second2] = result;
}

void fastIO()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}

int main()
{
    fastIO();

    cin >> n >> s;

    for (int i = 0; i < n; ++i)
    {
        if (s[i] == 'M')
        {
            a[i] = 1;
        }

        if (s[i] == 'B')
        {
            a[i] = 2;
        }

        if (s[i] == 'F')
        {
            a[i] = 3;
        }
    }

    cout << f(0, 0, 0, 0, 0) << endl;

    return 0;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
9.0 / 9.0

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

Subtask #3
9.0 / 9.0

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

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 324 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 0 ms 340 KB Output is correct

Subtask #7
8.0 / 8.0

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

Subtask #8
8.0 / 8.0

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

Subtask #9
8.0 / 8.0

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

Subtask #10
8.0 / 8.0

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

Subtask #11
8.0 / 8.0

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

Subtask #12
8.0 / 8.0

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