oj.uz

Submission #98810

# Submission time Handle Problem Language Result Execution time Memory
98810 2019-02-26T09:19:49 Z bogdan10bos Growing Vegetable is Fun 3 (JOI19_ho_t3) C++14
100 / 100
 273 ms 325632 KB 
#include <bits/stdc++.h>

using namespace std;

//#define FILE_IO

typedef pair<int, int> pii;
typedef pair<int, pii> p3i;

int N;
string s;

int getid(char ch)
{
    if(ch == 'R')   return 0;
    if(ch == 'G')   return 1;
    if(ch == 'Y')   return 2;
    return -1;
}
char idtochar(int id)
{
    if(id == 0) return 'R';
    if(id == 1) return 'G';
    if(id == 2) return 'Y';
    return 0;
}

int dp[405][405][405][3];  /// dp[r][g][y]
int lst[405][405][405][3];
vector<p3i> pos[3];

int cost(p3i x, p3i y)
{
    int ans = 0;
    ans += abs(x.first - y.first);
    ans += abs(x.second.first - y.second.first);
    ans += abs(x.second.second - y.second.second);
    return ans;
}

int main()
{
    #ifdef FILE_IO
    freopen("1.in", "r", stdin);
    freopen("1.out", "w", stdout);
    #endif

    cin >> N;
    cin >> s;

    int f[3];
    f[0] = f[1] = f[2] = 0;
    for(int i = 0; i < N; i++)
    {
        f[getid(s[i])]++;
        pos[getid(s[i])].push_back({ f[0], {f[1], f[2]} });
    }

    int R = pos[0].size(), G = pos[1].size(), Y = pos[2].size();

    int mx = max({R, G, Y});
    if(mx > (N + 1) / 2)
    {
        printf("-1\n");
        exit(0);
    }

    for(int r = 0; r <= R; r++)
        for(int g = 0; g <= G; g++)
            for(int y = 0; y <= Y; y++)
            {
                int p = r + g + y;
                if(p == 0)  continue;

                dp[r][g][y][0] = dp[r][g][y][1] = dp[r][g][y][2] = 1 << 30;
                if(r > 0)
                {
                    dp[r][g][y][0] = min(dp[r - 1][g][y][1], dp[r - 1][g][y][2]) + cost(pos[0][r - 1], {r, {g, y}});
                    lst[r][g][y][0] = (dp[r - 1][g][y][1] > dp[r - 1][g][y][2]) ? 2 : 1;
                }
                if(g > 0)
                {
                    dp[r][g][y][1] = min(dp[r][g - 1][y][0], dp[r][g - 1][y][2]) + cost(pos[1][g - 1], {r, {g, y}});
                    lst[r][g][y][1] = (dp[r][g - 1][y][0] > dp[r][g - 1][y][2]) ? 2 : 0;
                }
                if(y > 0)
                {
                    dp[r][g][y][2] = min(dp[r][g][y - 1][0], dp[r][g][y - 1][1]) + cost(pos[2][y - 1], {r, {g, y}});
                    lst[r][g][y][2] = (dp[r][g][y - 1][0] > dp[r][g][y - 1][1]) ? 1 : 0;
                }
            }

    int ans = min({ dp[R][G][Y][0], dp[R][G][Y][1], dp[R][G][Y][2] });
    ans /= 2;
    cout << ans << '\n';

    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 332 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 640 KB Output is correct
6 Correct 3 ms 768 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 3 ms 640 KB Output is correct
9 Correct 2 ms 896 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 3 ms 768 KB Output is correct
12 Correct 3 ms 640 KB Output is correct
13 Correct 3 ms 256 KB Output is correct
14 Correct 2 ms 768 KB Output is correct
15 Correct 3 ms 640 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 332 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 640 KB Output is correct
6 Correct 3 ms 768 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 3 ms 640 KB Output is correct
9 Correct 2 ms 896 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 3 ms 768 KB Output is correct
12 Correct 3 ms 640 KB Output is correct
13 Correct 3 ms 256 KB Output is correct
14 Correct 2 ms 768 KB Output is correct
15 Correct 3 ms 640 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 5 ms 4352 KB Output is correct
19 Correct 6 ms 3584 KB Output is correct
20 Correct 5 ms 4224 KB Output is correct
21 Correct 6 ms 4608 KB Output is correct
22 Correct 4 ms 3072 KB Output is correct
23 Correct 6 ms 3968 KB Output is correct
24 Correct 4 ms 2944 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 7 ms 5888 KB Output is correct
28 Correct 6 ms 4352 KB Output is correct
29 Correct 5 ms 4224 KB Output is correct
30 Correct 5 ms 4224 KB Output is correct
31 Correct 5 ms 3712 KB Output is correct
32 Correct 5 ms 4480 KB Output is correct
33 Correct 2 ms 384 KB Output is correct
34 Correct 2 ms 384 KB Output is correct
35 Correct 6 ms 5120 KB Output is correct
36 Correct 6 ms 3584 KB Output is correct
37 Correct 5 ms 3200 KB Output is correct
38 Correct 5 ms 3968 KB Output is correct
39 Correct 7 ms 4352 KB Output is correct
40 Correct 2 ms 256 KB Output is correct
41 Correct 2 ms 384 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 241 ms 325496 KB Output is correct
3 Correct 271 ms 323896 KB Output is correct
4 Correct 258 ms 325480 KB Output is correct
5 Correct 247 ms 325596 KB Output is correct
6 Correct 253 ms 325624 KB Output is correct
7 Correct 261 ms 323960 KB Output is correct
8 Correct 254 ms 323996 KB Output is correct
9 Correct 230 ms 322296 KB Output is correct
10 Correct 273 ms 325624 KB Output is correct
11 Correct 254 ms 325632 KB Output is correct
12 Correct 67 ms 87800 KB Output is correct
13 Correct 126 ms 153976 KB Output is correct
14 Correct 174 ms 222428 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 332 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 640 KB Output is correct
6 Correct 3 ms 768 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 3 ms 640 KB Output is correct
9 Correct 2 ms 896 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 3 ms 768 KB Output is correct
12 Correct 3 ms 640 KB Output is correct
13 Correct 3 ms 256 KB Output is correct
14 Correct 2 ms 768 KB Output is correct
15 Correct 3 ms 640 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 5 ms 4352 KB Output is correct
19 Correct 6 ms 3584 KB Output is correct
20 Correct 5 ms 4224 KB Output is correct
21 Correct 6 ms 4608 KB Output is correct
22 Correct 4 ms 3072 KB Output is correct
23 Correct 6 ms 3968 KB Output is correct
24 Correct 4 ms 2944 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 7 ms 5888 KB Output is correct
28 Correct 6 ms 4352 KB Output is correct
29 Correct 5 ms 4224 KB Output is correct
30 Correct 5 ms 4224 KB Output is correct
31 Correct 5 ms 3712 KB Output is correct
32 Correct 5 ms 4480 KB Output is correct
33 Correct 2 ms 384 KB Output is correct
34 Correct 2 ms 384 KB Output is correct
35 Correct 6 ms 5120 KB Output is correct
36 Correct 6 ms 3584 KB Output is correct
37 Correct 5 ms 3200 KB Output is correct
38 Correct 5 ms 3968 KB Output is correct
39 Correct 7 ms 4352 KB Output is correct
40 Correct 2 ms 256 KB Output is correct
41 Correct 2 ms 384 KB Output is correct
42 Correct 2 ms 384 KB Output is correct
43 Correct 241 ms 325496 KB Output is correct
44 Correct 271 ms 323896 KB Output is correct
45 Correct 258 ms 325480 KB Output is correct
46 Correct 247 ms 325596 KB Output is correct
47 Correct 253 ms 325624 KB Output is correct
48 Correct 261 ms 323960 KB Output is correct
49 Correct 254 ms 323996 KB Output is correct
50 Correct 230 ms 322296 KB Output is correct
51 Correct 273 ms 325624 KB Output is correct
52 Correct 254 ms 325632 KB Output is correct
53 Correct 67 ms 87800 KB Output is correct
54 Correct 126 ms 153976 KB Output is correct
55 Correct 174 ms 222428 KB Output is correct
56 Correct 2 ms 384 KB Output is correct
57 Correct 3 ms 384 KB Output is correct
58 Correct 187 ms 152192 KB Output is correct
59 Correct 210 ms 192932 KB Output is correct
60 Correct 199 ms 175448 KB Output is correct
61 Correct 180 ms 169572 KB Output is correct
62 Correct 3 ms 384 KB Output is correct
63 Correct 262 ms 320132 KB Output is correct
64 Correct 261 ms 300012 KB Output is correct
65 Correct 244 ms 276844 KB Output is correct
66 Correct 174 ms 171868 KB Output is correct
67 Correct 167 ms 165520 KB Output is correct
68 Correct 158 ms 177176 KB Output is correct
69 Correct 167 ms 170744 KB Output is correct
70 Correct 208 ms 185024 KB Output is correct
71 Correct 156 ms 167672 KB Output is correct
72 Correct 2 ms 384 KB Output is correct
73 Correct 3 ms 384 KB Output is correct