# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
578447 |
2022-06-17T00:01:39 Z |
Hacv16 |
Miners (IOI07_miners) |
C++17 |
|
198 ms |
122188 KB |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fr first
#define sc second
typedef long long ll;
const int MAX = 110000;
const int INF = 0x3f3f3f3f;
string s;
int n, v[MAX], memo[MAX][4][4][4][4]; //optimize memory
int add(int a, int b, int c){ //size of {a, b, c}
int aux = 0;
if(a) aux |= (1 << a);
if(b) aux |= (1 << b);
if(c) aux |= (1 << c);
return __builtin_popcount(aux);
}
int dp(int i, int a1, int a2, int b1, int b2){
if(i == n) return 0;
if(memo[i][a1][a2][b1][b2] != -1)
return memo[i][a1][a2][b1][b2];
int cur = -INF;
cur = max(cur, dp(i + 1, v[i], a1, b1, b2) + add(v[i], a1, a2));
cur = max(cur, dp(i + 1, a1, a2, v[i], b1) + add(v[i], b1, b2));
return memo[i][a1][a2][b1][b2] = cur;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
memset(memo, -1, sizeof(memo));
cin >> n >> s;
for(int i = 0; i < n; i++){
if(s[i] == 'M') v[i] = 1;
else if(s[i] == 'F') v[i] = 2;
else v[i] = 3;
}
cout << dp(0, 0, 0, 0, 0) << '\n';
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
41 ms |
110412 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
42 ms |
110488 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
43 ms |
110420 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
41 ms |
110456 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
42 ms |
110440 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
43 ms |
110484 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
44 ms |
110608 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
48 ms |
111028 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
64 ms |
111648 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
78 ms |
113428 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
119 ms |
119244 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
198 ms |
122188 KB |
Output is correct |