oj.uz

Submission #384000

# Submission time Handle Problem Language Result Execution time Memory
384000 2021-03-31T07:22:07 Z iulia13 Miners (IOI07_miners) C++14
100 / 100
 94 ms 492 KB 
#include <iostream>
#include <algorithm>
using namespace std;
const int nmax = 1e5 + 5;
const int mskmax = 16;
const int b = 4;
char s[nmax];
int dp[2][mskmax][mskmax];
///M = 1, F = 2, B = 3
///nmc = 0
int cod[30];
int value[80];
void maxim(int &a, int b)
{
    a = max(a, b);
}
int v[3];
int main()
{
    int n, i, j;
    cin >> n;
    cin >> s + 1;
    cod['M' - 'A'] = 1;
    cod['F' - 'A'] = 2;
    cod['B' - 'A'] = 3;
    for (i = 0; i < mskmax * b; i++)
    {
        if (i == 63)
            i = 63;
        v[0] = i % b;
        v[1] = (i / b) % b;
        v[2] = i / (b * b);
        sort (v, v + 3);
        if (v[2] == 0)
            continue;
        if (v[1] == 0)
        {
            value[i] = 1;
            continue;
        }
        if (v[0] == 0)
        {
            if (v[1] == v[2])
                value[i] = 1;
            else
                value[i] = 2;
            continue;
        }
        if (!v[0])
            continue;
        if (v[0] == v[2])
            value[i] = 1;
        else
        if (v[0] != v[1] && v[2] != v[1])
            value[i] = 3;
        else
            value[i] = 2;
    }
    int val = cod[s[1] - 'A'];
    for (i = 0; i <= 1; i++)
        for (int msk1 = 0; msk1 < mskmax; msk1++)
            for (int msk2 = 0; msk2 < mskmax; msk2++)
                dp[i][msk1][msk2] = -2e9;
    dp[0][0][0] = 0;
    int ans = 0;
    for (i = 1; i <= n; i++)
    {
        for (int msk1 = 0; msk1 < mskmax; msk1++)
            for (int msk2 = 0; msk2 < mskmax; msk2++)
                dp[i % 2][msk1][msk2] = -2e9;
        for (int msk1 = 0; msk1 < mskmax; msk1++)
            for (int msk2 = 0; msk2 < mskmax; msk2++)
            {
                int val = cod[s[i] - 'A'];
                int msk11 = (msk1 % b) * b + val;
                int msk22 = (msk2 % b) * b + val;
                ///bag in primul
                maxim(dp[i % 2][msk11][msk2], dp[1 - i % 2][msk1][msk2] + value[msk1 + b * b * val]);
                maxim(dp[i % 2][msk1][msk22], dp[1 - i % 2][msk1][msk2] + value[msk2 + b * b * val]);
                if (i == n)
                {
                    maxim(ans, dp[i % 2][msk11][msk2]);
                    maxim(ans, dp[i % 2][msk1][msk22]);
                }
            }
    }
    cout << ans;
    return 0;
}

Compilation message

miners.cpp: In function 'int main()':
miners.cpp:22:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   22 |     cin >> s + 1;
      |            ~~^~~
miners.cpp:20:15: warning: unused variable 'j' [-Wunused-variable]
   20 |     int n, i, j;
      |               ^
miners.cpp:59:9: warning: unused variable 'val' [-Wunused-variable]
   59 |     int val = cod[s[1] - 'A'];
      |         ^~~

Subtask #1
9.0 / 9.0

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

Subtask #2
9.0 / 9.0

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

Subtask #3
9.0 / 9.0

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

Subtask #4
9.0 / 9.0

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

Subtask #5
9.0 / 9.0

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

Subtask #6
7.0 / 7.0

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

Subtask #7
8.0 / 8.0

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

Subtask #8
8.0 / 8.0

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

Subtask #9
8.0 / 8.0

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

Subtask #10
8.0 / 8.0

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

Subtask #11
8.0 / 8.0

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

Subtask #12
8.0 / 8.0

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