oj.uz

Submission #589994

# Submission time Handle Problem Language Result Execution time Memory
589994 2022-07-05T12:56:46 Z boris_mihov Growing Vegetable is Fun 3 (JOI19_ho_t3) C++14
75 / 100
 500 ms 108716 KB 
#include <algorithm>
#include <iostream>
#include <vector>

typedef long long llong;
const int MAXN = 400 + 10;
const int INF = 1e9;

int n;
char s[MAXN];
int dp[MAXN][MAXN][MAXN][4];
bool bl[MAXN][MAXN][MAXN][4];
std::vector < int > byPos[4];

int f(int ones, int twos, int threes, int last)
{
    if (ones + twos + threes == n) return 0;
    if (bl[ones][twos][threes][last]) return dp[ones][twos][threes][last];
    
    bl[ones][twos][threes][last] = true;
    dp[ones][twos][threes][last] = INF;

    if (last != 1 && ones != byPos[1].size())
    {
        int add = 0;
        for (int i = 0 ; i < twos ; ++i)
        {
            if (byPos[2][i] > byPos[1][ones]) add++; 
        }

        for (int i = 0 ; i < threes ; ++i)
        {
            if (byPos[3][i] > byPos[1][ones]) add++; 
        }

        dp[ones][twos][threes][last] = std::min(dp[ones][twos][threes][last], f(ones + 1, twos, threes, 1) + add + byPos[1][ones] - (ones + twos + threes + 1));
    }

    if (last != 2 && twos != byPos[2].size())
    {
        int add = 0;
        for (int i = 0 ; i < ones ; ++i)
        {
            if (byPos[1][i] > byPos[2][twos]) add++; 
        }

        for (int i = 0 ; i < threes ; ++i)
        {
            if (byPos[3][i] > byPos[2][twos]) add++; 
        }

        dp[ones][twos][threes][last] = std::min(dp[ones][twos][threes][last], f(ones, twos + 1, threes, 2) + add + byPos[2][twos] - (ones + twos + threes + 1));
    }

    if (last != 3 && threes != byPos[3].size())
    {
        int add = 0;
        for (int i = 0 ; i < ones ; ++i)
        {
            if (byPos[1][i] > byPos[3][threes]) add++; 
        }

        for (int i = 0 ; i < twos ; ++i)
        {
            if (byPos[2][i] > byPos[3][threes]) add++; 
        }

        dp[ones][twos][threes][last] = std::min(dp[ones][twos][threes][last], f(ones, twos, threes + 1, 3) + add + byPos[3][threes] - (ones + twos + threes + 1));
    }

    return dp[ones][twos][threes][last];
}

void solve()
{
    for (int i = 1 ; i <= n ; ++i)
    {
        if (s[i] == 'R') s[i] = '1';
        if (s[i] == 'G') s[i] = '2';
        if (s[i] == 'Y') s[i] = '3';
        byPos[s[i]-'0'].push_back(i);
    }

    int result = f(0, 0, 0, 0);
    if (result == INF) result = -1;
    std::cout << result << '\n';
}

void read()
{
    std::cin >> n;
    std::cin >> s + 1;
}

void fastIO()
{
    std::ios_base :: sync_with_stdio(0);
    std::cout.tie(nullptr);
    std::cin.tie(nullptr);
}

int main ()
{
    fastIO();
    read();
    solve();

    return 0;
}

Compilation message

joi2019_ho_t3.cpp: In function 'int f(int, int, int, int)':
joi2019_ho_t3.cpp:23:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |     if (last != 1 && ones != byPos[1].size())
      |                      ~~~~~^~~~~~~~~~~~~~~~~~
joi2019_ho_t3.cpp:39:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |     if (last != 2 && twos != byPos[2].size())
      |                      ~~~~~^~~~~~~~~~~~~~~~~~
joi2019_ho_t3.cpp:55:29: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |     if (last != 3 && threes != byPos[3].size())
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~
joi2019_ho_t3.cpp: In function 'void read()':
joi2019_ho_t3.cpp:92:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   92 |     std::cin >> s + 1;
      |                 ~~^~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 460 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 0 ms 468 KB Output is correct
11 Correct 1 ms 592 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 460 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 0 ms 468 KB Output is correct
11 Correct 1 ms 592 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 2 ms 3028 KB Output is correct
19 Correct 2 ms 2516 KB Output is correct
20 Correct 3 ms 2916 KB Output is correct
21 Correct 3 ms 3156 KB Output is correct
22 Correct 2 ms 2132 KB Output is correct
23 Correct 3 ms 2768 KB Output is correct
24 Correct 2 ms 1996 KB Output is correct
25 Correct 1 ms 1108 KB Output is correct
26 Correct 1 ms 1364 KB Output is correct
27 Correct 3 ms 3156 KB Output is correct
28 Correct 3 ms 3028 KB Output is correct
29 Correct 3 ms 2900 KB Output is correct
30 Correct 3 ms 2900 KB Output is correct
31 Correct 3 ms 2644 KB Output is correct
32 Correct 3 ms 3028 KB Output is correct
33 Correct 1 ms 1488 KB Output is correct
34 Correct 1 ms 1748 KB Output is correct
35 Correct 3 ms 3156 KB Output is correct
36 Correct 2 ms 2516 KB Output is correct
37 Correct 2 ms 2260 KB Output is correct
38 Correct 2 ms 2620 KB Output is correct
39 Correct 4 ms 3028 KB Output is correct
40 Correct 0 ms 344 KB Output is correct
41 Correct 1 ms 980 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 3 ms 5204 KB Output is correct
3 Correct 2 ms 5204 KB Output is correct
4 Correct 3 ms 5196 KB Output is correct
5 Correct 3 ms 5256 KB Output is correct
6 Correct 3 ms 5204 KB Output is correct
7 Correct 3 ms 5200 KB Output is correct
8 Correct 3 ms 5204 KB Output is correct
9 Correct 3 ms 5196 KB Output is correct
10 Correct 3 ms 5188 KB Output is correct
11 Correct 3 ms 5204 KB Output is correct
12 Correct 2 ms 2772 KB Output is correct
13 Correct 2 ms 3692 KB Output is correct
14 Correct 2 ms 4308 KB Output is correct
15 Correct 2 ms 5204 KB Output is correct
16 Correct 3 ms 5204 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 460 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 0 ms 468 KB Output is correct
11 Correct 1 ms 592 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 2 ms 3028 KB Output is correct
19 Correct 2 ms 2516 KB Output is correct
20 Correct 3 ms 2916 KB Output is correct
21 Correct 3 ms 3156 KB Output is correct
22 Correct 2 ms 2132 KB Output is correct
23 Correct 3 ms 2768 KB Output is correct
24 Correct 2 ms 1996 KB Output is correct
25 Correct 1 ms 1108 KB Output is correct
26 Correct 1 ms 1364 KB Output is correct
27 Correct 3 ms 3156 KB Output is correct
28 Correct 3 ms 3028 KB Output is correct
29 Correct 3 ms 2900 KB Output is correct
30 Correct 3 ms 2900 KB Output is correct
31 Correct 3 ms 2644 KB Output is correct
32 Correct 3 ms 3028 KB Output is correct
33 Correct 1 ms 1488 KB Output is correct
34 Correct 1 ms 1748 KB Output is correct
35 Correct 3 ms 3156 KB Output is correct
36 Correct 2 ms 2516 KB Output is correct
37 Correct 2 ms 2260 KB Output is correct
38 Correct 2 ms 2620 KB Output is correct
39 Correct 4 ms 3028 KB Output is correct
40 Correct 0 ms 344 KB Output is correct
41 Correct 1 ms 980 KB Output is correct
42 Correct 0 ms 340 KB Output is correct
43 Correct 3 ms 5204 KB Output is correct
44 Correct 2 ms 5204 KB Output is correct
45 Correct 3 ms 5196 KB Output is correct
46 Correct 3 ms 5256 KB Output is correct
47 Correct 3 ms 5204 KB Output is correct
48 Correct 3 ms 5200 KB Output is correct
49 Correct 3 ms 5204 KB Output is correct
50 Correct 3 ms 5196 KB Output is correct
51 Correct 3 ms 5188 KB Output is correct
52 Correct 3 ms 5204 KB Output is correct
53 Correct 2 ms 2772 KB Output is correct
54 Correct 2 ms 3692 KB Output is correct
55 Correct 2 ms 4308 KB Output is correct
56 Correct 2 ms 5204 KB Output is correct
57 Correct 3 ms 5204 KB Output is correct
58 Execution timed out 1022 ms 108716 KB Time limit exceeded
59 Halted 0 ms 0 KB -