# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
883202 | mychecksedad | Growing Vegetable is Fun 3 (JOI19_ho_t3) | C++17 | 301 ms | 774216 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.
/* Author : Mychecksdead */
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define pb push_back
#define all(x) x.begin(), x.end()
#define en cout << '\n'
const int N = 405, M = 1e5+10, K = 52, MX = 30;
int n, dp[N][N][N][3], pref[N][3];
string s, c = "RGY";
int m(char x){
if(x==c[0]) return 0;
if(x==c[1]) return 1;
return 2;
}
void solve(){
cin >> n >> s;
array<int, 3> x = {0, 0, 0};
for(int i = 0 ;i < n; ++i){
x[m(s[i])]++;
}
if(max({x[0], x[1], x[2]}) > (n+1)/2){
cout << -1;
return;
}
vector<int> v[3];
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... |