oj.uz

Submission #204079

# Submission time Handle Problem Language Result Execution time Memory
204079 2020-02-24T09:17:06 Z Kastanda Dango Maker (JOI18_dango_maker) C++11
100 / 100
 247 ms 9848 KB 
// In The Name Of The Queen
#include<bits/stdc++.h>
using namespace std;
const int N = 3003;
int n, m, cnt, dp[N][2];
bool M[N][N];
char S[N][N];
inline bool Horz(int i, int j)
{
    if (M[i][j] || M[i][j + 1] || M[i][j + 2])
        return 0;
    return (S[i][j] == 'R' && S[i][j + 1] == 'G' && S[i][j + 2] == 'W');
}
inline bool Vert(int i, int j)
{
    if (M[i][j] || M[i + 1][j] || M[i + 2][j])
        return 0;
    return (S[i][j] == 'R' && S[i + 1][j] == 'G' && S[i + 2][j] == 'W');
}
inline void MakeHorz(int i, int j)
{
    M[i][j] = M[i][j + 1] = M[i][j + 2] = 1;
}
inline void MakeVert(int i, int j)
{
    M[i][j] = M[i + 1][j] = M[i + 2][j] = 1;
}
int main()
{
    scanf("%d%d", &n, &m);
    for (int i = 0; i < n; i ++)
        scanf("%s", &S[i]);
    for (int d = 0; d < n + m - 1; d ++)
    {
        int l = max(d - m + 1, 0);
        int r = min(d, n - 1);

        memset(dp, 0, sizeof(dp));
        for (int i = l; i <= r; i ++)
        {
            dp[i][0] = max((i > 0 ? dp[i - 1][0] : 0), (i > 1 ? dp[i - 2][1] : 0));
            if (Horz(i, d - i))
                dp[i][0] = max(dp[i][0], (i > 0 ? dp[i - 1][0] : 0) + 1);
            dp[i][1] = max(dp[i][0], (i > 0 ? dp[i - 1][1] : 0));
            if (Vert(i, d - i))
                dp[i][1] = max(dp[i][1], (i > 0 ? dp[i - 1][1] : 0) + 1);
        }
        cnt += dp[r][1];
    }
    return !printf("%d\n", cnt);
}

Compilation message

dango_maker.cpp: In function 'int main()':
dango_maker.cpp:32:26: warning: format '%s' expects argument of type 'char*', but argument 2 has type 'char (*)[3003]' [-Wformat=]
         scanf("%s", &S[i]);
                     ~~~~~^
dango_maker.cpp:30: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:32:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%s", &S[i]);
         ~~~~~^~~~~~~~~~~~~

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 380 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 372 KB Output is correct
16 Correct 6 ms 376 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 380 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 372 KB Output is correct
16 Correct 6 ms 376 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 380 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 380 KB Output is correct
30 Correct 5 ms 376 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 376 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 376 KB Output is correct
44 Correct 5 ms 380 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 5 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 380 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 372 KB Output is correct
16 Correct 6 ms 376 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 380 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 380 KB Output is correct
30 Correct 5 ms 376 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 376 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 376 KB Output is correct
44 Correct 5 ms 380 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 5 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 7 ms 376 KB Output is correct
55 Correct 14 ms 9208 KB Output is correct
56 Correct 7 ms 376 KB Output is correct
57 Correct 12 ms 6264 KB Output is correct
58 Correct 33 ms 4348 KB Output is correct
59 Correct 241 ms 9720 KB Output is correct
60 Correct 235 ms 9720 KB Output is correct
61 Correct 247 ms 9848 KB Output is correct
62 Correct 7 ms 376 KB Output is correct
63 Correct 231 ms 9848 KB Output is correct
64 Correct 205 ms 9720 KB Output is correct
65 Correct 199 ms 9720 KB Output is correct
66 Correct 204 ms 9768 KB Output is correct
67 Correct 192 ms 9720 KB Output is correct
68 Correct 198 ms 9720 KB Output is correct
69 Correct 189 ms 9720 KB Output is correct
70 Correct 25 ms 4216 KB Output is correct
71 Correct 23 ms 4216 KB Output is correct
72 Correct 28 ms 4216 KB Output is correct
73 Correct 23 ms 4344 KB Output is correct
74 Correct 24 ms 4216 KB Output is correct
75 Correct 23 ms 4216 KB Output is correct
76 Correct 24 ms 4216 KB Output is correct
77 Correct 23 ms 4216 KB Output is correct
78 Correct 25 ms 4216 KB Output is correct
79 Correct 23 ms 4216 KB Output is correct
80 Correct 23 ms 4216 KB Output is correct
81 Correct 24 ms 4216 KB Output is correct
82 Correct 24 ms 4216 KB Output is correct
83 Correct 23 ms 4216 KB Output is correct
84 Correct 24 ms 4216 KB Output is correct
85 Correct 23 ms 4344 KB Output is correct
86 Correct 23 ms 4344 KB Output is correct
87 Correct 26 ms 4224 KB Output is correct
88 Correct 23 ms 4216 KB Output is correct
89 Correct 24 ms 4344 KB Output is correct
90 Correct 24 ms 4344 KB Output is correct