제출 #1008247

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1008247		vjudge1	Miners (IOI07_miners)	C++17	100 / 100	694 ms	63932 KiB

miners

#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define pb push_back
#define ll long long
#define int long long
const long long inf=1e18;
const int MOD=1e9+7;
const int N=1e5+1;
int dp[N][3][3][3][3];//M=0 F1 B=2
signed main()
{
   int n; cin>>n;
   string s; cin>>s;
   s='#'+s;
   int ans=0;
   for(int i=1;i<=n;i++){
       int x=0;
       if(s[i]=='F')x=1;
       if(s[i]=='B')x=2;
       for(int j=0;j<3;j++){
           for(int k=0;k<3;k++){
               for(int l=0;l<3;l++){
                   for(int u=0;u<3;u++){
                       int score;
                       set<int> a={x,j,k};
                       score=a.size();
                       dp[i][k][x][l][u]=max(dp[i][k][x][l][u],dp[i-1][j][k][l][u]+score);
                       a={x,l,u};
                       score=a.size();
                       dp[i][j][k][u][x]=max(dp[i][j][k][u][x],dp[i-1][j][k][l][u]+score);
                       ans=max({ans,dp[i][k][x][l][u],dp[i][j][k][u][x]});
                   }
               }
           }
       }
   }
   cout<<ans-6;
}

• 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