oj.uz

답안 #537047

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
537047 2022-03-14T10:22:08 Z pavement Dango Maker (JOI18_dango_maker) C++17
100 / 100
 230 ms 18100 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
#define int long long
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define g0(a) get<0>(a)
#define g1(a) get<1>(a)
#define g2(a) get<2>(a)
#define g3(a) get<3>(a)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
using db = double;
using ll = long long;
using ld = long double;
using ii = pair<int, int>;
using iii = tuple<int, int, int>;
using iiii = tuple<int, int, int, int>;
template<class key, class value = null_type, class cmp = less<key> >
using ordered_set = tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;

int N, M, ans, dp[6005][3];
char C[3005][3005];

main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> N >> M;
	for (int i = 1; i <= N; i++)
		for (int j = 1; j <= M; j++) cin >> C[i][j];
	for (int j = 1; j <= M; j++) {
		// diagonal ends at (1, j)
		int idx = 1;
		for (int r = 1, c = j; r <= N && 1 <= c; r++, c--, idx++) {
			if (C[r][c] == 'R') {
				for (int k = 0; k <= 2; k++) {
					dp[idx][k] = dp[idx - 1][max(0ll, k - 1)];
					if (k == 0 && r + 2 <= N && C[r + 1][c] == 'G' && C[r + 2][c] == 'W') dp[idx][k] = max(dp[idx][k], dp[idx - 1][0] + 1);
					if (c + 2 <= M && C[r][c + 1] == 'G' && C[r][c + 2] == 'W') dp[idx][k] = max(dp[idx][k], dp[idx - 1][2] + 1);
				}
			} else {
				for (int k = 0; k <= 2; k++)
					dp[idx][k] = dp[idx - 1][max(0ll, k - 1)];
			}
		}
		ans += dp[idx - 1][0];
	}
	for (int i = 2; i <= N; i++) {
		// diagonal ends at (i, M)
		int idx = 1;
		for (int r = i, c = M; r <= N && 1 <= c; r++, c--, idx++) {
			if (C[r][c] == 'R') {
				for (int k = 0; k <= 2; k++) {
					dp[idx][k] = dp[idx - 1][max(0ll, k - 1)];
					if (k == 0 && r + 2 <= N && C[r + 1][c] == 'G' && C[r + 2][c] == 'W') dp[idx][k] = max(dp[idx][k], dp[idx - 1][0] + 1);
					if (c + 2 <= M && C[r][c + 1] == 'G' && C[r][c + 2] == 'W') dp[idx][k] = max(dp[idx][k], dp[idx - 1][2] + 1);
				}
			} else {
				for (int k = 0; k <= 2; k++)
					dp[idx][k] = dp[idx - 1][max(0ll, k - 1)];
			}
		}
		ans += dp[idx - 1][0];
	}
	cout << ans << '\n';
}

Compilation message

dango_maker.cpp:32:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   32 | main() {
      | ^~~~

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 336 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 336 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 0 ms 340 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 336 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 1 ms 340 KB Output is correct

Subtask #3
67.0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 336 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 336 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 0 ms 340 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 336 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 1 ms 336 KB Output is correct
55 Correct 4 ms 9044 KB Output is correct
56 Correct 1 ms 344 KB Output is correct
57 Correct 3 ms 6228 KB Output is correct
58 Correct 29 ms 4184 KB Output is correct
59 Correct 221 ms 17972 KB Output is correct
60 Correct 230 ms 18100 KB Output is correct
61 Correct 224 ms 17948 KB Output is correct
62 Correct 1 ms 340 KB Output is correct
63 Correct 214 ms 17632 KB Output is correct
64 Correct 184 ms 17928 KB Output is correct
65 Correct 186 ms 18068 KB Output is correct
66 Correct 183 ms 18032 KB Output is correct
67 Correct 165 ms 17944 KB Output is correct
68 Correct 173 ms 18024 KB Output is correct
69 Correct 172 ms 18000 KB Output is correct
70 Correct 20 ms 4212 KB Output is correct
71 Correct 22 ms 4204 KB Output is correct
72 Correct 20 ms 4268 KB Output is correct
73 Correct 19 ms 4244 KB Output is correct
74 Correct 19 ms 4216 KB Output is correct
75 Correct 20 ms 4172 KB Output is correct
76 Correct 21 ms 4168 KB Output is correct
77 Correct 21 ms 4208 KB Output is correct
78 Correct 21 ms 4208 KB Output is correct
79 Correct 21 ms 4244 KB Output is correct
80 Correct 20 ms 4184 KB Output is correct
81 Correct 19 ms 4228 KB Output is correct
82 Correct 20 ms 4216 KB Output is correct
83 Correct 20 ms 4212 KB Output is correct
84 Correct 22 ms 4348 KB Output is correct
85 Correct 20 ms 4212 KB Output is correct
86 Correct 20 ms 4224 KB Output is correct
87 Correct 24 ms 4172 KB Output is correct
88 Correct 21 ms 4196 KB Output is correct
89 Correct 19 ms 4188 KB Output is correct
90 Correct 18 ms 4248 KB Output is correct