oj.uz

Submission #1008099

# Submission time Handle Problem Language Result Execution time Memory
1008099 2024-06-26T07:36:34 Z vjudge1 Miners (IOI07_miners) C++17
100 / 100
 78 ms 100728 KB 
#include "bits/stdc++.h"
#define F first
#define S second
#define ll long long
#define pii pair<ll,ll>
const ll mxN = 3e5 + 5;
const ll mod = 1e9 + 7;
using namespace std;
int dp[mxN][4][4][4][4];
signed main(){
    // ios_base::sync_with_stdio(0);
    // cin.tie(0);
    // cout.tie(0);
    int n;
    string s = "#",s1;
    cin >>n>>s1;
    s += s1;
    int ans = 0;
    for(int i = 1;i <= n;i++){
        int num = (s[i] == 'M' ? 1 : (s[i] == 'B' ? 2 : 3));
        for(int a = 1;a < 4;a++){
            for(int b = 1; b < 4;b++){
                for(int c = 1;c < 4;c++){
                    for(int d = 1;d < 4;d++){
                        int val;
                        if(num != a && a != b && b != num) val = 3;
                        else if(num != a && a == b) val = 2;
                        else if(num == a && a != b) val = 2;
                        else if(num == b && a != b) val = 2;
                        else if(num != a && a == b) val = 2;
                        else val = 1;
                        // cout<<i<<' '<<num<<' '<<a<<' '<<b<<' '<<c<<' '<<d<<' '<<val<<'\n';
                        dp[i][num][a][c][d] =max(dp[i][num][a][c][d], dp[i - 1][a][b][c][d] + val);
                        if(num != c && c != d && d != num) val = 3;
                        else if(num != c && c == d) val = 2;
                        else if(num == c && c != d) val = 2;
                        else if(num != d && c == d) val = 2;
                        else if(num == d && c != d) val = 2;
                        else val = 1;
                        // cout<<i<<' '<<num<<' '<<a<<' '<<b<<' '<<c<<' '<<d<<' '<<val<<'\n';
                        dp[i][a][b][num][c] = max(dp[i][a][b][num][c],dp[i - 1][a][b][c][d] + val);
                        ans = max({ans,dp[i][num][a][c][d],dp[i][a][b][num][c]});
                    }
                }
            }
        }
        // cout<<ans<<' ';
    }
    cout<<ans - 6;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
9.0 / 9.0

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

Subtask #3
9.0 / 9.0

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

Subtask #4
9.0 / 9.0

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

Subtask #5
9.0 / 9.0

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

Subtask #6
7.0 / 7.0

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

Subtask #7
8.0 / 8.0

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

Subtask #8
8.0 / 8.0

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

Subtask #9
8.0 / 8.0

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

Subtask #10
8.0 / 8.0

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

Subtask #11
8.0 / 8.0

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

Subtask #12
8.0 / 8.0

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