Submission #1295249

#	Time	Username	Problem	Language	Result	Execution time	Memory
1295249		nathlol2	Miners (IOI07_miners)	C++20	84 / 100	1598 ms	111988 KiB

miners

#include <bits/stdc++.h>
using namespace std;
const int N = 111111;
int n; string s;
map<char, int> mp;
int dp[N][4][4][4][4];
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n >> s;
    s = ' ' + s;
    mp['M'] = 1;
    mp['B'] = 2;
    mp['F'] = 3;
    for(int i = 0;i<N;i++){
        for(int j = 0;j<4;j++){
            for(int k = 0;k<4;k++){
                for(int g = 0;g<4;g++){
                    for(int f = 0;f<4;f++){
                        dp[i][j][k][g][f] = -2e9;
                    }
                }
            }
        }
    }
    dp[0][0][0][0][0] = 1;
    for(int i = 1;i<=n;i++){
        int id = mp[s[i]];
        for(int j = 0;j<4;j++){
            for(int k = 0;k<4;k++){
                for(int g = 0;g<4;g++){
                    for(int f = 0;f<4;f++){
                        set<int> d;
                        d.insert(id);
                        d.insert(j);
                        d.insert(k);
                        d.erase(0);
                        dp[i][id][j][g][f] = max(dp[i][id][j][g][f], dp[i - 1][j][k][g][f] + (int)d.size());
                        d.clear();
                        d.insert(id);
                        d.insert(g);
                        d.insert(f);
                        d.erase(0);
                        dp[i][j][k][id][g] = max(dp[i][j][k][id][g], dp[i - 1][j][k][g][f] + (int)d.size());
                        d.clear();
                    }
                }
            }
        }
    }
    int ans = 0;
    for(int j = 0;j<4;j++){
        for(int k = 0;k<4;k++){
            for(int g = 0;g<4;g++){
                for(int f = 0;f<4;f++){
                    ans = max(ans, dp[n][j][k][g][f]);
                }
            }
        }
    }
    cout << ans - 1;
}

• 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: 0 / 8
• Subtask 12: 0 / 8