Submission #839259

#	Time	Username	Problem	Language	Result	Execution time	Memory
839259		AndrijaM	Miners (IOI07_miners)	C++14	100 / 100	827 ms	149868 KiB

miners

#include<bits/stdc++.h>

using namespace std;
typedef int ll;
const int maxn=1e5 + 10;
int di[4]={1,-1,0,0};
int dj[4]={0,0,-1,1};
int n;
string s;
int dp[maxn][4][4][4][4];

int f(int idx,int a,int b,int c,int d)
{
    if(idx==n)
    {
        return 0;
    }
    if(dp[idx][a][b][c][d]!=-1)return dp[idx][a][b][c][d];
    int rez=0;
    int x=0;
    if(s[idx]=='M')
    {
        x=1;
    }
    else if(s[idx]=='F')
    {
        x=2;
    }
    else
    {
        x=3;
    }
    set<int>se1;
    se1.insert(a);
    se1.insert(b);
    se1.insert(x);
    set<int>se2;
    se2.insert(c);
    se2.insert(d);
    se2.insert(x);
    int num=se1.size();
    if(a==0 || b==0)
    {
        num--;
    }
    rez=max(rez, f(idx+1,b,x,c,d)+num);
    num=se2.size();
    if(c==0 || d==0)
    {
        num--;
    }
    rez=max(rez, f(idx+1,a,b,d,x)+num);
    return dp[idx][a][b][c][d]=rez;
}

int main()
{
    ios_base::sync_with_stdio(false); cin.tie(0);
    cin>>n>>s;
    memset(dp,-1,sizeof dp);
    cout<<f(0,0,0,0,0)<<endl;
    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