oj.uz

Submission #589729

# Submission time Handle Problem Language Result Execution time Memory
589729 2022-07-05T08:03:04 Z tranxuanbach Miners (IOI07_miners) C++17
100 / 100
 396 ms 100812 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define endl '\n'
#define fi first
#define se second
#define For(i, l, r) for (auto i = (l); i < (r); i++)
#define ForE(i, l, r) for (auto i = (l); i <= (r); i++)
#define FordE(i, l, r) for (auto i = (l); i >= (r); i--)
#define Fora(v, a) for (auto v: (a))
#define bend(a) (a).begin(), (a).end()
#define isz(a) ((signed)(a).size())

using ll = long long;
using ld = long double;
using pii = pair <int, int>;
using vi = vector <int>;
using vpii = vector <pii>;
using vvi = vector <vi>;

const int N = 1e5 + 5, inf = 1e9 + 7;

int n;
string s;

int dp[N][4][4][4][4];

int f(char c){
    if (c == 'M'){
        return 1;
    }
    if (c == 'F'){
        return 2;
    }
    if (c == 'B'){
        return 3;
    }
    return 0;
}

int g(int i, int j, int k){
    int cnt[4] = {0, 0, 0, 0};
    cnt[i]++; cnt[j]++; cnt[k]++;
    return (cnt[1] ? 1 : 0) + (cnt[2] ? 1 : 0) + (cnt[3] ? 1 : 0);
}

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    // freopen("KEK.inp", "r", stdin);
    // freopen("KEK.out", "w", stdout);
    cin >> n;
    cin >> s;

    memset(dp, 0xc0, sizeof(dp));
    dp[0][0][0][0][0] = 0;
    For(i, 0, n){
        int ii = i & 1;
        ForE(m12, 0, 3){
            ForE(m11, 0, 3){
                ForE(m22, 0, 3){
                    ForE(m21, 0, 3){
                        dp[i + 1][m11][f(s[i])][m22][m21] = max(dp[i + 1][m11][f(s[i])][m22][m21], dp[i][m12][m11][m22][m21] + g(m12, m11, f(s[i])));
                        dp[i + 1][m12][m11][m21][f(s[i])] = max(dp[i + 1][m12][m11][m21][f(s[i])], dp[i][m12][m11][m22][m21] + g(m22, m21, f(s[i])));
                    }
                }
            }
        }
    }
    
    int ans = 0;
    ForE(m12, 0, 3){
        ForE(m11, 0, 3){
            ForE(m22, 0, 3){
                ForE(m21, 0, 3){
                    ans = max(ans, dp[n][m12][m11][m22][m21]);
                }
            }
        }
    }
    cout << ans << endl;
}

/*
==================================================+
INPUT:                                            |
--------------------------------------------------|

--------------------------------------------------|
==================================================+
OUTPUT:                                           |
--------------------------------------------------|

--------------------------------------------------|
==================================================+
*/

Compilation message

miners.cpp: In function 'int main()':
miners.cpp:61:13: warning: unused variable 'ii' [-Wunused-variable]
   61 |         int ii = i & 1;
      |             ^~

Subtask #1
9.0 / 9.0

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

Subtask #2
9.0 / 9.0

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

Subtask #3
9.0 / 9.0

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

Subtask #4
9.0 / 9.0

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

Subtask #5
9.0 / 9.0

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

Subtask #6
7.0 / 7.0

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

Subtask #7
8.0 / 8.0

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

Subtask #8
8.0 / 8.0

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

Subtask #9
8.0 / 8.0

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

Subtask #10
8.0 / 8.0

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

Subtask #11
8.0 / 8.0

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

Subtask #12
8.0 / 8.0

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