/* made by amunduzbaev */
#include "bits/stdc++.h"
using namespace std;
//~ #include <ext/pb_ds/assoc_container.hpp>
//~ #include <ext/pb_ds/tree_policy.hpp>
//~ using namespace __gnu_pbds;
//~ template<class T> using oset = tree<T,
//~ null_type, less_equal<T>, rb_tree_tag,
//~ tree_order_statistics_node_update>;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define NeedForSpeed ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vv vector
#define mem(arr, v) memset(arr, v, sizeof arr)
//~ #define int long long
#define degub(x) cout<<#x<<" : "<<x<<"\n"
#define GG cout<<"here"<<endl;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<int> vii;
typedef vector<pii> vpii;
template<class T> bool umin(T& a, const T& b) { return a > b ? a = b, true : false; }
template<class T> bool umax(T& a, const T& b) { return a < b ? a = b, true : false; }
template<int sz> using tut = array<int, sz>;
void usaco(string s) { freopen((s+".in").c_str(),"r",stdin);
freopen((s+".out").c_str(),"w",stdout); NeedForSpeed }
const int N = 2e5+5;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
#define MULTI 0
int n, m, k, t, q, ans, res, a[N];
int dp[2][N][4][4][4][4];
int cost(int a, int b, int c){
if(b == 0 && a == 0) return 1;
if(a == 0) return (b != c) + 1;
if(b == 0) return (a != c) + 1;
if(a == c && b == c) return 1;
if(a == c || b == c || a == b) return 2;
return 3;
}
void solve(int t_case){
cin>>n;
for(int i=1;i<=n;i++){
char c; cin>>c;
if(c == 'M') a[i] = 1;
if(c == 'F') a[i] = 2;
if(c == 'B') a[i] = 3;
}
mem(dp, -1);
dp[0][0][0][0][0][0] = 0;
dp[1][0][0][0][0][0] = 0;
for(int i=1;i<=n;i++){
for(int t=0;t<2;t++){
for(int cl=0;cl<4;cl++){
for(int cp=0;cp<4;cp++){
for(int pl=0;pl<4;pl++){
for(int pp=0;pp<4;pp++){
if(~dp[t][i-1][cl][cp][pl][pp]) umax(dp[t][i][a[i]][cl][pl][pp], dp[t][i-1][cl][cp][pl][pp] + cost(cp, cl, a[i]));
if(~dp[t^1][i-1][pl][pp][cl][cp]) umax(dp[t][i][a[i]][cl][pl][pp], dp[t^1][i-1][pl][pp][cl][cp] + cost(cp, cl, a[i]));
if(~dp[t][i-1][cl][cp][pl][pp]) umax(dp[t][i][pl][pp][a[i]][cl], dp[t][i-1][cl][cp][pl][pp] + cost(cp, cl, a[i]));
if(~dp[t^1][i-1][pl][pp][cl][cp]) umax(dp[t][i][pl][pp][a[i]][cl], dp[t^1][i-1][pl][pp][cl][cp] + cost(cp, cl, a[i]));
}
}
}
}
}
}
for(int t=0;t<2;t++){
for(int cl=0;cl<4;cl++){
for(int cp=0;cp<4;cp++){
for(int pl=0;pl<4;pl++){
for(int pp=0;pp<4;pp++){
umax(res, dp[t][n][cl][cp][pl][pp]);
}
}
}
}
}
cout<<res<<"\n";
}
signed main(){
NeedForSpeed
if(MULTI){
int t; cin>>t;
for(int t_case = 1; t_case <= t; t_case++) solve(t_case);
} else solve(1);
return 0;
}
Compilation message
miners.cpp: In function 'void usaco(std::string)':
miners.cpp:38:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
38 | void usaco(string s) { freopen((s+".in").c_str(),"r",stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
miners.cpp:39:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
39 | freopen((s+".out").c_str(),"w",stdout); NeedForSpeed }
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
194 ms |
401036 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
204 ms |
401008 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
209 ms |
401052 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
215 ms |
401052 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
202 ms |
401068 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
205 ms |
400984 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
213 ms |
401056 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
217 ms |
401100 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
235 ms |
401136 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
287 ms |
401100 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
416 ms |
401460 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
566 ms |
401576 KB |
Output is correct |
