oj.uz

Submission #1008055

# Submission time Handle Problem Language Result Execution time Memory
1008055 2024-06-26T07:01:38 Z vjudge1 Miners (IOI07_miners) C++17
100 / 100
 145 ms 748 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define FF first
#define SS second
#define all(a) a.begin(), a.end()
#define mod (ll)(1000000007)


int count(int a, int b, int c) {
    if (a == b && b == c) {
        return 1;
    }
    if (a == b || b == c || a == c) {
        return 2;
    }
    return 3;
}

signed main() {
    ios_base::sync_with_stdio(0);cin.tie(0);

    int n;
    string s;
    cin >> n >> s;

    vector<vector<vector<vector<int>>>> dp(3, vector<vector<vector<int>>>(3, vector<vector<int>>(3, vector<int>(3))));



    for (int i = 0; i < n; i++) {
        vector<vector<vector<vector<int>>>> Nxt = dp;

        int l = 0;
        if (s[i] == 'F') {
            l = 1;
        }
        else if (s[i] == 'B') {
            l = 2;
        }


        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++) {
                        Nxt[b][l][c][d] = max(Nxt[b][l][c][d], dp[a][b][c][d] + count(a, b, l));
                        Nxt[a][b][d][l] = max(Nxt[a][b][d][l], dp[a][b][c][d] + count(c, d, l));
                    }
                }
            }
        }

        dp = Nxt;
    }


    int ans = 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++) {
                    ans = max(ans, dp[a][b][c][d]);
                }
            }
        }
    }
    cout << ans - 6;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 452 KB Output is correct

Subtask #7
8.0 / 8.0

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

Subtask #8
8.0 / 8.0

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

Subtask #9
8.0 / 8.0

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

Subtask #10
8.0 / 8.0

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

Subtask #11
8.0 / 8.0

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

Subtask #12
8.0 / 8.0

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