oj.uz

Submission #898115

# Submission time Handle Problem Language Result Execution time Memory
898115 2024-01-04T10:28:45 Z andrei_iorgulescu Dango Maker (JOI18_dango_maker) C++14
100 / 100
 243 ms 68176 KB 
#include <bits/stdc++.h>

using namespace std;

int n,m;
char a[3005][3005];
int dp[3005][3];
vector<int>v[6005];

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            cin >> a[i][j],v[i + j].push_back(i);
    int ans = 0;
    for (int d = 2; d <= n + m; d++)
    {
        for (int i = 0; i < v[d].size(); i++)
        {
            dp[i][0] = dp[i][1] = dp[i][2] = 0;
            if (i == 0)
            {
                int l = v[d][i],c = d - l;
                if (c - 1 > 0 and c + 1 <= m and a[l][c - 1] == 'R' and a[l][c] == 'G' and a[l][c + 1] == 'W')
                    dp[i][1] = 1;
                if (l - 1 > 0 and l + 1 <= n and a[l - 1][c] == 'R' and a[l][c] == 'G' and a[l + 1][c] == 'W')
                    dp[i][2] = 1;
            }
            else
            {
                int l = v[d][i],c = d - l;
                dp[i][0] = max(dp[i - 1][0],max(dp[i - 1][1],dp[i - 1][2]));
                ///var 0: nu pun centrat in (l,c)
                ///var 1: pun orizontal centrat in (l,c)
                ///var 2: pun vertical centrat in (l,c)
                if (c - 1 > 0 and c + 1 <= m and a[l][c - 1] == 'R' and a[l][c] == 'G' and a[l][c + 1] == 'W')
                    dp[i][1] = max(dp[i - 1][0],dp[i - 1][1]) + 1;
                if (l - 1 > 0 and l + 1 <= n and a[l - 1][c] == 'R' and a[l][c] == 'G' and a[l + 1][c] == 'W')
                    dp[i][2] = max(dp[i - 1][0],dp[i - 1][2]) + 1;
            }
        }
        int sz = v[d].size() - 1;
        //cout << d << ' ' << max(dp[sz][0],max(dp[sz][1],dp[sz][2])) << endl;
        ans += max(dp[sz][0],max(dp[sz][1],dp[sz][2]));
    }
    cout << ans;
    return 0;
}
/*
4 3
WRW
RGW
GWW
WWW
*/

Compilation message

dango_maker.cpp: In function 'int main()':
dango_maker.cpp:22:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |         for (int i = 0; i < v[d].size(); i++)
      |                         ~~^~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 0 ms 856 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 1 ms 2512 KB Output is correct
12 Correct 1 ms 2648 KB Output is correct
13 Correct 1 ms 2648 KB Output is correct
14 Correct 0 ms 2652 KB Output is correct
15 Correct 1 ms 2652 KB Output is correct
16 Correct 0 ms 2652 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 0 ms 856 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 1 ms 2512 KB Output is correct
12 Correct 1 ms 2648 KB Output is correct
13 Correct 1 ms 2648 KB Output is correct
14 Correct 0 ms 2652 KB Output is correct
15 Correct 1 ms 2652 KB Output is correct
16 Correct 0 ms 2652 KB Output is correct
17 Correct 1 ms 2652 KB Output is correct
18 Correct 1 ms 2652 KB Output is correct
19 Correct 1 ms 2904 KB Output is correct
20 Correct 1 ms 2652 KB Output is correct
21 Correct 0 ms 2652 KB Output is correct
22 Correct 0 ms 2652 KB Output is correct
23 Correct 1 ms 2652 KB Output is correct
24 Correct 1 ms 2652 KB Output is correct
25 Correct 1 ms 2652 KB Output is correct
26 Correct 0 ms 604 KB Output is correct
27 Correct 1 ms 2652 KB Output is correct
28 Correct 1 ms 2652 KB Output is correct
29 Correct 1 ms 2648 KB Output is correct
30 Correct 1 ms 2652 KB Output is correct
31 Correct 1 ms 2652 KB Output is correct
32 Correct 1 ms 2652 KB Output is correct
33 Correct 1 ms 2652 KB Output is correct
34 Correct 1 ms 2652 KB Output is correct
35 Correct 1 ms 2652 KB Output is correct
36 Correct 1 ms 2652 KB Output is correct
37 Correct 1 ms 2652 KB Output is correct
38 Correct 1 ms 2652 KB Output is correct
39 Correct 1 ms 2652 KB Output is correct
40 Correct 1 ms 2652 KB Output is correct
41 Correct 1 ms 2652 KB Output is correct
42 Correct 1 ms 2648 KB Output is correct
43 Correct 1 ms 2648 KB Output is correct
44 Correct 1 ms 2652 KB Output is correct
45 Correct 1 ms 2652 KB Output is correct
46 Correct 1 ms 2652 KB Output is correct
47 Correct 1 ms 2652 KB Output is correct
48 Correct 1 ms 2652 KB Output is correct
49 Correct 1 ms 2652 KB Output is correct
50 Correct 1 ms 2652 KB Output is correct
51 Correct 1 ms 2652 KB Output is correct
52 Correct 1 ms 2652 KB Output is correct
53 Correct 1 ms 2648 KB Output is correct

Subtask #3
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 0 ms 856 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 1 ms 2512 KB Output is correct
12 Correct 1 ms 2648 KB Output is correct
13 Correct 1 ms 2648 KB Output is correct
14 Correct 0 ms 2652 KB Output is correct
15 Correct 1 ms 2652 KB Output is correct
16 Correct 0 ms 2652 KB Output is correct
17 Correct 1 ms 2652 KB Output is correct
18 Correct 1 ms 2652 KB Output is correct
19 Correct 1 ms 2904 KB Output is correct
20 Correct 1 ms 2652 KB Output is correct
21 Correct 0 ms 2652 KB Output is correct
22 Correct 0 ms 2652 KB Output is correct
23 Correct 1 ms 2652 KB Output is correct
24 Correct 1 ms 2652 KB Output is correct
25 Correct 1 ms 2652 KB Output is correct
26 Correct 0 ms 604 KB Output is correct
27 Correct 1 ms 2652 KB Output is correct
28 Correct 1 ms 2652 KB Output is correct
29 Correct 1 ms 2648 KB Output is correct
30 Correct 1 ms 2652 KB Output is correct
31 Correct 1 ms 2652 KB Output is correct
32 Correct 1 ms 2652 KB Output is correct
33 Correct 1 ms 2652 KB Output is correct
34 Correct 1 ms 2652 KB Output is correct
35 Correct 1 ms 2652 KB Output is correct
36 Correct 1 ms 2652 KB Output is correct
37 Correct 1 ms 2652 KB Output is correct
38 Correct 1 ms 2652 KB Output is correct
39 Correct 1 ms 2652 KB Output is correct
40 Correct 1 ms 2652 KB Output is correct
41 Correct 1 ms 2652 KB Output is correct
42 Correct 1 ms 2648 KB Output is correct
43 Correct 1 ms 2648 KB Output is correct
44 Correct 1 ms 2652 KB Output is correct
45 Correct 1 ms 2652 KB Output is correct
46 Correct 1 ms 2652 KB Output is correct
47 Correct 1 ms 2652 KB Output is correct
48 Correct 1 ms 2652 KB Output is correct
49 Correct 1 ms 2652 KB Output is correct
50 Correct 1 ms 2652 KB Output is correct
51 Correct 1 ms 2652 KB Output is correct
52 Correct 1 ms 2652 KB Output is correct
53 Correct 1 ms 2648 KB Output is correct
54 Correct 1 ms 600 KB Output is correct
55 Correct 2 ms 9308 KB Output is correct
56 Correct 1 ms 2908 KB Output is correct
57 Correct 2 ms 6948 KB Output is correct
58 Correct 26 ms 11056 KB Output is correct
59 Correct 243 ms 68176 KB Output is correct
60 Correct 242 ms 67672 KB Output is correct
61 Correct 243 ms 67668 KB Output is correct
62 Correct 1 ms 2908 KB Output is correct
63 Correct 230 ms 65616 KB Output is correct
64 Correct 201 ms 67668 KB Output is correct
65 Correct 192 ms 67496 KB Output is correct
66 Correct 198 ms 67668 KB Output is correct
67 Correct 191 ms 67472 KB Output is correct
68 Correct 190 ms 67548 KB Output is correct
69 Correct 195 ms 67660 KB Output is correct
70 Correct 26 ms 10832 KB Output is correct
71 Correct 20 ms 10840 KB Output is correct
72 Correct 21 ms 10840 KB Output is correct
73 Correct 26 ms 10868 KB Output is correct
74 Correct 20 ms 10844 KB Output is correct
75 Correct 23 ms 10844 KB Output is correct
76 Correct 22 ms 10844 KB Output is correct
77 Correct 21 ms 10840 KB Output is correct
78 Correct 21 ms 10844 KB Output is correct
79 Correct 20 ms 10844 KB Output is correct
80 Correct 21 ms 11016 KB Output is correct
81 Correct 21 ms 11040 KB Output is correct
82 Correct 21 ms 10840 KB Output is correct
83 Correct 21 ms 10844 KB Output is correct
84 Correct 23 ms 11120 KB Output is correct
85 Correct 22 ms 11004 KB Output is correct
86 Correct 26 ms 10844 KB Output is correct
87 Correct 21 ms 10844 KB Output is correct
88 Correct 22 ms 10844 KB Output is correct
89 Correct 20 ms 10844 KB Output is correct
90 Correct 21 ms 10988 KB Output is correct