Submission #158250

#	Time	Username	Problem	Language	Result	Execution time	Memory
158250		brcode	Miners (IOI07_miners)	C++14	100 / 100	1336 ms	245752 KiB

miners

#include <iostream>
#include <set>
using namespace std;

const int MAXN = 2e5+5;
int dp[MAXN][5][5][5][5];
int arr[MAXN];
int query(int i,int j,int k){
    set<int> s1;
    if(i){
        s1.insert(i);
    }
    if(j){
        s1.insert(j);
    }
    if(k){
          s1.insert(k);
    }
  //  cout<<i<<" "<<j<<" "<<k<<" "<<s1.size()<<endl;
    return s1.size();
}
int main(){
    int n;
    cin>>n;
    string s;
    cin>>s;
    for(int i=1;i<=n;i++){
        if(s[i-1] == 'M'){
            arr[i] = 1;
        }else if(s[i-1] == 'F'){
            arr[i] = 2;
        }else{
            arr[i] = 3;
        }
    }
    for(int i=0;i<=n;i++){
        for(int j=0;j<=3;j++){
            for(int k=0;k<=3;k++){
                for(int l=0;l<=3;l++){
                    for(int m=0;m<=3;m++){
                            dp[i][j][k][l][m] = -1e9;
                    }
                }
            }
        }
    }
    dp[0][0][0][0][0] = 0;
    for(int i=1;i<=n;i++){
        for(int j=0;j<=3;j++){
            for(int k=0;k<=3;k++){
                for(int l=0;l<=3;l++){
                    for(int m=0;m<=3;m++){
                        if(dp[i-1][j][k][l][m]!=-1e9){

                            dp[i][arr[i]][j][l][m] = max(dp[i][arr[i]][j][l][m],dp[i-1][j][k][l][m]+query(arr[i],j,k));
                            dp[i][j][k][arr[i]][l] = max(dp[i][j][k][arr[i]][l],dp[i-1][j][k][l][m]+query(arr[i],l,m));
                         //   cout<<i<<" "<<arr[i]<<" "<<j<<" "<<l<<" "<<m<<" "<<dp[i][arr[i]][j][l][m]<<endl;
                            //cout<<i<<" "<<j<<" "<<k<<" "<<arr[i]<<" "<<l<<" "<<dp[i][arr[i]][j][l][m]<<endl;
                        }
                    }
                }
            }
        }

    }
    int ans = 0;
    for(int j=0;j<=3;j++){
        for(int k=0;k<=3;k++){
            for(int l=0;l<=3;l++){
                for(int m=0;m<=3;m++){
                    ans = max(ans,dp[n][j][k][l][m]);
                }
            }
            //ans = max(ans,dp[n][j][k]);
        }
    }
    cout<<ans<<endl;
}

• 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