답안 #444340

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
444340	2021-07-13T17:26:07 Z	wind_reaper	Dango Maker (JOI18_dango_maker)	C++17	100 / 100	369 ms	123716 KB

dango_maker

#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;
using namespace chrono;

// mt19937 rng((int) std::chrono::steady_clock::now().time_since_epoch().count());
/*
template <class T> using ordered_set = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;
*/

//***************** CONSTANTS *****************



//***************** GLOBAL VARIABLES *****************

char grid[3002][3002];
int dp[3002][3002][3];

//***************** AUXILIARY STRUCTS *****************



//***************** MAIN BODY *****************

void solve(){
	int N, M;
	cin >> N >> M;

	for(int i = 1; i <= N; i++)
		for(int j = 1; j <= M; j++)
			cin >> grid[i][j];

	function<bool(int, int)> vert = [&](int i, int j)->bool{
		return grid[i][j] == 'G' && grid[i-1][j] == 'R' && grid[i+1][j] == 'W';
	};

	function<bool(int, int)> hor = [&](int i, int j)->bool{
		return grid[i][j] == 'G' && grid[i][j-1] == 'R' && grid[i][j+1] == 'W';
	};

	for(int i = 1; i <= N; i++){
		for(int j = 1; j <= M; j++){
			for(int k = 0; k < 3; k++)
				dp[i][j][0] = max(dp[i][j][0], dp[i-1][j+1][k]);

			if(vert(i, j)) dp[i][j][1] = max(dp[i-1][j+1][0], dp[i-1][j+1][1]) + 1;
			if(hor(i, j)) dp[i][j][2] = max(dp[i-1][j+1][0], dp[i-1][j+1][2]) + 1;
		}
	}

	int ans = 0;
	
	for(int i = 1; i <= N; i++)
		ans += max({dp[i][1][0], dp[i][1][1], dp[i][1][2]});

	for(int i = 2; i <= M; i++)
		ans += max({dp[N][i][0], dp[N][i][1], dp[N][i][2]});

	cout << ans << '\n';
}

//***************** *****************

int32_t main(){
	ios_base::sync_with_stdio(NULL);
	cin.tie(NULL);

	#ifdef LOCAL
		auto begin = high_resolution_clock::now();
	#endif

	int tc = 1;
	// cin >> tc; 
	for (int t = 0; t < tc; t++)
		solve();

	#ifdef LOCAL 
		auto end = high_resolution_clock::now();
		cout << fixed << setprecision(4);
		cout << "Execution Time: " << duration_cast<duration<double>>(end - begin).count() << "seconds" << endl;
	#endif

	return 0;
}

/*
If code gives a WA, check for the following : 
1. I/O format

2. Are you clearing all global variables in between tests if multitests are a thing

3. Can you definitively prove the logic
*/

Subtask #1
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	424 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	1 ms	324 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	0 ms	332 KB	Output is correct
7	Correct	1 ms	324 KB	Output is correct
8	Correct	0 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	320 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	0 ms	332 KB	Output is correct
15	Correct	0 ms	332 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct

Subtask #2
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	424 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	1 ms	324 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	0 ms	332 KB	Output is correct
7	Correct	1 ms	324 KB	Output is correct
8	Correct	0 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	320 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	0 ms	332 KB	Output is correct
15	Correct	0 ms	332 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	320 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	320 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	1 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	0 ms	332 KB	Output is correct
27	Correct	1 ms	332 KB	Output is correct
28	Correct	0 ms	332 KB	Output is correct
29	Correct	0 ms	332 KB	Output is correct
30	Correct	0 ms	332 KB	Output is correct
31	Correct	1 ms	320 KB	Output is correct
32	Correct	1 ms	332 KB	Output is correct
33	Correct	1 ms	320 KB	Output is correct
34	Correct	0 ms	332 KB	Output is correct
35	Correct	0 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	1 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	0 ms	332 KB	Output is correct
44	Correct	0 ms	332 KB	Output is correct
45	Correct	1 ms	332 KB	Output is correct
46	Correct	1 ms	328 KB	Output is correct
47	Correct	1 ms	332 KB	Output is correct
48	Correct	1 ms	332 KB	Output is correct
49	Correct	1 ms	332 KB	Output is correct
50	Correct	1 ms	332 KB	Output is correct
51	Correct	1 ms	332 KB	Output is correct
52	Correct	1 ms	332 KB	Output is correct
53	Correct	0 ms	324 KB	Output is correct

Subtask #3
67.0 / 67.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	424 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	1 ms	324 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	0 ms	332 KB	Output is correct
7	Correct	1 ms	324 KB	Output is correct
8	Correct	0 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	320 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	0 ms	332 KB	Output is correct
15	Correct	0 ms	332 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	320 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	320 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	1 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	0 ms	332 KB	Output is correct
27	Correct	1 ms	332 KB	Output is correct
28	Correct	0 ms	332 KB	Output is correct
29	Correct	0 ms	332 KB	Output is correct
30	Correct	0 ms	332 KB	Output is correct
31	Correct	1 ms	320 KB	Output is correct
32	Correct	1 ms	332 KB	Output is correct
33	Correct	1 ms	320 KB	Output is correct
34	Correct	0 ms	332 KB	Output is correct
35	Correct	0 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	1 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	0 ms	332 KB	Output is correct
44	Correct	0 ms	332 KB	Output is correct
45	Correct	1 ms	332 KB	Output is correct
46	Correct	1 ms	328 KB	Output is correct
47	Correct	1 ms	332 KB	Output is correct
48	Correct	1 ms	332 KB	Output is correct
49	Correct	1 ms	332 KB	Output is correct
50	Correct	1 ms	332 KB	Output is correct
51	Correct	1 ms	332 KB	Output is correct
52	Correct	1 ms	332 KB	Output is correct
53	Correct	0 ms	324 KB	Output is correct
54	Correct	1 ms	332 KB	Output is correct
55	Correct	11 ms	21324 KB	Output is correct
56	Correct	1 ms	460 KB	Output is correct
57	Correct	9 ms	14412 KB	Output is correct
58	Correct	44 ms	20004 KB	Output is correct
59	Correct	369 ms	123648 KB	Output is correct
60	Correct	361 ms	123716 KB	Output is correct
61	Correct	357 ms	123648 KB	Output is correct
62	Correct	1 ms	332 KB	Output is correct
63	Correct	347 ms	123308 KB	Output is correct
64	Correct	288 ms	123600 KB	Output is correct
65	Correct	284 ms	123588 KB	Output is correct
66	Correct	284 ms	123620 KB	Output is correct
67	Correct	282 ms	123652 KB	Output is correct
68	Correct	289 ms	123636 KB	Output is correct
69	Correct	292 ms	123584 KB	Output is correct
70	Correct	35 ms	19980 KB	Output is correct
71	Correct	35 ms	19920 KB	Output is correct
72	Correct	35 ms	19932 KB	Output is correct
73	Correct	35 ms	19908 KB	Output is correct
74	Correct	36 ms	20008 KB	Output is correct
75	Correct	35 ms	19924 KB	Output is correct
76	Correct	36 ms	20004 KB	Output is correct
77	Correct	36 ms	19908 KB	Output is correct
78	Correct	36 ms	19892 KB	Output is correct
79	Correct	35 ms	20008 KB	Output is correct
80	Correct	35 ms	19972 KB	Output is correct
81	Correct	36 ms	19936 KB	Output is correct
82	Correct	36 ms	19924 KB	Output is correct
83	Correct	35 ms	19916 KB	Output is correct
84	Correct	36 ms	19900 KB	Output is correct
85	Correct	35 ms	19908 KB	Output is correct
86	Correct	35 ms	19976 KB	Output is correct
87	Correct	36 ms	19916 KB	Output is correct
88	Correct	36 ms	20000 KB	Output is correct
89	Correct	35 ms	19948 KB	Output is correct
90	Correct	40 ms	19948 KB	Output is correct

답안 #444340

Compilation message

Subtask #1 13.0 / 13.0

Subtask #2 20.0 / 20.0

Subtask #3 67.0 / 67.0

Subtask #1
13.0 / 13.0

Subtask #2
20.0 / 20.0

Subtask #3
67.0 / 67.0