oj.uz

Submission #547295

# Submission time Handle Problem Language Result Execution time Memory
547295 2022-04-10T09:46:03 Z krit3379 Miners (IOI07_miners) C++17
100 / 100
 98 ms 616 KB 
#include<bits/stdc++.h>
using namespace std;
#define N 100005

int dp[2][4][4][4][4],ans;

int main(){
    cin.tie(nullptr)->sync_with_stdio(0);
    int n,st,c,idx,add,i,j,k,l;
    string s;
    cin>>n>>s;
    for(i=0;i<4;i++)for(j=0;j<4;j++)for(k=0;k<4;k++)for(l=0;l<4;l++)dp[0][i][j][k][l]=dp[1][i][j][k][l]=-1e9;
    dp[0][0][0][0][0]=0;
    for(c=0;c<n;c++){
        st=c%2;
        idx=s[c]=='M'?1:s[c]=='B'?2:3;
        for(i=0;i<4;i++)for(j=0;j<4;j++)for(k=0;k<4;k++)for(l=0;l<4;l++){
            add=1;
            if(i>0&&i!=idx)add++;
            if(j>0&&j!=idx&&j!=i)add++;
            dp[1-st][idx][i][k][l]=max(dp[1-st][idx][i][k][l],dp[st][i][j][k][l]+add);
            add=1;
            if(k>0&&k!=idx)add++;
            if(l>0&&l!=idx&&l!=k)add++;
            dp[1-st][i][j][idx][k]=max(dp[1-st][i][j][idx][k],dp[st][i][j][k][l]+add);
            ans=max({ans,dp[1-st][idx][i][k][l],dp[1-st][i][j][idx][k]});
        }
    }
    printf("%d",ans);
    return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct

Subtask #6
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct

Subtask #7
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 212 KB Output is correct

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 212 KB Output is correct

Subtask #9
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 340 KB Output is correct

Subtask #10
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 340 KB Output is correct

Subtask #11
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 572 KB Output is correct

Subtask #12
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 98 ms 616 KB Output is correct