oj.uz

Submission #99487

# Submission time Handle Problem Language Result Execution time Memory
99487 2019-03-04T10:54:48 Z mzhao Dango Maker (JOI18_dango_maker) C++11
33 / 100
 2000 ms 240260 KB 
#include <bits/stdc++.h>
using namespace std;

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

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

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

int dp[9999][4]; // left is first bit   right is second bit
bool vis[9100100];
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++) {
		char A;
		scanf("\n");
		for (int j = 0; j < C; j++) {
			scanf("%c", &A);
			if (A == 'G') G[i][j] = 1;
			if (A == 'W') G[i][j] = 2;
		}
	}
	for (int i = 0; i < R; i++) {
		for (int j = 0; j < C; j++) {
			if (i < R-2 && G[i][j] == 0 && G[i+1][j] == 1 && G[i+2][j] == 2)
				f[i][j][1] = 1;
			if (j < C-2 && G[i][j] == 0 && G[i][j+1] == 1 && G[i][j+2] == 2)
				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]) {
					dfs(0, i, j, k);
					comp(0, adj[0].back(), 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:94: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:97:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("\n");
   ~~~~~^~~~~~
dango_maker.cpp:99:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%c", &A);
    ~~~~~^~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 194 ms 214136 KB Output is correct
2 Correct 194 ms 214184 KB Output is correct
3 Correct 188 ms 214136 KB Output is correct
4 Correct 209 ms 214068 KB Output is correct
5 Correct 192 ms 214016 KB Output is correct
6 Correct 209 ms 214136 KB Output is correct
7 Correct 190 ms 214008 KB Output is correct
8 Correct 216 ms 214044 KB Output is correct
9 Correct 210 ms 214140 KB Output is correct
10 Correct 199 ms 214136 KB Output is correct
11 Correct 202 ms 214140 KB Output is correct
12 Correct 202 ms 214236 KB Output is correct
13 Correct 202 ms 214140 KB Output is correct
14 Correct 202 ms 214136 KB Output is correct
15 Correct 196 ms 214108 KB Output is correct
16 Correct 194 ms 214136 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 194 ms 214136 KB Output is correct
2 Correct 194 ms 214184 KB Output is correct
3 Correct 188 ms 214136 KB Output is correct
4 Correct 209 ms 214068 KB Output is correct
5 Correct 192 ms 214016 KB Output is correct
6 Correct 209 ms 214136 KB Output is correct
7 Correct 190 ms 214008 KB Output is correct
8 Correct 216 ms 214044 KB Output is correct
9 Correct 210 ms 214140 KB Output is correct
10 Correct 199 ms 214136 KB Output is correct
11 Correct 202 ms 214140 KB Output is correct
12 Correct 202 ms 214236 KB Output is correct
13 Correct 202 ms 214140 KB Output is correct
14 Correct 202 ms 214136 KB Output is correct
15 Correct 196 ms 214108 KB Output is correct
16 Correct 194 ms 214136 KB Output is correct
17 Correct 215 ms 214124 KB Output is correct
18 Correct 206 ms 214192 KB Output is correct
19 Correct 220 ms 214040 KB Output is correct
20 Correct 243 ms 214136 KB Output is correct
21 Correct 257 ms 214136 KB Output is correct
22 Correct 204 ms 214136 KB Output is correct
23 Correct 193 ms 214264 KB Output is correct
24 Correct 190 ms 214136 KB Output is correct
25 Correct 209 ms 214024 KB Output is correct
26 Correct 202 ms 214148 KB Output is correct
27 Correct 181 ms 214136 KB Output is correct
28 Correct 202 ms 214244 KB Output is correct
29 Correct 197 ms 214136 KB Output is correct
30 Correct 202 ms 214132 KB Output is correct
31 Correct 215 ms 214176 KB Output is correct
32 Correct 204 ms 214304 KB Output is correct
33 Correct 214 ms 214264 KB Output is correct
34 Correct 227 ms 214136 KB Output is correct
35 Correct 212 ms 214188 KB Output is correct
36 Correct 198 ms 214136 KB Output is correct
37 Correct 202 ms 214152 KB Output is correct
38 Correct 193 ms 214112 KB Output is correct
39 Correct 228 ms 214252 KB Output is correct
40 Correct 213 ms 214136 KB Output is correct
41 Correct 204 ms 214264 KB Output is correct
42 Correct 208 ms 214136 KB Output is correct
43 Correct 209 ms 214136 KB Output is correct
44 Correct 224 ms 214216 KB Output is correct
45 Correct 201 ms 214144 KB Output is correct
46 Correct 226 ms 214136 KB Output is correct
47 Correct 190 ms 214136 KB Output is correct
48 Correct 206 ms 214224 KB Output is correct
49 Correct 246 ms 214136 KB Output is correct
50 Correct 202 ms 214136 KB Output is correct
51 Correct 196 ms 214136 KB Output is correct
52 Correct 212 ms 214136 KB Output is correct
53 Correct 215 ms 214136 KB Output is correct

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 194 ms 214136 KB Output is correct
2 Correct 194 ms 214184 KB Output is correct
3 Correct 188 ms 214136 KB Output is correct
4 Correct 209 ms 214068 KB Output is correct
5 Correct 192 ms 214016 KB Output is correct
6 Correct 209 ms 214136 KB Output is correct
7 Correct 190 ms 214008 KB Output is correct
8 Correct 216 ms 214044 KB Output is correct
9 Correct 210 ms 214140 KB Output is correct
10 Correct 199 ms 214136 KB Output is correct
11 Correct 202 ms 214140 KB Output is correct
12 Correct 202 ms 214236 KB Output is correct
13 Correct 202 ms 214140 KB Output is correct
14 Correct 202 ms 214136 KB Output is correct
15 Correct 196 ms 214108 KB Output is correct
16 Correct 194 ms 214136 KB Output is correct
17 Correct 215 ms 214124 KB Output is correct
18 Correct 206 ms 214192 KB Output is correct
19 Correct 220 ms 214040 KB Output is correct
20 Correct 243 ms 214136 KB Output is correct
21 Correct 257 ms 214136 KB Output is correct
22 Correct 204 ms 214136 KB Output is correct
23 Correct 193 ms 214264 KB Output is correct
24 Correct 190 ms 214136 KB Output is correct
25 Correct 209 ms 214024 KB Output is correct
26 Correct 202 ms 214148 KB Output is correct
27 Correct 181 ms 214136 KB Output is correct
28 Correct 202 ms 214244 KB Output is correct
29 Correct 197 ms 214136 KB Output is correct
30 Correct 202 ms 214132 KB Output is correct
31 Correct 215 ms 214176 KB Output is correct
32 Correct 204 ms 214304 KB Output is correct
33 Correct 214 ms 214264 KB Output is correct
34 Correct 227 ms 214136 KB Output is correct
35 Correct 212 ms 214188 KB Output is correct
36 Correct 198 ms 214136 KB Output is correct
37 Correct 202 ms 214152 KB Output is correct
38 Correct 193 ms 214112 KB Output is correct
39 Correct 228 ms 214252 KB Output is correct
40 Correct 213 ms 214136 KB Output is correct
41 Correct 204 ms 214264 KB Output is correct
42 Correct 208 ms 214136 KB Output is correct
43 Correct 209 ms 214136 KB Output is correct
44 Correct 224 ms 214216 KB Output is correct
45 Correct 201 ms 214144 KB Output is correct
46 Correct 226 ms 214136 KB Output is correct
47 Correct 190 ms 214136 KB Output is correct
48 Correct 206 ms 214224 KB Output is correct
49 Correct 246 ms 214136 KB Output is correct
50 Correct 202 ms 214136 KB Output is correct
51 Correct 196 ms 214136 KB Output is correct
52 Correct 212 ms 214136 KB Output is correct
53 Correct 215 ms 214136 KB Output is correct
54 Correct 206 ms 214176 KB Output is correct
55 Correct 214 ms 223352 KB Output is correct
56 Correct 198 ms 214236 KB Output is correct
57 Correct 235 ms 236408 KB Output is correct
58 Execution timed out 2060 ms 240260 KB Time limit exceeded
59 Halted 0 ms 0 KB -