제출 #739243

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
739243		Toxtaq	Miners (IOI07_miners)	C++17	45 / 100	1581 ms	29284 KiB

miners

#include<bits/stdc++.h>
using namespace std;
int n;
string s; /// M-0, B-1, F-2
long long rec(int indx, int mine, int last11, int last12, int last21, int last22){
    long long res = 0;
    set<int>st;
    if(indx == n)return 0;
    if(mine == 1){
        if(last11 != -1)st.insert(last11);
        if(last12 != -1)st.insert(last12);
        last12 = last11;
        last11 = s[indx];
    }
    else{
        if(last21 != -1)st.insert(last21);
        if(last22 != -1)st.insert(last22);
        last22 = last21;
        last21 = s[indx];
    }
    st.insert(s[indx]);
    res = st.size() + max(rec(indx + 1, 1, last11, last12, last21, last22), rec(indx + 1, 2, last11, last12, last21, last22));
    return res;
}
int main()
{
    cin >> n >> s;
    cout << max(rec(0, 1, -1, -1, -1, -1), rec(0, 2, -1, -1, -1, -1));
}

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