oj.uz

Submission #929003

# Submission time Handle Problem Language Result Execution time Memory
929003 2024-02-17T13:03:01 Z salmon Growing Vegetable is Fun 3 (JOI19_ho_t3) C++14
75 / 100
 500 ms 166364 KB 
#include <bits/stdc++.h>
using namespace std;

int N;
int memo[410][410][410][3];
int rp[410],gp[410],yp[410];
int R;
int G;
int Y;
char lst[410];
const int inf = 1100100100;
bool visited[410];

int root[410][410][3];


int main(){
    scanf(" %d",&N);

    for(int i = 0; i < N; i++){
        scanf(" %c",&lst[i]);

        if(lst[i] == 'R'){
            R++;
        }
        else if(lst[i] == 'G'){
            G++;
        }
        else if(lst[i] == 'Y'){
            Y++;
        }
    }

    memo[R][G][Y][0] = 0;
    memo[R][G][Y][1] = 0;
    memo[R][G][Y][2] = 0;

    int it = 0;
    for(int i = 0; i < N; i++){
        if(lst[i] == 'R'){
            rp[it] = i;
            it++;
        }
    }

    it = 0;
    for(int i = 0; i < N; i++){
        if(lst[i] == 'G'){
            gp[it] = i;
            it++;
        }
    }

    it = 0;
    for(int i = 0; i < N; i++){
        if(lst[i] == 'Y'){
            yp[it] = i;
            it++;
        }
    }

    for(int i = 0; i <= N; i++){
        root[R][i][0] = 0;
        root[G][i][0] = 0;
        root[Y][i][0] = 0;
    }

    for(int r = R - 1; r >= 0; r--){
        for(int i = 0; i <= N; i++){
            root[r][i][0] = root[r + 1][i][0];
            if(i >= rp[r]) root[r][i][0]++;
        }
    }

    for(int g = G - 1; g >= 0; g--){
        for(int i = 0; i <= N; i++){
            root[g][i][1] = root[g + 1][i][1];
            if(i >= gp[g]) root[g][i][1]++;
        }
    }

    for(int y = Y - 1; y >= 0; y--){
        for(int i = 0; i <= N; i++){
            root[y][i][2] = root[y + 1][i][2];
            if(i >= yp[y]) root[y][i][2]++;
        }
    }

    for(int i = N - 1; i >= 0; i--){
        for(int r = 0; r <= min(R,i); r++){
            for(int g = 0; g <= min(G,i - r); g++){
                for(int y = 0; y <= min(Y,i - r - g); y++){
                    int j = r + g + y;

                    if(r == R || min(memo[r + 1][g][y][1], memo[r + 1][g][y][2]) == inf){
                        memo[r][g][y][0] = inf;
                    }
                    else{
                        memo[r][g][y][0] = min(memo[r + 1][g][y][1], memo[r + 1][g][y][2]) + j-rp[r]+root[r+1][rp[r]][0] + root[g][rp[r]][1] + root[y][rp[r]][2];
                    }

                    if(g == G || min(memo[r][g + 1][y][0], memo[r][g + 1][y][2]) == inf){
                        memo[r][g][y][1] = inf;
                    }
                    else{
                        memo[r][g][y][1] = min(memo[r][g + 1][y][0], memo[r][g + 1][y][2])+ j-gp[g]+root[r][gp[g]][0] + root[g+1][gp[g]][1] + root[y][gp[g]][2];
                    }

                    if(y == Y || min(memo[r][g][y + 1][0], memo[r][g][y + 1][1]) == inf){
                        memo[r][g][y][2] = inf;
                    }
                    else{
                        memo[r][g][y][2] = min(memo[r][g][y + 1][0], memo[r][g][y + 1][1])+ j-yp[y]+root[r][yp[y]][0] + root[g][yp[y]][1] + root[y+1][yp[y]][2];
                    }
                }
            }
        }
    }

    if(min(memo[0][0][0][0],min(memo[0][0][0][1],memo[0][0][0][2])) != inf){
        printf("%d",min(memo[0][0][0][0],min(memo[0][0][0][1],memo[0][0][0][2])));
    }
    else{
        printf("-1");
    }

}
/*
6
GGGGRRR
GRGRGRG

RGRGYG
*/

Compilation message

joi2019_ho_t3.cpp: In function 'int main()':
joi2019_ho_t3.cpp:18:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |     scanf(" %d",&N);
      |     ~~~~~^~~~~~~~~~
joi2019_ho_t3.cpp:21:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |         scanf(" %c",&lst[i]);
      |         ~~~~~^~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 1 ms 4696 KB Output is correct
10 Correct 1 ms 4700 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4700 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4700 KB Output is correct
17 Correct 1 ms 2392 KB Output is correct

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 1 ms 4696 KB Output is correct
10 Correct 1 ms 4700 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4700 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4700 KB Output is correct
17 Correct 1 ms 2392 KB Output is correct
18 Correct 4 ms 6492 KB Output is correct
19 Correct 4 ms 6132 KB Output is correct
20 Correct 4 ms 6308 KB Output is correct
21 Correct 4 ms 6492 KB Output is correct
22 Correct 3 ms 5724 KB Output is correct
23 Correct 4 ms 6236 KB Output is correct
24 Correct 3 ms 5724 KB Output is correct
25 Correct 3 ms 8028 KB Output is correct
26 Correct 3 ms 8284 KB Output is correct
27 Correct 4 ms 7260 KB Output is correct
28 Correct 4 ms 6236 KB Output is correct
29 Correct 4 ms 6408 KB Output is correct
30 Correct 4 ms 6236 KB Output is correct
31 Correct 3 ms 5980 KB Output is correct
32 Correct 4 ms 6492 KB Output is correct
33 Correct 3 ms 7772 KB Output is correct
34 Correct 3 ms 7516 KB Output is correct
35 Correct 4 ms 6748 KB Output is correct
36 Correct 3 ms 6072 KB Output is correct
37 Correct 3 ms 5724 KB Output is correct
38 Correct 4 ms 6236 KB Output is correct
39 Correct 4 ms 6236 KB Output is correct
40 Correct 1 ms 2652 KB Output is correct
41 Correct 2 ms 6236 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 149 ms 166292 KB Output is correct
3 Correct 211 ms 165716 KB Output is correct
4 Correct 179 ms 166360 KB Output is correct
5 Correct 174 ms 166292 KB Output is correct
6 Correct 207 ms 166228 KB Output is correct
7 Correct 173 ms 165456 KB Output is correct
8 Correct 181 ms 165460 KB Output is correct
9 Correct 176 ms 164688 KB Output is correct
10 Correct 177 ms 166360 KB Output is correct
11 Correct 174 ms 166364 KB Output is correct
12 Correct 38 ms 47704 KB Output is correct
13 Correct 67 ms 80580 KB Output is correct
14 Correct 112 ms 115048 KB Output is correct
15 Correct 177 ms 166224 KB Output is correct
16 Correct 184 ms 166228 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 1 ms 4696 KB Output is correct
10 Correct 1 ms 4700 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4700 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4700 KB Output is correct
17 Correct 1 ms 2392 KB Output is correct
18 Correct 4 ms 6492 KB Output is correct
19 Correct 4 ms 6132 KB Output is correct
20 Correct 4 ms 6308 KB Output is correct
21 Correct 4 ms 6492 KB Output is correct
22 Correct 3 ms 5724 KB Output is correct
23 Correct 4 ms 6236 KB Output is correct
24 Correct 3 ms 5724 KB Output is correct
25 Correct 3 ms 8028 KB Output is correct
26 Correct 3 ms 8284 KB Output is correct
27 Correct 4 ms 7260 KB Output is correct
28 Correct 4 ms 6236 KB Output is correct
29 Correct 4 ms 6408 KB Output is correct
30 Correct 4 ms 6236 KB Output is correct
31 Correct 3 ms 5980 KB Output is correct
32 Correct 4 ms 6492 KB Output is correct
33 Correct 3 ms 7772 KB Output is correct
34 Correct 3 ms 7516 KB Output is correct
35 Correct 4 ms 6748 KB Output is correct
36 Correct 3 ms 6072 KB Output is correct
37 Correct 3 ms 5724 KB Output is correct
38 Correct 4 ms 6236 KB Output is correct
39 Correct 4 ms 6236 KB Output is correct
40 Correct 1 ms 2652 KB Output is correct
41 Correct 2 ms 6236 KB Output is correct
42 Correct 1 ms 4444 KB Output is correct
43 Correct 149 ms 166292 KB Output is correct
44 Correct 211 ms 165716 KB Output is correct
45 Correct 179 ms 166360 KB Output is correct
46 Correct 174 ms 166292 KB Output is correct
47 Correct 207 ms 166228 KB Output is correct
48 Correct 173 ms 165456 KB Output is correct
49 Correct 181 ms 165460 KB Output is correct
50 Correct 176 ms 164688 KB Output is correct
51 Correct 177 ms 166360 KB Output is correct
52 Correct 174 ms 166364 KB Output is correct
53 Correct 38 ms 47704 KB Output is correct
54 Correct 67 ms 80580 KB Output is correct
55 Correct 112 ms 115048 KB Output is correct
56 Correct 177 ms 166224 KB Output is correct
57 Correct 184 ms 166228 KB Output is correct
58 Execution timed out 1061 ms 80468 KB Time limit exceeded
59 Halted 0 ms 0 KB -