oj.uz

Submission #406416

# Submission time Handle Problem Language Result Execution time Memory
406416 2021-05-17T14:49:06 Z Lobo Miners (IOI07_miners) C++17
35 / 100
 1500 ms 844 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
const long long INFll = 1e18;
const int INFii = 1e9;
const long long mod = (long long) 1e9 + 7;
typedef long long ll;
typedef int ii;
typedef double dbl;
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
 
#define maxn 110000
//LEMBRAR DE MUDAR
 
ii n, s[maxn];
string S;
ii dp[2][4][4][4][4];
 
int main() {
    ios::sync_with_stdio(false); cin.tie(0);
 
    //freopen("in.in", "r", stdin);
    //freopen("__.out", "w", stdout);
 
    cin >> n;
    cin >> S;
 
    dp[0][0][0][0][0] = 0;
 
    for(ii i = 0; i < n; i++) {
        if(S[i] == 'M') s[i] = 1;
        if(S[i] == 'F') s[i] = 2;
        if(S[i] == 'B') s[i] = 3;
    }
 
    for(ii i = n; i >= 1; i--) {
        for(ii a1 = 0; a1 < 4; a1++)
        for(ii a2 = 0; a2 < 4; a2++) 
        for(ii b1 = 0; b1 < 4; b1++) 
        for(ii b2 = 0; b2 < 4; b2++) {
 
            set<ii> st1,st2;
 
            if(a1 != 0) st1.insert(a1);
            if(a2 != 0) st1.insert(a2);
            st1.insert(s[i]);
            ii p1 = st1.size();
 
            if(b1 != 0) st2.insert(b1);
            if(b2 != 0) st2.insert(b2);
            st2.insert(s[i]);
            ii p2 = st2.size();
 
 
            dp[i%2][a1][a2][b1][b2] = max(p1 + dp[(i+1)%2][s[i]][a1][b1][b2], p2 + dp[(i+1)%2][a1][a2][s[i]][b1]);
 
        }
    }
 
    cout << max({dp[n%2][s[1]][0][0][0], dp[n%2][0][s[1]][0][0], dp[n%2][0][0][s[1]][0], dp[n%2][0][0][0][s[1]]}) << endl;
 
}

Subtask #1
9.0 / 9.0

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

Subtask #2
9.0 / 9.0

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

Subtask #3
9.0 / 9.0

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

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 204 KB Output isn't correct

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 204 KB Output isn't correct

Subtask #6
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 204 KB Output isn't correct

Subtask #7
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 41 ms 300 KB Output isn't correct

Subtask #8
8.0 / 8.0

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

Subtask #9
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 403 ms 356 KB Output isn't correct

Subtask #10
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 1008 ms 460 KB Output isn't correct

Subtask #11
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1584 ms 716 KB Time limit exceeded

Subtask #12
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1592 ms 844 KB Time limit exceeded