oj.uz

Submission #535032

# Submission time Handle Problem Language Result Execution time Memory
535032 2022-03-09T10:32:15 Z __Variatto Miners (IOI07_miners) C++17
100 / 100
 172 ms 101144 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define ll long long
const int MAX=1e5+10;
int n, dp[MAX][4][4][4][4], t[MAX];
string s;
int rozne(int a, int b, int c){
    if(!c&&!b)
        return 1;
    if(!c){
        if(b==a)
            return 1;
        else
            return 2;
    }
    if(a==b&&b==c)
        return 1;
    else if(a==b||b==c||c==a)
        return 2;
    else
        return 3;
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    cin>>n>>s;
    for(int i=1; i<=n; i++){
        if(s[i-1]=='M') t[i]=1;
        if(s[i-1]=='B') t[i]=2;
        if(s[i-1]=='F') t[i]=3;
    }
    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[0][a][b][c][d]=-1;
    dp[0][0][0][0][0]=0;
    for(int i=1; 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]=-1;
        for(int a=0; a<=3; a++){
            for(int c=0; c<=3; c++){
                for(int d=0; d<=3; d++){
                    for(int b=0; b<=3; b++){
                        if(dp[i-1][a][b][c][d]==-1)
                            continue;
                        dp[i][t[i]][a][c][d]=max(dp[i][t[i]][a][c][d], dp[i-1][a][b][c][d]+rozne(t[i], a, b));
                    }
                }
            }
        }
        for(int a=0; a<=3; a++){
            for(int b=0; b<=3; b++){
                for(int d=0; d<=3; d++){
                    for(int c=0; c<=3; c++){
                        if(dp[i-1][a][b][c][d]==-1)
                            continue;
                        dp[i][a][b][t[i]][c]=max(dp[i][a][b][t[i]][c], dp[i-1][a][b][c][d]+rozne(t[i], c, d));
                    }
                }
            }
        }
    }
    int maxi=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++)
                    maxi=max(maxi, dp[n][a][b][c][d]);
    cout<<maxi<<"\n";
}

Subtask #1
9.0 / 9.0

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

Subtask #2
9.0 / 9.0

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

Subtask #3
9.0 / 9.0

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

Subtask #4
9.0 / 9.0

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

Subtask #5
9.0 / 9.0

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

Subtask #6
7.0 / 7.0

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

Subtask #7
8.0 / 8.0

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

Subtask #8
8.0 / 8.0

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

Subtask #9
8.0 / 8.0

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

Subtask #10
8.0 / 8.0

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

Subtask #11
8.0 / 8.0

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

Subtask #12
8.0 / 8.0

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