답안 #99502 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
99502	2019-03-04T11:20:04 Z	mzhao	Dango Maker (JOI18_dango_maker)	C++11	33 / 100	1119 ms	263168 KB

dango_maker

#include <bits/stdc++.h>
using namespace std;

#define MAGIC 1500000

int R, C, ans;
char G[3001][3001];
bool f[3001][3001][2]; // 0 is horizontal, 1 is vertical
int id[3001][3001][2];

int nn;
vector<int> adj[MAGIC];

void dfs(int p, int x, int y, int z) {
	if (id[x][y][z]) {
		if (p) adj[p].push_back(id[x][y][z]);
		return;
	}
	id[x][y][z] = ++nn;
	if (p) adj[p].push_back(id[x][y][z]);
	if (z) {
		if (f[x][y][0]) dfs(id[x][y][z], x, y, 0);
		if (y > 0 && f[x+1][y-1][0]) dfs(id[x][y][z], x+1, y-1, 0);
		if (y > 1 && f[x+2][y-2][0]) dfs(id[x][y][z], x+2, y-2, 0);
	} else {
		if (f[x][y][1]) dfs(id[x][y][z], x, y, 1);
		if (x > 0 && f[x-1][y+1][1]) dfs(id[x][y][z], x-1, y+1, 1);
		if (x > 1 && f[x-2][y+2][1]) dfs(id[x][y][z], x-2, y+2, 1);
	}
}

int dp[3001][4]; // left is first bit   right is second bit
bool vis[MAGIC];
vector<int> ladj, radj;

void comp(int d, int l, int r) {
	vis[l] = vis[r] = 1;
	ladj.clear(); radj.clear();
	for (int i : adj[l]) if (!vis[i]) ladj.push_back(i);
	for (int i : adj[r]) if (!vis[i]) radj.push_back(i);
	if (!ladj.size() && !radj.size()) {
		if (l) {
			dp[d][0] = 0;
			dp[d][1] = 1;
		}
		if (r) {
			dp[d][2] = 1;
			dp[d][3] = 2;
		}
		return;
	}
	if (l && r && ladj.size() == 1 && radj.size() == 1) {
		comp(d+1, ladj[0], 0);
		dp[d][0] = max(dp[d+1][0], dp[d+1][1]);
		dp[d][1] = dp[d+1][0]+1;
		dp[d][2] = dp[d+1][0]+1;
		dp[d][3] = dp[d+1][0]+2;
	} else if (l && r && ladj.size() == 2 && radj.size() == 1) {
		if (ladj[0] == radj[0]) swap(ladj[0], ladj[1]);
		comp(d+1, ladj[0], ladj[1]);
		dp[d][0] = max(max(dp[d+1][0], dp[d+1][1]), max(dp[d+1][2], dp[d+1][3]));
		dp[d][1] = dp[d+1][0]+1;
		dp[d][2] = max(dp[d+1][0], dp[d+1][1])+1;
		dp[d][3] = dp[d+1][0]+2;
	} else if (l && r && radj.size() == 2 && ladj.size() == 1) {
		if (radj[1] == ladj[0]) swap(radj[0], radj[1]);
		comp(d+1, radj[0], radj[1]);
		dp[d][0] = max(max(dp[d+1][0], dp[d+1][1]), max(dp[d+1][2], dp[d+1][3]));
		dp[d][1] = max(dp[d+1][0], dp[d+1][2])+1;
		dp[d][2] = dp[d+1][0]+1;
		dp[d][3] = dp[d+1][0]+2;
	} else if (l && r && ladj.size() == 0) {
		comp(d+1, radj[0], 0);
		dp[d][0] = max(dp[d+1][0], dp[d+1][1]);
		dp[d][1] = dp[d][0]+1;
		dp[d][2] = dp[d+1][0]+1;
		dp[d][3] = dp[d+1][0]+2;
	} else if (l && r && radj.size() == 0) {
		comp(d+1, ladj[0], 0);
		dp[d][0] = max(dp[d+1][0], dp[d+1][1]);
		dp[d][1] = dp[d+1][0]+1;
		dp[d][2] = dp[d][0]+1;
		dp[d][3] = dp[d+1][0]+2;
	} else if (l && !r && ladj.size() == 2) {
		comp(d+1, ladj[0], ladj[1]);
		dp[d][0] = max(max(dp[d+1][0], dp[d+1][1]), max(dp[d+1][2], dp[d+1][3]));
		dp[d][1] = dp[d+1][0]+1;
	} else if (l && !r && ladj.size() == 1) {
		comp(d+1, ladj[0], 0);
		dp[d][0] = max(dp[d+1][0], dp[d+1][1]);
		dp[d][1] = dp[d+1][0]+1;
	}
}

int main() {
	scanf("%d%d", &R, &C);
	for (int i = 0; i < R; i++) {
		scanf("\n");
		for (int j = 0; j < C; j++) {
			scanf("%c", &G[i][j]);
		}
	}
	for (int i = 0; i < R; i++) {
		for (int j = 0; j < C; j++) {
			if (i < R-2 && G[i][j] == 'R' && G[i+1][j] == 'G' && G[i+2][j] == 'W')
				f[i][j][1] = 1;
			if (j < C-2 && G[i][j] == 'R' && G[i][j+1] == 'G' && G[i][j+2] == 'W')
				f[i][j][0] = 1;
		}
	}
	for (int i = 0; i < R; i++) {
		for (int j = 0; j < C; j++) {
			for (int k = 0; k < 2; k++) {
				if (!id[i][j][k] && f[i][j][k]) {
					int cur = nn+1;
					dfs(0, i, j, k);
					assert(nn < MAGIC);
					comp(0, cur, 0);
					ans += max(dp[0][0], dp[0][1]);
				}
			}
		}
	}
	printf("%d\n", ans);
}

Compilation message

dango_maker.cpp: In function 'int main()':
dango_maker.cpp:96:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &R, &C);
  ~~~~~^~~~~~~~~~~~~~~~
dango_maker.cpp:98:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("\n");
   ~~~~~^~~~~~
dango_maker.cpp:100:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%c", &G[i][j]);
    ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	35 ms	35576 KB	Output is correct
2	Correct	42 ms	35576 KB	Output is correct
3	Correct	34 ms	35648 KB	Output is correct
4	Correct	36 ms	35576 KB	Output is correct
5	Correct	34 ms	35576 KB	Output is correct
6	Correct	34 ms	35576 KB	Output is correct
7	Correct	38 ms	35576 KB	Output is correct
8	Correct	36 ms	35576 KB	Output is correct
9	Correct	40 ms	35576 KB	Output is correct
10	Correct	36 ms	35632 KB	Output is correct
11	Correct	36 ms	35608 KB	Output is correct
12	Correct	41 ms	35576 KB	Output is correct
13	Correct	37 ms	35704 KB	Output is correct
14	Correct	35 ms	35704 KB	Output is correct
15	Correct	41 ms	35576 KB	Output is correct
16	Correct	34 ms	35624 KB	Output is correct

Subtask #2
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	35 ms	35576 KB	Output is correct
2	Correct	42 ms	35576 KB	Output is correct
3	Correct	34 ms	35648 KB	Output is correct
4	Correct	36 ms	35576 KB	Output is correct
5	Correct	34 ms	35576 KB	Output is correct
6	Correct	34 ms	35576 KB	Output is correct
7	Correct	38 ms	35576 KB	Output is correct
8	Correct	36 ms	35576 KB	Output is correct
9	Correct	40 ms	35576 KB	Output is correct
10	Correct	36 ms	35632 KB	Output is correct
11	Correct	36 ms	35608 KB	Output is correct
12	Correct	41 ms	35576 KB	Output is correct
13	Correct	37 ms	35704 KB	Output is correct
14	Correct	35 ms	35704 KB	Output is correct
15	Correct	41 ms	35576 KB	Output is correct
16	Correct	34 ms	35624 KB	Output is correct
17	Correct	36 ms	35704 KB	Output is correct
18	Correct	41 ms	35576 KB	Output is correct
19	Correct	39 ms	35620 KB	Output is correct
20	Correct	39 ms	35712 KB	Output is correct
21	Correct	69 ms	35704 KB	Output is correct
22	Correct	39 ms	35628 KB	Output is correct
23	Correct	34 ms	35584 KB	Output is correct
24	Correct	34 ms	35584 KB	Output is correct
25	Correct	34 ms	35584 KB	Output is correct
26	Correct	45 ms	35576 KB	Output is correct
27	Correct	39 ms	35704 KB	Output is correct
28	Correct	34 ms	35712 KB	Output is correct
29	Correct	42 ms	35704 KB	Output is correct
30	Correct	41 ms	35576 KB	Output is correct
31	Correct	36 ms	35576 KB	Output is correct
32	Correct	35 ms	35576 KB	Output is correct
33	Correct	36 ms	35712 KB	Output is correct
34	Correct	37 ms	35712 KB	Output is correct
35	Correct	42 ms	35704 KB	Output is correct
36	Correct	38 ms	35704 KB	Output is correct
37	Correct	36 ms	35712 KB	Output is correct
38	Correct	35 ms	35708 KB	Output is correct
39	Correct	34 ms	35712 KB	Output is correct
40	Correct	35 ms	35704 KB	Output is correct
41	Correct	38 ms	35704 KB	Output is correct
42	Correct	36 ms	35704 KB	Output is correct
43	Correct	42 ms	35704 KB	Output is correct
44	Correct	36 ms	35676 KB	Output is correct
45	Correct	37 ms	35712 KB	Output is correct
46	Correct	35 ms	35704 KB	Output is correct
47	Correct	49 ms	35704 KB	Output is correct
48	Correct	35 ms	35712 KB	Output is correct
49	Correct	36 ms	35676 KB	Output is correct
50	Correct	39 ms	35684 KB	Output is correct
51	Correct	35 ms	35704 KB	Output is correct
52	Correct	35 ms	35712 KB	Output is correct
53	Correct	36 ms	35716 KB	Output is correct

Subtask #3
0 / 67.0

#	결과	실행 시간	메모리	Grader output
1	Correct	35 ms	35576 KB	Output is correct
2	Correct	42 ms	35576 KB	Output is correct
3	Correct	34 ms	35648 KB	Output is correct
4	Correct	36 ms	35576 KB	Output is correct
5	Correct	34 ms	35576 KB	Output is correct
6	Correct	34 ms	35576 KB	Output is correct
7	Correct	38 ms	35576 KB	Output is correct
8	Correct	36 ms	35576 KB	Output is correct
9	Correct	40 ms	35576 KB	Output is correct
10	Correct	36 ms	35632 KB	Output is correct
11	Correct	36 ms	35608 KB	Output is correct
12	Correct	41 ms	35576 KB	Output is correct
13	Correct	37 ms	35704 KB	Output is correct
14	Correct	35 ms	35704 KB	Output is correct
15	Correct	41 ms	35576 KB	Output is correct
16	Correct	34 ms	35624 KB	Output is correct
17	Correct	36 ms	35704 KB	Output is correct
18	Correct	41 ms	35576 KB	Output is correct
19	Correct	39 ms	35620 KB	Output is correct
20	Correct	39 ms	35712 KB	Output is correct
21	Correct	69 ms	35704 KB	Output is correct
22	Correct	39 ms	35628 KB	Output is correct
23	Correct	34 ms	35584 KB	Output is correct
24	Correct	34 ms	35584 KB	Output is correct
25	Correct	34 ms	35584 KB	Output is correct
26	Correct	45 ms	35576 KB	Output is correct
27	Correct	39 ms	35704 KB	Output is correct
28	Correct	34 ms	35712 KB	Output is correct
29	Correct	42 ms	35704 KB	Output is correct
30	Correct	41 ms	35576 KB	Output is correct
31	Correct	36 ms	35576 KB	Output is correct
32	Correct	35 ms	35576 KB	Output is correct
33	Correct	36 ms	35712 KB	Output is correct
34	Correct	37 ms	35712 KB	Output is correct
35	Correct	42 ms	35704 KB	Output is correct
36	Correct	38 ms	35704 KB	Output is correct
37	Correct	36 ms	35712 KB	Output is correct
38	Correct	35 ms	35708 KB	Output is correct
39	Correct	34 ms	35712 KB	Output is correct
40	Correct	35 ms	35704 KB	Output is correct
41	Correct	38 ms	35704 KB	Output is correct
42	Correct	36 ms	35704 KB	Output is correct
43	Correct	42 ms	35704 KB	Output is correct
44	Correct	36 ms	35676 KB	Output is correct
45	Correct	37 ms	35712 KB	Output is correct
46	Correct	35 ms	35704 KB	Output is correct
47	Correct	49 ms	35704 KB	Output is correct
48	Correct	35 ms	35712 KB	Output is correct
49	Correct	36 ms	35676 KB	Output is correct
50	Correct	39 ms	35684 KB	Output is correct
51	Correct	35 ms	35704 KB	Output is correct
52	Correct	35 ms	35712 KB	Output is correct
53	Correct	36 ms	35716 KB	Output is correct
54	Correct	42 ms	35580 KB	Output is correct
55	Correct	50 ms	45408 KB	Output is correct
56	Correct	38 ms	35712 KB	Output is correct
57	Correct	55 ms	55648 KB	Output is correct
58	Correct	113 ms	56868 KB	Output is correct
59	Correct	658 ms	139440 KB	Output is correct
60	Correct	618 ms	139588 KB	Output is correct
61	Correct	650 ms	139488 KB	Output is correct
62	Correct	38 ms	35584 KB	Output is correct
63	Correct	628 ms	139308 KB	Output is correct
64	Runtime error	1119 ms	263168 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
65	Halted	0 ms	0 KB	-

답안 #99502

Compilation message

Subtask #1 13.0 / 13.0

Subtask #2 20.0 / 20.0

Subtask #3 0 / 67.0

Subtask #1
13.0 / 13.0

Subtask #2
20.0 / 20.0

Subtask #3
0 / 67.0