제출 #724743

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
724743		hyakup	Miners (IOI07_miners)	C++17	100 / 100	805 ms	108792 KiB

miners

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

const int maxn = 1e5 + 10;
int v[maxn], dp[maxn][4][4][4][4];
int n; 

int val( char c ){
    if( c == 'M' ) return 1;
    if( c == 'F' ) return 2;
    else return 3;
}

int cost( int x, int y, int z ){
    set<int> s;
    s.insert(x); s.insert(y); s.insert(z);
    s.erase(0);
    return s.size();
}

int solve( int i, int a, int b, int c, int d ){
    if( i == n + 1 ) return 0;
    int& res = dp[i][a][b][c][d];
    if( res != 0 ) return res;
    return res = max( cost( a, b, v[i] ) + solve( i + 1, v[i], a, c, d ), cost( c, d, v[i] ) + solve( i + 1, a, b, v[i], c ) );
}

int main(){
    cin >> n;
    for( int i = 1; i <= n; i++ ){
        char c; cin >> c;
        v[i] = val( c );
    }
    
    int resp = solve( 1, 0, 0, 0, 0 );
    cout << resp;
}

• 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