oj.uz

답안 #174408

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
174408 2020-01-06T11:24:23 Z AlexLuchianov Growing Vegetable is Fun 3 (JOI19_ho_t3) C++14
100 / 100
 416 ms 238604 KB 
#include <iostream>

using namespace std;

using ll = long long;
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define MAX(a, b) (((a) < (b)) ? (b) : (a))

int const nmax = 401;
int dp[1 + nmax][1 + nmax][1 + nmax][4];
int v[1 + nmax];
int lower[1 + nmax][4];
int pos[1 + nmax][4];

bool worth(int a, int b, int c){
  if(a + b + 1 < c)
    return 0;
  if(a + c + 1 < a)
    return 0;
  if(b + c + 1 < a)
    return 0;
  return 1;
}

int main()
{
  int n;
  cin >> n;
  for(int i = 1;i <= n; i++) {
    char ch;
    cin >> ch;
    if(ch == 'R')
      v[i] = 1;
    else if(ch == 'G')
      v[i] = 2;
    else if(ch == 'Y')
      v[i] = 3;
   lower[i][1] += lower[i - 1][1];
   lower[i][2] += lower[i - 1][2];
   lower[i][3] += lower[i - 1][3];
   lower[i][v[i]]++;
   pos[lower[i][v[i]]][v[i]] = i;
  }

  int red = lower[n][1], green = lower[n][2], yellow = lower[n][3];
  for(int i = 0; i <= red; i++)
    for(int j = 0; j <= green; j++)
      for(int h = 0; h <= yellow; h++)
        for(int last = 1; last <= 3; last++)
          dp[i][j][h][last] = nmax * nmax;
  dp[0][0][0][1] = dp[0][0][0][2] = dp[0][0][0][3] = 0;

  for(int total = 0; total < n; total++)
    for(int i = 0; i <= red; i++)
      for(int j = 0; j <= green; j++)
        if(i + j <= total){
          int h = total - i - j;
          if(worth(i, j, h) == 1){
            if(i < red){
              int pos2 = pos[i + 1][1];
              dp[i + 1][j][h][1] = MIN(dp[i + 1][j][h][1], MIN(dp[i][j][h][2], dp[i][j][h][3]) +
                                    MAX(0, lower[pos2][2] - j) +
                                    MAX(0, lower[pos2][3] - h)
                                    );
            }
            if(j < green){
              int pos2 = pos[j + 1][2];
              dp[i][j + 1][h][2] = MIN(dp[i][j + 1][h][2], MIN(dp[i][j][h][1], dp[i][j][h][3]) +
                                    MAX(0, lower[pos2][1] - i) +
                                    MAX(0, lower[pos2][3] - h)
                                    );
            }
            if(h < yellow){
              int pos2 = pos[h + 1][3];
              dp[i][j][h + 1][3] = MIN(dp[i][j][h + 1][3], MIN(dp[i][j][h][1], dp[i][j][h][2]) +
                                    MAX(0, lower[pos2][1] - i) +
                                    MAX(0, lower[pos2][2] - j)
                                    );
            }
          }
        }
  int result = MIN(dp[red][green][yellow][1], MIN(dp[red][green][yellow][2], dp[red][green][yellow][3]));
  if(result == nmax * nmax)
    cout << -1;
  else
    cout << result;
  return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 380 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 508 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 2 ms 632 KB Output is correct
10 Correct 2 ms 632 KB Output is correct
11 Correct 2 ms 504 KB Output is correct
12 Correct 2 ms 504 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 380 KB Output is correct
16 Correct 2 ms 508 KB Output is correct
17 Correct 2 ms 376 KB Output is correct

Subtask #2
55.0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 380 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 508 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 2 ms 632 KB Output is correct
10 Correct 2 ms 632 KB Output is correct
11 Correct 2 ms 504 KB Output is correct
12 Correct 2 ms 504 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 380 KB Output is correct
16 Correct 2 ms 508 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 4 ms 2424 KB Output is correct
19 Correct 3 ms 2040 KB Output is correct
20 Correct 4 ms 2296 KB Output is correct
21 Correct 4 ms 2424 KB Output is correct
22 Correct 3 ms 1784 KB Output is correct
23 Correct 4 ms 2168 KB Output is correct
24 Correct 3 ms 1660 KB Output is correct
25 Correct 5 ms 4152 KB Output is correct
26 Correct 6 ms 4472 KB Output is correct
27 Correct 5 ms 3192 KB Output is correct
28 Correct 4 ms 2424 KB Output is correct
29 Correct 4 ms 2296 KB Output is correct
30 Correct 4 ms 2296 KB Output is correct
31 Correct 4 ms 2040 KB Output is correct
32 Correct 4 ms 2424 KB Output is correct
33 Correct 5 ms 4088 KB Output is correct
34 Correct 5 ms 3832 KB Output is correct
35 Correct 4 ms 2812 KB Output is correct
36 Correct 3 ms 2040 KB Output is correct
37 Correct 3 ms 1784 KB Output is correct
38 Correct 4 ms 2168 KB Output is correct
39 Correct 4 ms 2424 KB Output is correct
40 Correct 2 ms 504 KB Output is correct
41 Correct 4 ms 2296 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 405 ms 238484 KB Output is correct
3 Correct 397 ms 237304 KB Output is correct
4 Correct 400 ms 238604 KB Output is correct
5 Correct 413 ms 238456 KB Output is correct
6 Correct 399 ms 238456 KB Output is correct
7 Correct 405 ms 237176 KB Output is correct
8 Correct 400 ms 237184 KB Output is correct
9 Correct 397 ms 235904 KB Output is correct
10 Correct 406 ms 238400 KB Output is correct
11 Correct 410 ms 238428 KB Output is correct
12 Correct 102 ms 55592 KB Output is correct
13 Correct 164 ms 104060 KB Output is correct
14 Correct 259 ms 157516 KB Output is correct
15 Correct 416 ms 238324 KB Output is correct
16 Correct 402 ms 238324 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 380 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 508 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 2 ms 632 KB Output is correct
10 Correct 2 ms 632 KB Output is correct
11 Correct 2 ms 504 KB Output is correct
12 Correct 2 ms 504 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 380 KB Output is correct
16 Correct 2 ms 508 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 4 ms 2424 KB Output is correct
19 Correct 3 ms 2040 KB Output is correct
20 Correct 4 ms 2296 KB Output is correct
21 Correct 4 ms 2424 KB Output is correct
22 Correct 3 ms 1784 KB Output is correct
23 Correct 4 ms 2168 KB Output is correct
24 Correct 3 ms 1660 KB Output is correct
25 Correct 5 ms 4152 KB Output is correct
26 Correct 6 ms 4472 KB Output is correct
27 Correct 5 ms 3192 KB Output is correct
28 Correct 4 ms 2424 KB Output is correct
29 Correct 4 ms 2296 KB Output is correct
30 Correct 4 ms 2296 KB Output is correct
31 Correct 4 ms 2040 KB Output is correct
32 Correct 4 ms 2424 KB Output is correct
33 Correct 5 ms 4088 KB Output is correct
34 Correct 5 ms 3832 KB Output is correct
35 Correct 4 ms 2812 KB Output is correct
36 Correct 3 ms 2040 KB Output is correct
37 Correct 3 ms 1784 KB Output is correct
38 Correct 4 ms 2168 KB Output is correct
39 Correct 4 ms 2424 KB Output is correct
40 Correct 2 ms 504 KB Output is correct
41 Correct 4 ms 2296 KB Output is correct
42 Correct 2 ms 376 KB Output is correct
43 Correct 405 ms 238484 KB Output is correct
44 Correct 397 ms 237304 KB Output is correct
45 Correct 400 ms 238604 KB Output is correct
46 Correct 413 ms 238456 KB Output is correct
47 Correct 399 ms 238456 KB Output is correct
48 Correct 405 ms 237176 KB Output is correct
49 Correct 400 ms 237184 KB Output is correct
50 Correct 397 ms 235904 KB Output is correct
51 Correct 406 ms 238400 KB Output is correct
52 Correct 410 ms 238428 KB Output is correct
53 Correct 102 ms 55592 KB Output is correct
54 Correct 164 ms 104060 KB Output is correct
55 Correct 259 ms 157516 KB Output is correct
56 Correct 416 ms 238324 KB Output is correct
57 Correct 402 ms 238324 KB Output is correct
58 Correct 171 ms 100624 KB Output is correct
59 Correct 220 ms 123872 KB Output is correct
60 Correct 196 ms 113400 KB Output is correct
61 Correct 192 ms 110328 KB Output is correct
62 Correct 380 ms 229088 KB Output is correct
63 Correct 400 ms 229744 KB Output is correct
64 Correct 347 ms 201772 KB Output is correct
65 Correct 320 ms 176196 KB Output is correct
66 Correct 194 ms 111452 KB Output is correct
67 Correct 197 ms 108024 KB Output is correct
68 Correct 201 ms 114552 KB Output is correct
69 Correct 192 ms 111096 KB Output is correct
70 Correct 214 ms 119160 KB Output is correct
71 Correct 183 ms 109176 KB Output is correct
72 Correct 53 ms 48248 KB Output is correct
73 Correct 6 ms 3704 KB Output is correct