Submission #1005373

#	Time	Username	Problem	Language	Result	Execution time	Memory
1005373		bachhoangxuan	Miners (IOI07_miners)	C++17	100 / 100	85 ms	100700 KiB

miners

#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e5+5;
const int inf = 1e9;

int dp[maxn][4][4][4][4];
int C[256];

int f(int x,int y,int z){
    if(!x){
        if(!y) return 1;
        else return 1+(y!=z);
    }
    else{
        if(x==y && y==z) return 1;
        else if(x^y^z) return 2;
        else return 3;
    }
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int n;cin >> n;
    for(int i=0;i<=n;i++) for(int a=0;a<=3;a++) for(int b=0;b<=3;b++) for(int c=0;c<=3;c++) for(int d=0;d<=3;d++) dp[i][a][b][c][d]=-inf;
    dp[0][0][0][0][0]=0;
    C['M']=1;C['B']=2;C['F']=3;
    for(int i=0;i<n;i++){
        char c;cin >> c;
        int x=C[c];
        for(int a=0;a<=3;a++) for(int b=0;b<=3;b++) for(int c=0;c<=3;c++) for(int d=0;d<=3;d++){
            if((a && !b) || (c && !d)) continue;
            int val=dp[i][a][b][c][d];
            dp[i+1][b][x][c][d]=max(dp[i+1][b][x][c][d],val+f(a,b,x));
            dp[i+1][a][b][d][x]=max(dp[i+1][a][b][d][x],val+f(c,d,x));
        }
    }

    int res=0;
    for(int a=0;a<=3;a++) for(int b=0;b<=3;b++) for(int c=0;c<=3;c++) for(int d=0;d<=3;d++) res=max(res,dp[n][a][b][c][d]);
    cout << res << '\n';
}

Compilation message (stderr)

miners.cpp: In function 'int main()':
miners.cpp:30:17: warning: array subscript has type 'char' [-Wchar-subscripts]
   30 |         int x=C[c];
      |                 ^

• 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