oj.uz

Submission #210418

# Submission time Handle Problem Language Result Execution time Memory
210418 2020-03-17T10:14:39 Z SamAnd Dango Maker (JOI18_dango_maker) C++17
100 / 100
 164 ms 18040 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 3003;

int n, m;
char a[N][N];

int dp[N][3];

int main()
{
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; ++i)
        scanf(" %s", (a[i] + 1));
    int ans = 0;
    for (int si = 1; si <= n; ++si)
    {
        memset(dp, 0, sizeof dp);
        int x = si;
        int y = 1;
        for (int i = 1; ; ++i)
        {
            dp[i][0] = max(dp[i - 1][0], max(dp[i - 1][1], dp[i - 1][2]));
            if (a[x][y - 1] == 'R' && a[x][y] == 'G' && a[x][y + 1] == 'W')
                dp[i][1] = max(dp[i - 1][0], dp[i - 1][1]) + 1;
            if (a[x - 1][y] == 'R' && a[x][y] == 'G' && a[x + 1][y] == 'W')
                dp[i][2] = max(dp[i - 1][0], dp[i - 1][2]) + 1;
            --x;
            ++y;
            if (x == 0 || y == m + 1)
            {
                ans += max(dp[i][0], max(dp[i][1], dp[i][2]));
                break;
            }
        }
    }
    for (int sj = 2; sj <= m; ++sj)
    {
        memset(dp, 0, sizeof dp);
        int x = n;
        int y = sj;
        for (int i = 1; ; ++i)
        {
            dp[i][0] = max(dp[i - 1][0], max(dp[i - 1][1], dp[i - 1][2]));
            if (a[x][y - 1] == 'R' && a[x][y] == 'G' && a[x][y + 1] == 'W')
                dp[i][1] = max(dp[i - 1][0], dp[i - 1][1]) + 1;
            if (a[x - 1][y] == 'R' && a[x][y] == 'G' && a[x + 1][y] == 'W')
                dp[i][2] = max(dp[i - 1][0], dp[i - 1][2]) + 1;
            --x;
            ++y;
            if (x == 0 || y == m + 1)
            {
                ans += max(dp[i][0], max(dp[i][1], dp[i][2]));
                break;
            }
        }
    }
    printf("%d\n", ans);
    return 0;
}

Compilation message

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

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 248 KB Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 248 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 5 ms 376 KB Output is correct
28 Correct 5 ms 376 KB Output is correct
29 Correct 5 ms 376 KB Output is correct
30 Correct 5 ms 380 KB Output is correct
31 Correct 5 ms 376 KB Output is correct
32 Correct 5 ms 376 KB Output is correct
33 Correct 5 ms 376 KB Output is correct
34 Correct 5 ms 376 KB Output is correct
35 Correct 5 ms 376 KB Output is correct
36 Correct 5 ms 376 KB Output is correct
37 Correct 5 ms 376 KB Output is correct
38 Correct 5 ms 380 KB Output is correct
39 Correct 5 ms 376 KB Output is correct
40 Correct 5 ms 376 KB Output is correct
41 Correct 5 ms 376 KB Output is correct
42 Correct 5 ms 376 KB Output is correct
43 Correct 5 ms 380 KB Output is correct
44 Correct 5 ms 376 KB Output is correct
45 Correct 5 ms 376 KB Output is correct
46 Correct 5 ms 376 KB Output is correct
47 Correct 5 ms 376 KB Output is correct
48 Correct 6 ms 376 KB Output is correct
49 Correct 5 ms 376 KB Output is correct
50 Correct 5 ms 376 KB Output is correct
51 Correct 5 ms 376 KB Output is correct
52 Correct 5 ms 376 KB Output is correct
53 Correct 5 ms 376 KB Output is correct
54 Correct 8 ms 376 KB Output is correct
55 Correct 12 ms 9208 KB Output is correct
56 Correct 8 ms 376 KB Output is correct
57 Correct 10 ms 6264 KB Output is correct
58 Correct 23 ms 4216 KB Output is correct
59 Correct 164 ms 17916 KB Output is correct
60 Correct 164 ms 17916 KB Output is correct
61 Correct 158 ms 17912 KB Output is correct
62 Correct 8 ms 376 KB Output is correct
63 Correct 156 ms 17656 KB Output is correct
64 Correct 117 ms 17912 KB Output is correct
65 Correct 113 ms 17912 KB Output is correct
66 Correct 116 ms 18040 KB Output is correct
67 Correct 110 ms 17912 KB Output is correct
68 Correct 109 ms 17916 KB Output is correct
69 Correct 110 ms 17912 KB Output is correct
70 Correct 17 ms 4216 KB Output is correct
71 Correct 17 ms 4216 KB Output is correct
72 Correct 18 ms 4216 KB Output is correct
73 Correct 17 ms 4216 KB Output is correct
74 Correct 18 ms 4216 KB Output is correct
75 Correct 17 ms 4216 KB Output is correct
76 Correct 18 ms 4216 KB Output is correct
77 Correct 17 ms 4216 KB Output is correct
78 Correct 18 ms 4216 KB Output is correct
79 Correct 17 ms 4344 KB Output is correct
80 Correct 18 ms 4216 KB Output is correct
81 Correct 18 ms 4344 KB Output is correct
82 Correct 18 ms 4216 KB Output is correct
83 Correct 18 ms 4216 KB Output is correct
84 Correct 17 ms 4216 KB Output is correct
85 Correct 18 ms 4216 KB Output is correct
86 Correct 18 ms 4216 KB Output is correct
87 Correct 18 ms 4216 KB Output is correct
88 Correct 18 ms 4216 KB Output is correct
89 Correct 18 ms 4216 KB Output is correct
90 Correct 17 ms 4216 KB Output is correct