# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
428287 | Berted | Growing Vegetable is Fun 3 (JOI19_ho_t3) | C++14 | 332 ms | 7876 KiB |
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 <iostream>
#include <vector>
#define ll long long
using namespace std;
const ll INF = 1e18;
int N; string S;
vector<int> A[3];
ll DP[2][3][401][401];
int main()
{
cin >> N >> S;
for (int i = 1; i <= N; i++)
{
if (S[i - 1] == 'R') {A[0].push_back(i);}
else if (S[i - 1] == 'G') {A[1].push_back(i);}
else {A[2].push_back(i);}
}
for (int s = 0; s < 3; s++)
for (int i = 0; i <= N; i++)
for (int j = 0; j <= N; j++) DP[0][s][i][j] = INF;
for (int s = 0; s < 3; s++) DP[0][s][0][0] = 0;
for (int i = 1; i <= N; i++)
{
for (int s = 0; s < 3; s++)
for (int j = 0; j <= N; j++)
for (int k = 0; k <= N; k++) DP[i & 1][s][j][k] = INF;
for (int s = 0; s < 3; s++)
{
for (int j = 0; j <= i && j <= A[0].size(); j++)
{
for (int k = 0; k + j <= i && k <= A[1].size(); k++)
{
int l = i - j - k;
if (l > A[2].size()) continue;
if (s == 0 && j)
{
for (int t = 0; t < 3; t++)
{
if (s == t) continue;
DP[i & 1][s][j][k] = min(DP[i & 1][s][j][k], DP[~i & 1][t][j - 1][k] + max(0, A[s][j - 1] - i));
}
}
if (s == 1 && k)
{
for (int t = 0; t < 3; t++)
{
if (s == t) continue;
DP[i & 1][s][j][k] = min(DP[i & 1][s][j][k], DP[~i & 1][t][j][k - 1] + max(0, A[s][k - 1] - i));
}
}
if (s == 2 && l)
{
for (int t = 0; t < 3; t++)
{
if (s == t) continue;
DP[i & 1][s][j][k] = min(DP[i & 1][s][j][k], DP[~i & 1][t][j][k] + max(0, A[s][l - 1] - i));
}
}
//if (DP[i & 1][s][j][k] < INF) cout << i << " " << s << " " << j << " " << k << " " << l << " " << DP[i & 1][s][j][k] << "\n";
}
}
}
}
ll res = INF;
for (int s = 0; s < 3; s++) {res = min(res, DP[N & 1][s][A[0].size()][A[1].size()]);}
if (res == INF) cout << "-1\n";
else
{
cout << res << "\n";
}
return 0;
}
Compilation message (stderr)
# | 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... |