# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
99274 | imeimi2000 | Growing Vegetable is Fun 3 (JOI19_ho_t3) | C++17 | 40 ms | 1280 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 <algorithm>
#include <vector>
using namespace std;
const int inf = 1e7;
int n;
char str[401];
int tr[256];
vector<int> pos[3];
int dp[401][401][3];
int cnt[401][3];
int cost(int i, int j, int k, int x) {
int ret = 0;
ret += max(i - cnt[x - 1][0], 0);
ret += max(j - cnt[x - 1][1], 0);
ret += max(k - cnt[x - 1][2], 0);
return ret;
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
tr['R'] = 0;
tr['G'] = 1;
tr['Y'] = 2;
cin >> n >> str;
for (int i = 0; i < n; ++i) {
pos[tr[str[i]]].push_back(i + 1);
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... |