제출 #414634

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
414634		Christopher_Rdz	Miners (IOI07_miners)	C++14	100 / 100	137 ms	700 KiB

miners

#include <bits/stdc++.h>
using namespace std;

int n;
int food[100002];
char s;
int dp[3][4][4][4][4];

int costo(int a, int b, int c){
    int tot = 1;
    if (a != b and !(a == 0 or b == 0)) tot++;
    if (a != c and b != c and !(b == 0 or c == 0)) tot++;
    return tot; 
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n;
    for (int i = 0; i < n; i++){
        cin >> s;
        if (s == 'M') food[i] = 1;
        if (s == 'F') food[i] = 2;
        if (s == 'B') food[i] = 3;
    }
    for (int i = n - 1; i >= 0; i--){
        for (int x1 = 0; x1 < 4; x1++){
            for (int x2 = 0; x2 < 4; x2++){
                for (int y1 = 0; y1 < 4; y1++){
                    for (int y2 = 0; y2 < 4; y2++){
                        int aux = costo(food[i], x1, x2);
                        int c1 = 0, c2 = 0;
                        c1 = dp[(i + 1) % 2][food[i]][x1][y1][y2] + aux;
                        aux = costo(food[i], y1, y2);
                        c2 = dp[(i + 1) % 2][x1][x2][food[i]][y1] + aux;
                        dp[i % 2][x1][x2][y1][y2] = max(c1, c2);
                    }
                }
            }
        }
    }
    cout << dp[0][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