oj.uz

Submission #464200

# Submission time Handle Problem Language Result Execution time Memory
464200 2021-08-12T13:42:15 Z TeaTime Dango Maker (JOI18_dango_maker) C++17
100 / 100
 366 ms 71112 KB 
//#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <unordered_map>

using namespace std;

#define fastInp cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);

typedef long long ll;
typedef long double ld;

const ll SZ = 3010, INF = 1e9, LG = 20;
char grid[SZ][SZ];
short dp[SZ][SZ][3];
ll n, m;

bool good(int x, int y, int dir) {
    if (dir == 0) {
        if (grid[x][y] == 'G' && (x - 1 >= 0 && grid[x - 1][y] == 'R') && (x + 1 < n && grid[x + 1][y] == 'W')) return 1;
        return 0;
    }
    if (dir == 1) {
        if (grid[x][y] == 'G' && (y - 1 >= 0 && grid[x][y - 1] == 'R') && (y + 1 < m && grid[x][y + 1] == 'W')) return 1;
        return 0;
    }
}
signed main() {
    fastInp;

    cin >> n >> m;

    for (int i = 0; i < n; i++) {
        string s;
        cin >> s;
        for (int j = 0; j < m; j++) grid[i][j] = s[j];
    }

    ll ans = 0;
    for (int j = 0; j < m; j++) {
        for (int i = n - 1; i >= 0; i--) {
            ll svd1 = 0, svd2 = 0, svd0 = 0;
            if (i < n - 1 && j > 0) {
                dp[i][j][0] = svd0 = dp[i + 1][j - 1][0];
                dp[i][j][1] = svd1 = dp[i + 1][j - 1][1];
                dp[i][j][2] = svd2 = dp[i + 1][j - 1][2];
            }
            if (good(i, j, 0)) {
                dp[i][j][1] = max(svd0 + 1, svd1 + 1);
            }
            if (good(i, j, 1)) {
                dp[i][j][2] = max(svd0 + 1, svd2 + 1);
            }
            dp[i][j][0] = max(max(svd0, svd1), svd2);

            if (!(i - 1 >= 0 && j + 1 < m)) {
                ans += max(dp[i][j][2], max(dp[i][j][0], dp[i][j][1]));
            }
        }
    }

    cout << ans;

    return 0;
}

/*
3 4
RGWR
GRGG
RGWW

4 4
RGWR
GRRG
WGGW
WWWR

5 5
RGRGW
GRRGW
WGGWR
RWRGW
RGWGW
*/

Compilation message

dango_maker.cpp: In function 'bool good(int, int, int)':
dango_maker.cpp:33:1: warning: control reaches end of non-void function [-Wreturn-type]
   33 | }
      | ^

Subtask #1
13.0 / 13.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 328 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 0 ms 324 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 0 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 324 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 0 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 0 ms 332 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 1 ms 332 KB Output is correct
43 Correct 1 ms 332 KB Output is correct
44 Correct 1 ms 332 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 1 ms 344 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 0 ms 332 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 1 ms 324 KB Output is correct
52 Correct 1 ms 332 KB Output is correct
53 Correct 1 ms 332 KB Output is correct
54 Correct 1 ms 332 KB Output is correct
55 Correct 9 ms 21196 KB Output is correct
56 Correct 1 ms 332 KB Output is correct
57 Correct 8 ms 14364 KB Output is correct
58 Correct 35 ms 14144 KB Output is correct
59 Correct 349 ms 65784 KB Output is correct
60 Correct 353 ms 65744 KB Output is correct
61 Correct 327 ms 65744 KB Output is correct
62 Correct 1 ms 332 KB Output is correct
63 Correct 366 ms 65648 KB Output is correct
64 Correct 263 ms 65824 KB Output is correct
65 Correct 270 ms 70976 KB Output is correct
66 Correct 256 ms 71028 KB Output is correct
67 Correct 261 ms 70972 KB Output is correct
68 Correct 271 ms 71008 KB Output is correct
69 Correct 260 ms 71112 KB Output is correct
70 Correct 36 ms 14148 KB Output is correct
71 Correct 32 ms 14044 KB Output is correct
72 Correct 27 ms 14088 KB Output is correct
73 Correct 26 ms 14124 KB Output is correct
74 Correct 27 ms 14072 KB Output is correct
75 Correct 27 ms 14064 KB Output is correct
76 Correct 35 ms 14068 KB Output is correct
77 Correct 36 ms 14048 KB Output is correct
78 Correct 29 ms 14128 KB Output is correct
79 Correct 27 ms 14096 KB Output is correct
80 Correct 27 ms 14104 KB Output is correct
81 Correct 26 ms 14144 KB Output is correct
82 Correct 27 ms 14148 KB Output is correct
83 Correct 27 ms 14164 KB Output is correct
84 Correct 37 ms 14064 KB Output is correct
85 Correct 30 ms 14136 KB Output is correct
86 Correct 27 ms 14056 KB Output is correct
87 Correct 33 ms 14060 KB Output is correct
88 Correct 36 ms 14092 KB Output is correct
89 Correct 32 ms 14120 KB Output is correct
90 Correct 41 ms 14064 KB Output is correct