oj.uz

Submission #667603

# Submission time Handle Problem Language Result Execution time Memory
667603 2022-12-01T19:01:55 Z AmirAli_H1 Dango Maker (JOI18_dango_maker) C++17
33 / 100
 911 ms 262144 KB 
// In the name of Allah
 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long int	ll;
typedef long double	ld;
typedef pair<int, int>	pii;
typedef pair<ll, ll>	pll;
 
#define all(x)		(x).begin(),(x).end()
#define len(x)		((ll) (x).size())
#define F		first
#define S		second
#define pb		push_back
#define sep             ' '
#define endl            '\n'
#define Mp		make_pair
#define debug(x)	cerr << #x << ": " <<  x << endl;
#define kill(x)		cout << x << '\n', exit(0);
#define set_dec(x)	cout << fixed << setprecision(x);
#define file_io(x,y)	freopen(x, "r", stdin); freopen(y, "w", stdout);
 
int n, m;
const int maxn = 3e3 + 5;
const int maxs = 9e6 + 5;
const int maxc = 6e6 + 5;
string s[maxn];
int arr[maxs][2];
vector<pair<pii, bool>> V;
bitset<maxc> mark, c4;
int dp[maxc][5];
vector<int> val; int ind[8];
 
int GI(int i, int j) {
	return i * m + j;
}

void dfs(int v, int p = -1) {
	mark[v] = 1;
	
	for (int i : val) {
		int b1 = (bool) (i & 1); dp[v][ind[i]] += b1;
	}
	
	int i = V[v].F.F, j = V[v].F.S; bool f = V[v].S;
	if (f == 0) {
		for (int j1 : {j, j + 1, j + 2}) {
			if (arr[GI(i, j1)][1] != -1) {
				int u = arr[GI(i, j1)][1];
				if (!mark[u]) {
					dfs(u, v);
					for (int i : val) {
						int b1 = (bool) (i & 1), b2 = (bool) (i & 2), b3 = (bool) (i & 4);
						int val0 = b1 * 2 + b2 * 4, val1 = 1 + b1 * 2 + b2 * 4;
						if (b1 || (c4[u] && b3)) {
							if (ind[val0] != -1) {
								dp[v][ind[i]] += dp[u][ind[val0]];
							}
						}
						else {
							if (ind[val0] != -1 && ind[val1] != -1) {
								dp[v][ind[i]] += max(dp[u][ind[val0]], dp[u][ind[val1]]);
							}
							else if (ind[val0] != -1) {
								dp[v][ind[i]] += dp[u][ind[val0]];
							}
							else if (ind[val1] != -1) {
								dp[v][ind[i]] += dp[u][ind[val1]];
							}
						}
					}
				}
				else if (u != p) {
					c4[v] = 1;
				}
			}
		}
	}
	else {
		for (int i1 : {i, i + 1, i + 2}) {
			if (arr[GI(i1, j)][0] != -1) {
				int u = arr[GI(i1, j)][0];
				if (!mark[u]) {
					dfs(u, v);
					for (int i : val) {
						int b1 = (bool) (i & 1), b2 = (bool) (i & 2), b3 = (bool) (i & 4);
						int val0 = b1 * 2 + b2 * 4, val1 = 1 + b1 * 2 + b2 * 4;
						if (b1 || (c4[u] && b3)) {
							if (ind[val0] != -1) {
								dp[v][ind[i]] += dp[u][ind[val0]];
							}
						}
						else {
							if (ind[val0] != -1 && ind[val1] != -1) {
								dp[v][ind[i]] += max(dp[u][ind[val0]], dp[u][ind[val1]]);
							}
							else if (ind[val0] != -1) {
								dp[v][ind[i]] += dp[u][ind[val0]];
							}
							else if (ind[val1] != -1) {
								dp[v][ind[i]] += dp[u][ind[val1]];
							}
						}
					}
				}
				else if (u != p) {
					c4[v] = 1;
				}
			}
		}
	}
}
 
int main() {
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	
	fill(ind, ind + 8, -1);
	for (int i = 0; i < 8; i++) {
		int b1 = (bool) (i & 1), b2 = (bool) (i & 2), b3 = (bool) (i & 4);
		if ((b1 && b2) || (b2 && b3)) continue;
		ind[i] = len(val);
		val.pb(i);
	}
	
	cin >> n >> m;
	for (int i = 0; i < n; i++) cin >> s[i];
	
	for (int i = 0; i < n * m; i++) {
		arr[i][0] = -1; arr[i][1] = -1;
	}
	
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m - 2; j++) {
			if (s[i][j] == 'R' && s[i][j + 1] == 'G' && s[i][j + 2] == 'W') {
				for (int j1 : {j, j + 1, j + 2}) {
					arr[GI(i, j1)][0] = len(V);
				}
				V.pb(Mp(Mp(i, j), 0));
			}
		}
	}
	
	for (int i = 0; i < n - 2; i++) {
		for (int j = 0; j < m; j++) {
			if (s[i][j] == 'R' && s[i + 1][j] == 'G' && s[i + 2][j] == 'W') {
				for (int i1 : {i, i + 1, i + 2}) {
					arr[GI(i1, j)][1] = len(V);
				}
				V.pb(Mp(Mp(i, j), 1));
			}
		}
	}
	
	int output = 0;
	for (int i = 0; i < len(V); i++) {
		if (!mark[i]) {
			dfs(i);
			output += max(dp[i][0], dp[i][1]);
		}
	}
	
	cout << output << endl;
	
	return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 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 1 ms 340 KB Output is correct
9 Correct 1 ms 432 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 436 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 340 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 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 1 ms 340 KB Output is correct
9 Correct 1 ms 432 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 436 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 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 1 ms 428 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 428 KB Output is correct
26 Correct 1 ms 432 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 432 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 432 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 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 436 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 0 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 432 KB Output is correct
44 Correct 1 ms 428 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 1 ms 432 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 432 KB Output is correct
52 Correct 1 ms 432 KB Output is correct
53 Correct 1 ms 340 KB Output is correct

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 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 1 ms 340 KB Output is correct
9 Correct 1 ms 432 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 436 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 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 1 ms 428 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 428 KB Output is correct
26 Correct 1 ms 432 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 432 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 432 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 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 436 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 0 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 432 KB Output is correct
44 Correct 1 ms 428 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 1 ms 432 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 432 KB Output is correct
52 Correct 1 ms 432 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 1 ms 468 KB Output is correct
55 Correct 1 ms 468 KB Output is correct
56 Correct 1 ms 724 KB Output is correct
57 Correct 1 ms 724 KB Output is correct
58 Correct 27 ms 12920 KB Output is correct
59 Correct 231 ms 110576 KB Output is correct
60 Correct 224 ms 110616 KB Output is correct
61 Correct 229 ms 110508 KB Output is correct
62 Correct 1 ms 468 KB Output is correct
63 Correct 217 ms 107068 KB Output is correct
64 Runtime error 911 ms 262144 KB Execution killed with signal 9
65 Halted 0 ms 0 KB -