# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
739274 |
2023-05-10T09:25:31 Z |
Toxtaq |
Miners (IOI07_miners) |
C++17 |
|
1500 ms |
436252 KB |
#include<bits/stdc++.h>
using namespace std;
int n;
string s; /// M-1, B-2, F-3
long long table[100001][2][4][4][4][4];
long long rec(int indx, int mine, int last11, int last12, int last21, int last22){
vector<int>v(4);
v[0] = last11;
v[1] = last12;
v[2] = last21;
v[3] = last22;
long long res = 0;
set<int>st;
if(indx == n)return 0;
if(table[indx][mine][last11][last12][last21][last22] != -1e18)return table[indx][mine][last11][last12][last21][last22];
if(mine == 1){
if(last11 != 0)st.insert(last11);
if(last12 != 0)st.insert(last12);
last12 = last11;
if(s[indx] == 'M')last11 = 1;
if(s[indx] == 'B')last11 = 2;
if(s[indx] == 'F')last11 = 3;
}
else{
if(last21 != 0)st.insert(last21);
if(last22 != 0)st.insert(last22);
last22 = last21;
if(s[indx] == 'M')last21 = 1;
if(s[indx] == 'B')last21 = 2;
if(s[indx] == 'F')last21 = 3;
}
if(s[indx] == 'M')st.insert(1);
if(s[indx] == 'B')st.insert(2);
if(s[indx] == 'F')st.insert(3);
res = st.size() + max(rec(indx + 1, 0, last11, last12, last21, last22), rec(indx + 1, 1, last11, last12, last21, last22));
return table[indx][mine][v[0]][v[1]][v[2]][v[3]] = res;
}
int main()
{
// ios_base::sync_with_stdio(0);
// cin.tie(0);
cin >> n >> s;
for(int i = 0;i < n;++i){
for(int j = 0;j < 2;++j){
for(int l = 0;l < 4;++l){
for(int r = 0;r < 4;++r){
for(int k = 0;k < 4;++k){
for(int z = 0;z < 4;++z){
table[i][j][l][r][k][z] = -1e18;
}
}
}
}
}
}
cout << max(rec(0, 0, 0, 0, 0, 0), rec(0, 1, 0, 0, 0, 0));
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
13 ms |
4564 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
42 ms |
21844 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
172 ms |
43936 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
400 ms |
108468 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
894 ms |
321700 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1590 ms |
436252 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |