#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define ll long long
#define pb push_back
#define sz(x) (int)(x).size()
#define mp make_pair
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define D(x) cerr << #x << " is " << (x) << "\n";
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>; ///find_by_order(),order_of_key()
template<class T1, class T2> ostream& operator<<(ostream& os, const pair<T1,T2>& a) { os << '{' << a.f << ", " << a.s << '}'; return os; }
template<class T> ostream& operator<<(ostream& os, const vector<T>& a){os << '{';for(int i=0;i<sz(a);i++){if(i>0&&i<sz(a))os << ", ";os << a[i];}os<<'}';return os;}
template<class T> ostream& operator<<(ostream& os, const set<T>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T> ostream& operator<<(ostream& os, const multiset<T>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T1,class T2> ostream& operator<<(ostream& os, const map<T1,T2>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
vector<vector<int> > pos(3);
const int N=401,oo=INT_MAX/10;
int n;
vector<int> val;
int dp[3][N][N][N];
#define dp dp[color][p1][p2][p3]
int calc(int color,int p1,int p2,int p3)
{
int tr=p1+p2+p3;
//printf("Calc %i %i %i %i %i\n",tr,color,p1,p2,p3);
//cout << val;
if(color==-1)
{
int best=oo;
if(p1<(int)pos[0].size())
{
int where=val[pos[0][p1]];
assert(where>=tr);
vector<int> inc;
for(int i=0;i<n;i++)
if(val[i]>=tr&&val[i]<where)
val[i]++,inc.pb(i);
int sol=calc(0,p1+1,p2,p3)+abs(where-tr);
for(auto p:inc)
val[p]--;
best=min(best,sol);
}
if(p2<(int)pos[1].size())
{
int where=val[pos[1][p2]];
assert(where>=tr);
vector<int> inc;
for(int i=0;i<n;i++)
if(val[i]>=tr&&val[i]<where)
val[i]++,inc.pb(i);
int sol=calc(1,p1,p2+1,p3)+abs(where-tr);
for(auto p:inc)
val[p]--;
best=min(best,sol);
}
if(p3<(int)pos[2].size())
{
int where=val[pos[2][p3]];
assert(where>=tr);
vector<int> inc;
for(int i=0;i<n;i++)
if(val[i]>=tr&&val[i]<where)
val[i]++,inc.pb(i);
int sol=calc(2,p1,p2,p3+1)+abs(where-tr);
for(auto p:inc)
val[p]--;
best=min(best,sol);
}
return best;
}
if(tr==n)
{
assert(p1==pos[0].size()&&p2==pos[1].size()&&p3==pos[2].size());
return 0;
}
if(dp!=-1)
return dp;
dp=oo;
if(color==0)
{
if(p2<(int)pos[1].size())
{
int where=val[pos[1][p2]];
assert(where>=tr);
vector<int> inc;
for(int i=0;i<n;i++)
if(val[i]>=tr&&val[i]<where)
val[i]++,inc.pb(i);
int sol=calc(1,p1,p2+1,p3)+abs(where-tr);
for(auto p:inc)
val[p]--;
dp=min(dp,sol);
}
if(p3<(int)pos[2].size())
{
int where=val[pos[2][p3]];
assert(where>=tr);
vector<int> inc;
for(int i=0;i<n;i++)
if(val[i]>=tr&&val[i]<where)
val[i]++,inc.pb(i);
int sol=calc(2,p1,p2,p3+1)+abs(where-tr);
for(auto p:inc)
val[p]--;
dp=min(dp,sol);
}
}
if(color==1)
{
if(p1<(int)pos[0].size())
{
int where=val[pos[0][p1]];
assert(where>=tr);
vector<int> inc;
for(int i=0;i<n;i++)
if(val[i]>=tr&&val[i]<where)
val[i]++,inc.pb(i);
int sol=calc(0,p1+1,p2,p3)+abs(where-tr);
for(auto p:inc)
val[p]--;
dp=min(dp,sol);
}
if(p3<(int)pos[2].size())
{
int where=val[pos[2][p3]];
assert(where>=tr);
vector<int> inc;
for(int i=0;i<n;i++)
if(val[i]>=tr&&val[i]<where)
val[i]++,inc.pb(i);
int sol=calc(2,p1,p2,p3+1)+abs(where-tr);
for(auto p:inc)
val[p]--;
dp=min(dp,sol);
}
}
if(color==2)
{
if(p1<(int)pos[0].size())
{
int where=val[pos[0][p1]];
assert(where>=tr);
vector<int> inc;
for(int i=0;i<n;i++)
if(val[i]>=tr&&val[i]<where)
val[i]++,inc.pb(i);
int sol=calc(0,p1+1,p2,p3)+abs(where-tr);
for(auto p:inc)
val[p]--;
dp=min(dp,sol);
}
if(p2<(int)pos[1].size())
{
int where=val[pos[1][p2]];
assert(where>=tr);
vector<int> inc;
for(int i=0;i<n;i++)
if(val[i]>=tr&&val[i]<where)
val[i]++,inc.pb(i);
int sol=calc(1,p1,p2+1,p3)+abs(where-tr);
for(auto p:inc)
val[p]--;
dp=min(dp,sol);
}
}
return dp;
}
#undef dp
int main()
{
memset(dp,-1,sizeof dp);
cin >> n;
string s;
cin >> s;
val.resize(n);
for(int i=0;i<n;i++)
{
if(s[i]=='R')
pos[0].pb(i);
if(s[i]=='G')
pos[1].pb(i);
if(s[i]=='Y')
pos[2].pb(i);
val[i]=i;
}
int ans=calc(-1,0,0,0);
if(ans>=oo)
ans=-1;
printf("%i\n",ans);
return 0;
}
Compilation message
In file included from /usr/include/c++/7/ext/pb_ds/detail/pat_trie_/pat_trie_.hpp:45:0,
from /usr/include/c++/7/ext/pb_ds/detail/container_base_dispatch.hpp:90,
from /usr/include/c++/7/ext/pb_ds/assoc_container.hpp:48,
from joi2019_ho_t3.cpp:2:
joi2019_ho_t3.cpp: In function 'int calc(int, int, int, int)':
joi2019_ho_t3.cpp:84:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
assert(p1==pos[0].size()&&p2==pos[1].size()&&p3==pos[2].size());
~~^~~~~~~~~~~~~~~
joi2019_ho_t3.cpp:84:37: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
assert(p1==pos[0].size()&&p2==pos[1].size()&&p3==pos[2].size());
~~^~~~~~~~~~~~~~~
joi2019_ho_t3.cpp:84:56: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
assert(p1==pos[0].size()&&p2==pos[1].size()&&p3==pos[2].size());
~~^~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
710 ms |
757512 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
710 ms |
757512 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
581 ms |
757480 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
710 ms |
757512 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
