# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
97283 | model_code | Growing Vegetable is Fun 3 (JOI19_ho_t3) | C++17 | 127 ms | 163128 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 <cstdio>
#include <algorithm>
using namespace std;
const int MAXN = 400;
const int INFV = 1001001001;
int N;
char S[MAXN + 1]; int A[MAXN];
int dp[MAXN + 1][MAXN + 1][MAXN + 1][3];
int cnts[3], locs[3][MAXN], prevs[3][MAXN];
void chmin(int& x, int y)
{
x = min(x, y);
}
int main()
{
scanf("%d%s", &N, S);
for (int i = 0; i < N; ++i) {
switch (S[i]) {
case 'R': A[i] = 0; break;
case 'G': A[i] = 1; break;
case 'Y': A[i] = 2; break;
}
}
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... |