oj.uz

Submission #843247

# Submission time Handle Problem Language Result Execution time Memory
843247 2023-09-03T20:10:45 Z VMaksimoski008 Miners (IOI07_miners) C++14
100 / 100
 768 ms 246868 KB 
#include <bits/stdc++.h>

#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;

void setIO() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

int n;
string s;
ll dp[100001][4][4][4][4];
map<char, int> val;

ll f(int pos, int f1, int s1, int f2, int s2) {
    if(pos == n) return 0;
    if(dp[pos][f1][s1][f2][s2] != -1) return dp[pos][f1][s1][f2][s2];

    ll ans = 0;

    int curr = val[s[pos]];
 
    set<int> st1, st2;
    st1.insert(curr);
    st2.insert(curr);

    if(f1 != 0) st1.insert(f1);
    if(s1 != 0) st1.insert(s1);
    if(f2 != 0) st2.insert(f2);
    if(s2 != 0) st2.insert(s2);

    ans = max(
        st1.size() + f(pos+1, curr, f1, f2, s2),
        st2.size() + f(pos+1, f1, s1, curr, f2)
    );

    return dp[pos][f1][s1][f2][s2] = ans;
}

int32_t main() {
    setIO();
    memset(dp, -1, sizeof(dp));

    val['M'] = 1;
    val['B'] = 2;
    val['F'] = 3;

    cin >> n >> s;
    cout << f(0, 0, 0, 0, 0) << '\n';
    return 0;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
9.0 / 9.0

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

Subtask #3
9.0 / 9.0

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

Subtask #4
9.0 / 9.0

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

Subtask #5
9.0 / 9.0

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

Subtask #6
7.0 / 7.0

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

Subtask #7
8.0 / 8.0

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

Subtask #8
8.0 / 8.0

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

Subtask #9
8.0 / 8.0

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

Subtask #10
8.0 / 8.0

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

Subtask #11
8.0 / 8.0

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

Subtask #12
8.0 / 8.0

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