# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
739266 |
2023-05-10T09:16:47 Z |
Toxtaq |
Miners (IOI07_miners) |
C++17 |
|
1500 ms |
436268 KB |
#include<bits/stdc++.h>
using namespace std;
int n;
string s; /// M-1, B-2, F-3
map<char, int>mp;
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;
last11 = mp[s[indx]];
}
else{
if(last21 != 0)st.insert(last21);
if(last22 != 0)st.insert(last22);
last22 = last21;
last21 = mp[s[indx]];
}
st.insert(mp[s[indx]]);
res = st.size() + max(rec(indx + 1, 1, last11, last12, last21, last22), rec(indx + 1, 2, 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;
mp['M'] = 1;
mp['B'] = 2;
mp['F'] = 3;
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, 1, 0, 0, 0, 0), rec(0, 2, 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 |
1 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
15 ms |
4652 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
41 ms |
21856 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
173 ms |
43968 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
406 ms |
108488 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
832 ms |
321712 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1596 ms |
436268 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |