#pragma optimize("Bismillahirrahmanirrahim")
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█■█
//█─█─█▄─█▄─█─█─█─█
//Allahuekber
//ahmet23 orz...
//Sani buyuk Osman Pasa Plevneden cikmam diyor.
//FatihSultanMehmedHan
//YavuzSultanSelimHan
//AbdulhamidHan
#define author tolbi
#include <bits/stdc++.h>
using namespace std;
template<typename X, typename Y> istream& operator>>(istream& in, pair<X,Y> &pr) {return in>>pr.first>>pr.second;}
template<typename X, typename Y> ostream& operator<<(ostream& os, pair<X,Y> pr) {return os<<pr.first<<" "<<pr.second;}
template<typename X> istream& operator>>(istream& in, vector<X> &arr) {for(auto &it : arr) in>>it; return in;}
template<typename X> ostream& operator<<(ostream& os, vector<X> arr) {for(auto &it : arr) os<<it<<" "; return os;}
template<typename X, size_t Y> istream& operator>>(istream& in, array<X,Y> &arr) {for(auto &it : arr) in>>it; return in;}
template<typename X, size_t Y> ostream& operator<<(ostream& os, array<X,Y> arr) {for(auto &it : arr) os<<it<<" "; return os;}
#define int long long
#define endl '\n'
#define vint(x) vector<int> x
#define deci(x) int x;cin>>x;
#define decstr(x) string x;cin>>x;
#define cinarr(x) for (auto &it : x) cin>>it;
#define coutarr(x) for (auto &it : x) cout<<it<<" ";cout<<endl;
#define sortarr(x) sort(x.begin(),x.end())
#define sortrarr(x) sort(x.rbegin(),x.rend())
#define det(x) cout<<"NO\0YES"+x*3<<endl;
#define INF LONG_LONG_MAX
#define rev(x) reverse(x.begin(),x.end());
#define ios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define tol(bi) (1LL<<((int)(bi)))
const int MOD = 1e9+7;
mt19937 ayahya(chrono::high_resolution_clock().now().time_since_epoch().count());
int32_t main(){
ios;
int t=1;
int tno = 0;
if (!t) cin>>t;
while (t-(tno++)){
deci(n);
decstr(str);
vector<int> r;
vector<int> g;
vector<int> y;
for (int i = 0; i < n; ++i)
{
if (str[i]=='R') r.push_back(i);
else if (str[i]=='G') g.push_back(i);
else y.push_back(i);
}
vector<vector<vector<int>>> old(n+1,vector<vector<int>>(n+1,vector<int>(3,-1)));
vector<vector<vector<int>>> dp(n+1,vector<vector<int>>(n+1,vector<int>(3,-1)));
old[r.size()][g.size()][0]=0;
old[r.size()][g.size()][1]=0;
old[r.size()][g.size()][2]=0;
for (int i = n-1; i >= 0; i--){
for (int j = 0; j < n; j++){
for (int k = 0; k < n; k++){
for (int z = 0; z < 3; z++){
dp[j][k][z]=MOD;
if (j>r.size() || k>g.size() || (i-j-k)>y.size()) continue;
if (j>i || k>i || (i-j-k)>i) continue;
if (j+k+(lower_bound(y.begin(),y.end(),i+1)-y.begin())<i) continue;
if (z==0 && j<r.size() && old[j+1][k][1]!=-1){
int lb = 0;
lb+=max(0ll,lower_bound(g.begin(), g.end(), r[j])-g.begin()-k);
lb+=max(0ll,lower_bound(y.begin(), y.end(), r[j])-y.begin()-(i-j-k));
dp[j][k][z]=min(dp[j][k][z],old[j+1][k][1]+lb);
}
if (z==0 && j<r.size() && old[j+1][k][2]!=-1){
int lb = 0;
lb+=max(0ll,lower_bound(g.begin(), g.end(), r[j])-g.begin()-k);
lb+=max(0ll,lower_bound(y.begin(), y.end(), r[j])-y.begin()-(i-j-k));
dp[j][k][z]=min(dp[j][k][z],old[j+1][k][2]+lb);
}
if (z==1 && k<g.size() && old[j][k+1][0]!=-1){
int lb = 0;
lb+=max(0ll,lower_bound(r.begin(), r.end(), g[k])-r.begin()-j);
lb+=max(0ll,lower_bound(y.begin(), y.end(), g[k])-y.begin()-(i-j-k));
dp[j][k][z]=min(dp[j][k][z],old[j][k+1][0]+lb);
}
if (z==1 && k<g.size() && old[j][k+1][2]!=-1){
int lb = 0;
lb+=max(0ll,lower_bound(r.begin(), r.end(), g[k])-r.begin()-j);
lb+=max(0ll,lower_bound(y.begin(), y.end(), g[k])-y.begin()-(i-j-k));
dp[j][k][z]=min(dp[j][k][z],old[j][k+1][2]+lb);
}
if (z==2 && i-j-k<y.size() && old[j][k][0]!=-1){
int lb = 0;
lb+=max(0ll,lower_bound(r.begin(), r.end(), y[i-j-k])-r.begin()-j);
lb+=max(0ll,lower_bound(g.begin(), g.end(), y[i-j-k])-g.begin()-k);
dp[j][k][z]=min(dp[j][k][z],old[j][k][0]+lb);
}
if (z==2 && i-j-k<y.size() && old[j][k][1]!=-1){
int lb = 0;
lb+=max(0ll,lower_bound(r.begin(), r.end(), y[i-j-k])-r.begin()-j);
lb+=max(0ll,lower_bound(g.begin(), g.end(), y[i-j-k])-g.begin()-k);
dp[j][k][z]=min(dp[j][k][z],old[j][k][1]+lb);
}
if (dp[j][k][z]==MOD) dp[j][k][z]=-1;
}
}
}
swap(old,dp);
}
int ans = -1;
for (int i = 0; i < 3; ++i)
{
if (old[0][0][i]!=-1){
if (ans==-1) ans=old[0][0][i];
ans=min(ans,old[0][0][i]);
}
}
cout<<ans<<endl;
}
}
Compilation message
joi2019_ho_t3.cpp:1: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
1 | #pragma optimize("Bismillahirrahmanirrahim")
|
joi2019_ho_t3.cpp: In function 'int32_t main()':
joi2019_ho_t3.cpp:63:12: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
63 | if (j>r.size() || k>g.size() || (i-j-k)>y.size()) continue;
| ~^~~~~~~~~
joi2019_ho_t3.cpp:63:26: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
63 | if (j>r.size() || k>g.size() || (i-j-k)>y.size()) continue;
| ~^~~~~~~~~
joi2019_ho_t3.cpp:63:46: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
63 | if (j>r.size() || k>g.size() || (i-j-k)>y.size()) continue;
| ~~~~~~~^~~~~~~~~
joi2019_ho_t3.cpp:66:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
66 | if (z==0 && j<r.size() && old[j+1][k][1]!=-1){
| ~^~~~~~~~~
joi2019_ho_t3.cpp:72:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
72 | if (z==0 && j<r.size() && old[j+1][k][2]!=-1){
| ~^~~~~~~~~
joi2019_ho_t3.cpp:78:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
78 | if (z==1 && k<g.size() && old[j][k+1][0]!=-1){
| ~^~~~~~~~~
joi2019_ho_t3.cpp:84:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
84 | if (z==1 && k<g.size() && old[j][k+1][2]!=-1){
| ~^~~~~~~~~
joi2019_ho_t3.cpp:90:24: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
90 | if (z==2 && i-j-k<y.size() && old[j][k][0]!=-1){
| ~~~~~^~~~~~~~~
joi2019_ho_t3.cpp:96:24: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
96 | if (z==2 && i-j-k<y.size() && old[j][k][1]!=-1){
| ~~~~~^~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
344 KB |
Output is correct |
| 4 |
Correct |
1 ms |
348 KB |
Output is correct |
| 5 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 6 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
344 KB |
Output is correct |
| 4 |
Correct |
1 ms |
348 KB |
Output is correct |
| 5 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 6 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
325 ms |
18112 KB |
Output is correct |
| 3 |
Correct |
367 ms |
18032 KB |
Output is correct |
| 4 |
Correct |
321 ms |
18108 KB |
Output is correct |
| 5 |
Correct |
359 ms |
18012 KB |
Output is correct |
| 6 |
Correct |
341 ms |
18108 KB |
Output is correct |
| 7 |
Correct |
314 ms |
18028 KB |
Output is correct |
| 8 |
Correct |
331 ms |
18032 KB |
Output is correct |
| 9 |
Correct |
338 ms |
17944 KB |
Output is correct |
| 10 |
Correct |
319 ms |
18008 KB |
Output is correct |
| 11 |
Correct |
309 ms |
18008 KB |
Output is correct |
| 12 |
Correct |
36 ms |
4952 KB |
Output is correct |
| 13 |
Correct |
82 ms |
8740 KB |
Output is correct |
| 14 |
Correct |
153 ms |
12376 KB |
Output is correct |
| 15 |
Correct |
317 ms |
17888 KB |
Output is correct |
| 16 |
Correct |
320 ms |
18260 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
344 KB |
Output is correct |
| 4 |
Correct |
1 ms |
348 KB |
Output is correct |
| 5 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 6 |
Halted |
0 ms |
0 KB |
- |
