oj.uz

Submission #929006

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

int N;
int memo[3][410][410][410];
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[3][410][410];


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[0][R][G][Y] = 0;
    memo[1][R][G][Y] = 0;
    memo[2][R][G][Y] = 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[0][R][i] = 0;
        root[0][G][i] = 0;
        root[0][Y][i] = 0;
    }

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

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

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

    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[1][r + 1][g][y], memo[2][r + 1][g][y]) == inf){
                        memo[0][r][g][y] = inf;
                    }
                    else{
                        memo[0][r][g][y] = min(memo[1][r + 1][g][y], memo[2][r + 1][g][y]) + j-rp[r]+root[0][r+1][rp[r]] + root[1][g][rp[r]] + root[2][y][rp[r]];
                    }

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

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

    if(min(memo[0][0][0][0],min(memo[1][0][0][0],memo[2][0][0][0])) != inf){
        printf("%d",min(memo[0][0][0][0],min(memo[1][0][0][0],memo[2][0][0][0])));
    }
    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 1 ms 10588 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Correct 1 ms 10588 KB Output is correct
6 Correct 1 ms 10844 KB Output is correct
7 Correct 2 ms 12892 KB Output is correct
8 Correct 1 ms 10752 KB Output is correct
9 Correct 1 ms 10656 KB Output is correct
10 Correct 2 ms 14940 KB Output is correct
11 Correct 2 ms 10588 KB Output is correct
12 Correct 1 ms 10588 KB Output is correct
13 Correct 1 ms 8792 KB Output is correct
14 Correct 1 ms 10844 KB Output is correct
15 Correct 1 ms 10588 KB Output is correct
16 Correct 2 ms 14940 KB Output is correct
17 Correct 1 ms 6488 KB Output is correct

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 10588 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Correct 1 ms 10588 KB Output is correct
6 Correct 1 ms 10844 KB Output is correct
7 Correct 2 ms 12892 KB Output is correct
8 Correct 1 ms 10752 KB Output is correct
9 Correct 1 ms 10656 KB Output is correct
10 Correct 2 ms 14940 KB Output is correct
11 Correct 2 ms 10588 KB Output is correct
12 Correct 1 ms 10588 KB Output is correct
13 Correct 1 ms 8792 KB Output is correct
14 Correct 1 ms 10844 KB Output is correct
15 Correct 1 ms 10588 KB Output is correct
16 Correct 2 ms 14940 KB Output is correct
17 Correct 1 ms 6488 KB Output is correct
18 Correct 5 ms 24412 KB Output is correct
19 Correct 5 ms 20084 KB Output is correct
20 Correct 5 ms 24412 KB Output is correct
21 Correct 5 ms 22540 KB Output is correct
22 Correct 5 ms 23900 KB Output is correct
23 Correct 5 ms 20240 KB Output is correct
24 Correct 4 ms 15548 KB Output is correct
25 Correct 6 ms 34112 KB Output is correct
26 Correct 5 ms 30044 KB Output is correct
27 Correct 6 ms 27228 KB Output is correct
28 Correct 5 ms 22364 KB Output is correct
29 Correct 5 ms 22364 KB Output is correct
30 Correct 5 ms 20348 KB Output is correct
31 Correct 4 ms 18008 KB Output is correct
32 Correct 5 ms 20312 KB Output is correct
33 Correct 5 ms 25692 KB Output is correct
34 Correct 4 ms 23132 KB Output is correct
35 Correct 5 ms 24776 KB Output is correct
36 Correct 5 ms 22104 KB Output is correct
37 Correct 4 ms 17756 KB Output is correct
38 Correct 4 ms 18012 KB Output is correct
39 Correct 5 ms 20316 KB Output is correct
40 Correct 1 ms 6576 KB Output is correct
41 Correct 3 ms 13916 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 198 ms 239972 KB Output is correct
3 Correct 196 ms 239080 KB Output is correct
4 Correct 204 ms 239956 KB Output is correct
5 Correct 199 ms 239952 KB Output is correct
6 Correct 189 ms 239960 KB Output is correct
7 Correct 192 ms 236948 KB Output is correct
8 Correct 190 ms 236884 KB Output is correct
9 Correct 191 ms 236092 KB Output is correct
10 Correct 204 ms 239952 KB Output is correct
11 Correct 194 ms 239832 KB Output is correct
12 Correct 36 ms 97112 KB Output is correct
13 Correct 70 ms 139860 KB Output is correct
14 Correct 119 ms 179104 KB Output is correct
15 Correct 204 ms 237524 KB Output is correct
16 Correct 212 ms 237608 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 10588 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Correct 1 ms 10588 KB Output is correct
6 Correct 1 ms 10844 KB Output is correct
7 Correct 2 ms 12892 KB Output is correct
8 Correct 1 ms 10752 KB Output is correct
9 Correct 1 ms 10656 KB Output is correct
10 Correct 2 ms 14940 KB Output is correct
11 Correct 2 ms 10588 KB Output is correct
12 Correct 1 ms 10588 KB Output is correct
13 Correct 1 ms 8792 KB Output is correct
14 Correct 1 ms 10844 KB Output is correct
15 Correct 1 ms 10588 KB Output is correct
16 Correct 2 ms 14940 KB Output is correct
17 Correct 1 ms 6488 KB Output is correct
18 Correct 5 ms 24412 KB Output is correct
19 Correct 5 ms 20084 KB Output is correct
20 Correct 5 ms 24412 KB Output is correct
21 Correct 5 ms 22540 KB Output is correct
22 Correct 5 ms 23900 KB Output is correct
23 Correct 5 ms 20240 KB Output is correct
24 Correct 4 ms 15548 KB Output is correct
25 Correct 6 ms 34112 KB Output is correct
26 Correct 5 ms 30044 KB Output is correct
27 Correct 6 ms 27228 KB Output is correct
28 Correct 5 ms 22364 KB Output is correct
29 Correct 5 ms 22364 KB Output is correct
30 Correct 5 ms 20348 KB Output is correct
31 Correct 4 ms 18008 KB Output is correct
32 Correct 5 ms 20312 KB Output is correct
33 Correct 5 ms 25692 KB Output is correct
34 Correct 4 ms 23132 KB Output is correct
35 Correct 5 ms 24776 KB Output is correct
36 Correct 5 ms 22104 KB Output is correct
37 Correct 4 ms 17756 KB Output is correct
38 Correct 4 ms 18012 KB Output is correct
39 Correct 5 ms 20316 KB Output is correct
40 Correct 1 ms 6576 KB Output is correct
41 Correct 3 ms 13916 KB Output is correct
42 Correct 1 ms 8540 KB Output is correct
43 Correct 198 ms 239972 KB Output is correct
44 Correct 196 ms 239080 KB Output is correct
45 Correct 204 ms 239956 KB Output is correct
46 Correct 199 ms 239952 KB Output is correct
47 Correct 189 ms 239960 KB Output is correct
48 Correct 192 ms 236948 KB Output is correct
49 Correct 190 ms 236884 KB Output is correct
50 Correct 191 ms 236092 KB Output is correct
51 Correct 204 ms 239952 KB Output is correct
52 Correct 194 ms 239832 KB Output is correct
53 Correct 36 ms 97112 KB Output is correct
54 Correct 70 ms 139860 KB Output is correct
55 Correct 119 ms 179104 KB Output is correct
56 Correct 204 ms 237524 KB Output is correct
57 Correct 212 ms 237608 KB Output is correct
58 Execution timed out 1050 ms 126288 KB Time limit exceeded
59 Halted 0 ms 0 KB -