제출 #648383

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
648383		morasha3	Miners (IOI07_miners)	C++17	100 / 100	205 ms	210312 KiB

miners

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef   double ld;
const ll mod=1e9+7;
#define endl '\n'
ll n;
string s;
ll dp[100007][4][4][4][4];

ll fun(ll idx,ll p,ll p1,ll p2,ll p3)
{
    if(idx==n)
    {
        return 0;
    }

    if(dp[idx][p][p1][p2][p3]!=-1)return dp[idx][p][p1][p2][p3];
    ll o=1;
    if(s[idx]=='F')o=3;
    else if(s[idx]=='B')o=2;
    ll ans=1;
    if(p!=0&&p!=o)ans++;
    if(p1!=0&&p1!=o)ans++;
    if(p1!=0&&p1==p&&o!=p)ans--;
    ll c1=fun(idx+1,o,p,p2,p3)+ans;
    if(idx==2)
    {
        ll o1=p;
        p=0;
        p=o1;
    }
    ans=1;
    if(p2!=0&&p2!=o)ans++;
    if(p3!=0&&p3!=o)ans++;
    if(p2!=0&&p2==p3&&o!=p2)ans--;
    ll c2=fun(idx+1,p,p1,o,p2)+ans;
    return dp[idx][p][p1][p2][p3]=max(c1,c2);
}

int32_t main()
{
    //freopen("jumping.in","r",stdin);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin>>n>>s;
    memset(dp,-1,sizeof dp);
    cout<<fun(0,0,0,0,0);
    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