This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int N = 405, INF = int(1e9);
int n, tt[3], s[6][N], p[3][N], d[N][N][N][3];
char b[N];
bool c[N][N][N][3];
int f(int r, int g, int y, int l){
if(c[r][g][y][l]) return d[r][g][y][l];
c[r][g][y][l] = 1;
int &ret = d[r][g][y][l];
ret = INF;
if(r > tt[0] || g > tt[1] || y > tt[2]) return ret;
if(r + g + y == n) return ret = 0;
int a[5] = {r, g, y, r, g};
for(int i = 0; i < 3; i++){
if(i == l) continue;
ret = min(ret,
f(r + (i == 0), g + (i == 1), y + (i == 2), i)
+ max(0, s[i + 1][p[i][a[i]]] - a[i + 1])
+ max(0, s[i + 2][p[i][a[i]]] - a[i + 2]));
}
return ret;
}
int main(){
scanf("%d%s", &n, b + 1);
for(int i = 1; i <= n; i++){
for(int j = 0; j < 6; j++) s[j][i] = s[j][i - 1];
int t = (b[i] == 'R' ? 0 : b[i] == 'G' ? 1 : 2);
s[t][i]++;
s[t + 3][i]++;
p[t][tt[t]++] = i;
}
int r = min({f(1, 0, 0, 0) + p[0][0] - 1,
f(0, 1, 0, 1) + p[1][0] - 1,
f(0, 0, 1, 2) + p[2][0] - 1});
if(r > INF / 2) puts("-1");
else printf("%d\n", r);
}
Compilation message (stderr)
joi2019_ho_t3.cpp: In function 'int main()':
joi2019_ho_t3.cpp:29:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%s", &n, b + 1);
~~~~~^~~~~~~~~~~~~~~~~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |