oj.uz

Submission #432059

# Submission time Handle Problem Language Result Execution time Memory
432059 2021-06-17T19:51:12 Z MilosMilutinovic Miners (IOI07_miners) C++14
16 / 100
 1328 ms 844 KB 
#include <bits/stdc++.h>
using namespace std;

int dp[2][4][4][4][4];

int count_diff(int x, int y, int z) {
    set<int> values;

    values.insert(x);
    values.insert(y);
    values.insert(z);

    return values.size();
}

const int inf = 1e9;

void clear_dp(int par) {
    for (int d1 = 0; d1 < 4; d1++)
        for (int d2 = 0; d2 < 4; d2++)
            for (int d3 = 0; d3 < 4; d3++)
                for (int d4 = 0; d4 < 4; d4++)
                    dp[par][d1][d2][d3][d4] = -inf;
}

int main() {
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);

    int N;
    cin >> N;
    string S;
    cin >> S;

    if (N == 1) {
        cout << 1 << '\n';
        return 0;
    }

    vector<int> A(N);
    for (int i = 0; i < N; i++) {
        if (S[i] == 'M') A[i] = 1;
        if (S[i] == 'F') A[i] = 2;
        if (S[i] == 'B') A[i] = 3;
    }

    int val = A[0];

    clear_dp(0);

    dp[0][A[0]][A[0]][0][0] = 1;
    dp[0][0][0][A[0]][A[0]] = 1;

    int curr = 1, prev = 0;

    for (int i = 1; i < N; i++) {
        int d = A[i];
        clear_dp(curr);

        int start = (i <= 2 ? 0 : 1);

        for (int d1 = start; d1 < 4; d1++)
            for (int d2 = start; d2 < 4; d2++)
                for (int d3 = start; d3 < 4; d3++)
                    for (int d4 = start; d4 < 4; d4++) {
                        dp[curr][d][d1][d3][d4] =  max(dp[curr][d][d1][d3][d4], dp[prev][d1][d2][d3][d4] + count_diff(d, d1, d2));
                        dp[curr][d1][d2][d][d3] =  max(dp[curr][d1][d2][d][d3], dp[prev][d1][d2][d3][d4] + count_diff(d, d3, d4));
                    }

        swap(curr, prev);
    }

    int answer = 0;
    for (int d1 = 0; d1 < 4; d1++)
        for (int d2 = 0; d2 < 4; d2++)
            for (int d3 = 0; d3 < 4; d3++)
                for (int d4 = 0; d4 < 4; d4++)
                    answer = max(answer, dp[prev][d1][d2][d3][d4]);

    cout << answer;
    return 0;
}

Compilation message

miners.cpp: In function 'int main()':
miners.cpp:46:9: warning: unused variable 'val' [-Wunused-variable]
   46 |     int val = A[0];
      |         ^~~

Subtask #1
0 / 9.0

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

Subtask #2
0 / 9.0

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

Subtask #3
0 / 9.0

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

Subtask #4
0 / 9.0

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

Subtask #5
0 / 9.0

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

Subtask #6
0 / 7.0

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

Subtask #7
8.0 / 8.0

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

Subtask #8
0 / 8.0

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

Subtask #9
8.0 / 8.0

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

Subtask #10
0 / 8.0

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

Subtask #11
0 / 8.0

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

Subtask #12
0 / 8.0

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