Submission #644278

#	Time	Username	Problem	Language	Result	Execution time	Memory
644278		randomRandom	Miners (IOI07_miners)	C++14	100 / 100	357 ms	1004 KiB

miners

#include <iostream>

using namespace std;

const int MAXN = 1e5+7;

int A[MAXN];

int DP[2][4][4][4][4];

int check(int a, int b, int c){
    int result = 0;
    for(int i = 1; i <= 3; i++){
        if(a == i || b == i || c == i){
            result++;
        }
    }
    return result;
}


int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n;
    string ciag;
    cin >> n;
    cin >> ciag;
    for(int i = 0; i < n; i++){
        if(ciag[i] == 'M'){
            A[i+1] = 1;
        }else if(ciag[i] == 'F'){
            A[i+1] = 2;
        }else{
            A[i+1] = 3;
        }
    }
    int obecny = 0;
    int drugi = 1;
    for(int i = n; i >= 0; i--){
        for(int a = 0; a <= 3; a++){
            for(int b = 0; b <= 3; b++){
                for(int c = 0; c<=3; c++){
                    for(int d = 0; d <= 3; d++){ 
                        DP[obecny][a][b][c][d] = max(DP[drugi][b][A[i]][c][d] + check(a, b, A[i]), DP[drugi][a][b][d][A[i]] + check(c, d, A[i]));
                    }
                }
            }
        }
        swap(obecny, drugi);
    }
    cout << DP[obecny][0][0][0][0];
    return 0;
}

• Subtask 1: 9 / 9
• Subtask 2: 9 / 9
• Subtask 3: 9 / 9
• Subtask 4: 9 / 9
• Subtask 5: 9 / 9
• Subtask 6: 7 / 7
• Subtask 7: 8 / 8
• Subtask 8: 8 / 8
• Subtask 9: 8 / 8
• Subtask 10: 8 / 8
• Subtask 11: 8 / 8
• Subtask 12: 8 / 8