제출 #101718

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
101718	2019-03-19 14:53:58	KCSC	Growing Vegetable is Fun 3 (JOI19_ho_t3)	C++14	100 / 100	170 ms	163152 KiB

joi2019_ho_t3

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
const int DIM = 405;
const int INF = 405 * 405;
char str[DIM];
int dp[DIM][DIM][DIM][3], idx[3];
int tot[3], psm[DIM][3], lst[DIM][3];
inline void f(int &x, int y) {
  if (x >= y) { x = y; } }
int main(void) {
#ifdef HOME
  freopen("vegetables.in", "r", stdin);
  freopen("vegetables.out", "w", stdout);
#endif
  int n; cin >> n >> (str + 1);
  for (int i = 1; i <= n; ++i) {
    char ch = str[i];
    if (ch == 'R') { lst[++tot[0]][0] = i; ++psm[i][0]; }
    if (ch == 'G') { lst[++tot[1]][1] = i; ++psm[i][1]; }
    if (ch == 'Y') { lst[++tot[2]][2] = i; ++psm[i][2]; }
    for (int l = 0; l <= 2; ++l) {
      psm[i][l] += psm[i - 1][l]; } }
  for (int a = 0; a <= tot[0]; ++a) {
  for (int b = 0; b <= tot[1]; ++b) {
  for (int c = 0; c <= tot[2]; ++c) {
    for (int l = 0; l <= 2; ++l) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 5 / 5
• Subtask 2: 55 / 55
• Subtask 3: 15 / 15
• Subtask 4: 25 / 25