oj.uz

Submission #97397

# Submission time Handle Problem Language Result Execution time Memory
97397 2019-02-15T17:31:15 Z kdh9949 Growing Vegetable is Fun 3 (JOI19_ho_t3) C++17
0 / 100
 7 ms 4992 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 405, INF = int(1e9);

int n, tt[3], s[6][N], p[3][N], d[N][N][N][3];
char b[N];
bool c[N][N][N][3];

int f(int r, int g, int y, int l){
    if(c[r][g][y][l]) return d[r][g][y][l];
    c[r][g][y][l] = 1;
    int &ret = d[r][g][y][l];
    ret = INF;
    if(r > tt[0] || g > tt[1] || y > tt[2]) return ret;
    if(r + g + y == n) return ret = 0;
    int a[5] = {r, g, y, r, g};
    for(int i = 0; i < 3; i++){
        if(i == l) continue;
        ret = min(ret,
                  f(r + (i == 0), g + (i == 1), y + (i == 2), i)
                  + max(0, s[i + 1][p[i][a[i]]] - a[i + 1])
                  + max(0, s[i + 2][p[i][a[i]]] - a[i + 2]));
    }
    return ret;
}

int main(){
    scanf("%d%s", &n, b + 1);
    for(int i = 1; i <= n; i++){
        for(int j = 0; j < 6; j++) s[j][i] = s[j][i - 1];
        int t = (b[i] == 'R' ? 0 : b[i] == 'G' ? 1 : 2);
        s[t][i]++;
        s[t + 3][i]++;
        p[t][tt[t]++] = i;
    }
    int r = min({f(1, 0, 0, 0), f(0, 1, 0, 1), f(0, 0, 1, 2)});
    if(r == INF) puts("-1");
    else printf("%d\n", r);
}

Compilation message

joi2019_ho_t3.cpp: In function 'int main()':
joi2019_ho_t3.cpp:29:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%s", &n, b + 1);
     ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Incorrect 2 ms 512 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Incorrect 2 ms 512 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 6 ms 4992 KB Output is correct
3 Correct 7 ms 4992 KB Output is correct
4 Incorrect 7 ms 4992 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Incorrect 2 ms 512 KB Output isn't correct
5 Halted 0 ms 0 KB -