#include "bits/stdc++.h"
using namespace std;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define cbr cerr<<"hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ll(x.size())
#define all(x) (x).begin(), (x).end()
#define lbd(x,y) (lower_bound(all(x),y)-x.begin())
#define ubd(x,y) (upper_bound(all(x),y)-x.begin())
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); //can be used by calling rng() or shuffle(A, A+n, rng)
inline long long rand(long long x, long long y) { return rng() % (y+1-x) + x; } //inclusivesss
string inline to_string(char c) {string s(1,c);return s;} template<typename T> inline T gcd(T a,T b){ return a==0?llabs(b):gcd(b%a,a); }
using ll=long long;
using ld=long double;
#define FOR(i,s,e) for(ll i=s;i<=ll(e);++i)
#define DEC(i,s,e) for(ll i=s;i>=ll(e);--i)
using pi=pair<ll,ll>; using spi=pair<ll,pi>; using dpi=pair<pi,pi>;
long long LLINF = 1e18;
int INF = 1e9+1e6;
#define MAXN (400006)
ll n, ans;
string A;
int main() {
FAST
cin>>n>>A;A='*'+A;n*=2;
vector<int> v, v2;
FOR(i,1,n) if(A[i]=='B') v.eb(i); else v2.eb(i);
do {
vector<pi> p;
FOR(i,0,n/2-1) {
p.eb(min(v[i],v2[i]), max(v[i],v2[i]));
}
ll sum = 0;
FOR(i,0,n/2-1) FOR(j,i+1,n/2-1) {
vector<ll> C = {p[i].f, p[i].s, p[j].f, p[j].s};
sort(all(C));
for(auto&i:C)i=A[i];
if(C[0] == C[3] || C[0] == C[1]) ++ sum;
}
ans = max(ans, sum);
} while(next_permutation(all(v)));
cout<<ans<<'\n';
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Correct |
0 ms |
364 KB |
Output is correct |
| 3 |
Correct |
0 ms |
364 KB |
Output is correct |
| 4 |
Correct |
1 ms |
364 KB |
Output is correct |
| 5 |
Correct |
1 ms |
364 KB |
Output is correct |
| 6 |
Correct |
1 ms |
364 KB |
Output is correct |
| 7 |
Correct |
6 ms |
364 KB |
Output is correct |
| 8 |
Correct |
8 ms |
364 KB |
Output is correct |
| 9 |
Correct |
58 ms |
364 KB |
Output is correct |
| 10 |
Correct |
54 ms |
364 KB |
Output is correct |
| 11 |
Correct |
51 ms |
364 KB |
Output is correct |
| 12 |
Correct |
51 ms |
492 KB |
Output is correct |
| 13 |
Correct |
57 ms |
492 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Correct |
0 ms |
364 KB |
Output is correct |
| 3 |
Correct |
0 ms |
364 KB |
Output is correct |
| 4 |
Correct |
1 ms |
364 KB |
Output is correct |
| 5 |
Correct |
1 ms |
364 KB |
Output is correct |
| 6 |
Correct |
1 ms |
364 KB |
Output is correct |
| 7 |
Correct |
6 ms |
364 KB |
Output is correct |
| 8 |
Correct |
8 ms |
364 KB |
Output is correct |
| 9 |
Correct |
58 ms |
364 KB |
Output is correct |
| 10 |
Correct |
54 ms |
364 KB |
Output is correct |
| 11 |
Correct |
51 ms |
364 KB |
Output is correct |
| 12 |
Correct |
51 ms |
492 KB |
Output is correct |
| 13 |
Correct |
57 ms |
492 KB |
Output is correct |
| 14 |
Execution timed out |
2041 ms |
364 KB |
Time limit exceeded |
| 15 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Correct |
0 ms |
364 KB |
Output is correct |
| 3 |
Correct |
0 ms |
364 KB |
Output is correct |
| 4 |
Correct |
1 ms |
364 KB |
Output is correct |
| 5 |
Correct |
1 ms |
364 KB |
Output is correct |
| 6 |
Correct |
1 ms |
364 KB |
Output is correct |
| 7 |
Correct |
6 ms |
364 KB |
Output is correct |
| 8 |
Correct |
8 ms |
364 KB |
Output is correct |
| 9 |
Correct |
58 ms |
364 KB |
Output is correct |
| 10 |
Correct |
54 ms |
364 KB |
Output is correct |
| 11 |
Correct |
51 ms |
364 KB |
Output is correct |
| 12 |
Correct |
51 ms |
492 KB |
Output is correct |
| 13 |
Correct |
57 ms |
492 KB |
Output is correct |
| 14 |
Execution timed out |
2041 ms |
364 KB |
Time limit exceeded |
| 15 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Correct |
0 ms |
364 KB |
Output is correct |
| 3 |
Correct |
0 ms |
364 KB |
Output is correct |
| 4 |
Correct |
1 ms |
364 KB |
Output is correct |
| 5 |
Correct |
1 ms |
364 KB |
Output is correct |
| 6 |
Correct |
1 ms |
364 KB |
Output is correct |
| 7 |
Correct |
6 ms |
364 KB |
Output is correct |
| 8 |
Correct |
8 ms |
364 KB |
Output is correct |
| 9 |
Correct |
58 ms |
364 KB |
Output is correct |
| 10 |
Correct |
54 ms |
364 KB |
Output is correct |
| 11 |
Correct |
51 ms |
364 KB |
Output is correct |
| 12 |
Correct |
51 ms |
492 KB |
Output is correct |
| 13 |
Correct |
57 ms |
492 KB |
Output is correct |
| 14 |
Execution timed out |
2041 ms |
364 KB |
Time limit exceeded |
| 15 |
Halted |
0 ms |
0 KB |
- |
