# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
848930 | qthang2k11 | Growing Vegetable is Fun 3 (JOI19_ho_t3) | C++17 | 140 ms | 774744 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 <bits/stdc++.h>
using namespace std;
template<class X, class Y>
inline void mini(X &x, Y y) {
if (x > y) x = y;
}
const int N = 404;
int sum[N][3], dp[N][N][N][3];
vector<int> pos[3];
string s;
int n;
inline int get(int c, int l, int r) {
return sum[r][c] - sum[l - 1][c];
}
int32_t main() {
cin.tie(0)->sync_with_stdio(0);
map<char, int> mp;
mp['R'] = 0;
mp['G'] = 1;
mp['Y'] = 2;
cin >> n >> s;
for (int i = 1; i <= n; i++) {
int val = mp[s[i - 1]];
for (int j = 0; j < 3; j++)
sum[i][j] = sum[i - 1][j];
# | 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... |