# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
707779 |
2023-03-10T06:07:08 Z |
TAhmed33 |
Miners (IOI07_miners) |
C++ |
|
1068 ms |
147052 KB |
#include <bits/stdc++.h>
using namespace std;
int n;
vector <int> adds;
int dp[100001][4][4][4][4];
int ans (int pos, int a, int b, int c, int d) {
int &ret = dp[pos][a][b][c][d];
if (ret != -1) return ret;
if (pos == n) {
return ret = 0;
}
map <int, int> distinct;
if (a != 0) distinct[a]++;
if (b != 0) distinct[b]++;
distinct[adds[pos]]++;
int x = ans(pos + 1, b, adds[pos], c, d) + (int)distinct.size();
map <int, int> distinct2;
if (c != 0) distinct2[c]++;
if (d != 0) distinct2[d]++;
distinct2[adds[pos]]++;
x = max(x, ans(pos + 1, a, b, d, adds[pos]) + (int)distinct2.size());
return ret = x;
}
int main () {
memset(dp, -1, sizeof(dp));
string s;
cin >> n >> s;
for (auto i : s) {
if (i == 'M') adds.push_back(1);
else if (i == 'F') adds.push_back(2);
else adds.push_back(3);
}
cout << ans(0, 0, 0, 0, 0);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
40 ms |
100428 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
39 ms |
100408 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
40 ms |
100448 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
38 ms |
100436 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
46 ms |
100388 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
37 ms |
100380 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
57 ms |
100812 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
59 ms |
102424 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
134 ms |
105176 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
237 ms |
111360 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
418 ms |
129788 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1068 ms |
147052 KB |
Output is correct |