# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
127697 | arnold518 | Growing Vegetable is Fun 3 (JOI19_ho_t3) | C++14 | 146 ms | 163100 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;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 400;
const int INF = 1000000;
int N, ans;
char S[MAXN+10];
int dp[MAXN+10][MAXN+10][MAXN+10][3];
int rcnt[MAXN+10], gcnt[MAXN+10], ycnt[MAXN+10];
vector<int> rpos, gpos, ypos;
int main()
{
int i, j;
scanf("%d%s", &N, S+1);
for(i=1; i<=N; i++)
{
rcnt[i]=rcnt[i-1]; gcnt[i]=gcnt[i-1]; ycnt[i]=ycnt[i-1];
if(S[i]=='R') rpos.push_back(i), rcnt[i]++;
if(S[i]=='G') gpos.push_back(i), gcnt[i]++;
if(S[i]=='Y') ypos.push_back(i), ycnt[i]++;
//printf("%d %d %d\n", rcnt[i], gcnt[i], ycnt[i]);
}
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... |