제출 #650118

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
650118		esomer	Miners (IOI07_miners)	C++17	92 / 100	1569 ms	608 KiB

miners

 #include <bits/stdc++.h>

using namespace std;

#define ll long long
#define endl "\n"

const int MOD = 998244353;

void solve(){
    int n; cin >> n;
    string s; cin >> s;
    map<pair<pair<int, int>, pair<int, int>>, int> dp;
    dp[{{0, 0}, {0,0}}] = 0;
    for(int i = 0; i < n; i++){
        map<pair<pair<int, int>, pair<int, int>>, int> nw;
        for(auto t : dp){
            auto p = t.first;
            int c;
            if(s[i] == 'M') c = 1;
            else if(s[i] == 'F') c = 2;
            else c = 3;
            set<int> add;
            add.insert(c); add.insert(p.first.first); add.insert(p.first.second); add.erase(0);
            nw[{{p.first.second, c}, p.second}] = max(nw[{{p.first.second, c}, p.second}], t.second + (int)add.size());
            add.clear();
            add.insert(c); add.insert(p.second.first); add.insert(p.second.second); add.erase(0);
            nw[{p.first, {p.second.second, c}}] = max(nw[{p.first, {p.second.second, c}}], t.second + (int)add.size());
        }
        dp = nw;
    }
    int ans = 0;
    for(auto p : dp) ans = max(ans, p.second);
    cout << ans << endl;
}

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    //freopen("inpt.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);

    //int tt; cin >> tt;
    int tt = 1;
    for(int t = 1; t <= tt; t++){
        //cout << "Case #"<<t << ": ";
        solve();
    }
}

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