oj.uz

Submission #667577

# Submission time Handle Problem Language Result Execution time Memory
667577 2022-12-01T18:03:15 Z AmirAli_H1 Dango Maker (JOI18_dango_maker) C++17
33 / 100
 335 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 = 5e6 + 5;
string s[maxn];
int cntv = 0;
int arr[maxs];
int adj[maxc][3]; short ind[maxc];
bitset<maxc> mark, c4;
int dp[maxc][5];
vector<int> val; int id[8];
 
int GI(int i, int j) {
	return i * m + j;
}
 
void dfs(int v, int p = -1) {
	mark[v] = 1;
	vector<int> vc;
	for (int i = 0; i < ind[v]; i++) {
		int u = adj[v][i];
		if (!mark[u]) {
			dfs(u, v);
			vc.pb(u);
		}
		else if (u != p) {
			c4[v] = 1;
		}
	}
	for (int i : val) {
		int b1 = (bool) (i & 1), b2 = (bool) (i & 2), b3 = (bool) (i & 4);
		dp[v][id[i]] += b1;
		for (int u : vc) {
			int val0 = b1 * 2 + b2 * 4, val1 = 1 + b1 * 2 + b2 * 4;
			if (b1 || (c4[u] && b3)) {
				if (id[val0] != -1) {
					dp[v][id[i]] += dp[u][id[val0]];
				}
			}
			else {
				if (id[val0] != -1 && id[val1] != -1) {
					dp[v][id[i]] += max(dp[u][id[val0]], dp[u][id[val1]]);
				}
				else if (id[val0] != -1) {
					dp[v][id[i]] += dp[u][id[val0]];
				}
				else if (id[val1] != -1) {
					dp[v][id[i]] += dp[u][id[val1]];
				}
			}
		}
	}
	vc.clear();
}
 
int main() {
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	
	fill(id, id + 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;
		id[i] = len(val);
		val.pb(i);
	}
	
	cin >> n >> m;
	for (int i = 0; i < n; i++) cin >> s[i];
	
	fill(arr, arr + maxs, -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}) {
					if (arr[GI(i, j1)] != -1) {
						int v1 = arr[GI(i, j1)], v2 = cntv;
						adj[v1][ind[v1]++] = v2; adj[v2][ind[v2]++] = v1;
					}
					else arr[GI(i, j1)] = cntv;
				}
				cntv++;
			}
		}
	}
	
	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}) {
					if (arr[GI(i1, j)] != -1) {
						int v1 = arr[GI(i1, j)], v2 = cntv;
						adj[v1][ind[v1]++] = v2; adj[v2][ind[v2]++] = v1;
					}
					else arr[GI(i1, j)] = cntv;
				}
				cntv++;
			}
		}
	}
	
	int output = 0;
	for (int i = 0; i < cntv; i++) {
		if (!mark[i]) {
			dfs(i);
			output += max(dp[i][id[0]], dp[i][id[1]]);
		}
	}
	
	cout << output << endl;
	
	return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 35540 KB Output is correct
2 Correct 17 ms 35616 KB Output is correct
3 Correct 15 ms 35548 KB Output is correct
4 Correct 17 ms 35628 KB Output is correct
5 Correct 16 ms 35532 KB Output is correct
6 Correct 16 ms 35668 KB Output is correct
7 Correct 15 ms 35652 KB Output is correct
8 Correct 15 ms 35636 KB Output is correct
9 Correct 15 ms 35668 KB Output is correct
10 Correct 17 ms 35540 KB Output is correct
11 Correct 16 ms 35636 KB Output is correct
12 Correct 16 ms 35540 KB Output is correct
13 Correct 16 ms 35668 KB Output is correct
14 Correct 16 ms 35564 KB Output is correct
15 Correct 16 ms 35540 KB Output is correct
16 Correct 15 ms 35600 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 35540 KB Output is correct
2 Correct 17 ms 35616 KB Output is correct
3 Correct 15 ms 35548 KB Output is correct
4 Correct 17 ms 35628 KB Output is correct
5 Correct 16 ms 35532 KB Output is correct
6 Correct 16 ms 35668 KB Output is correct
7 Correct 15 ms 35652 KB Output is correct
8 Correct 15 ms 35636 KB Output is correct
9 Correct 15 ms 35668 KB Output is correct
10 Correct 17 ms 35540 KB Output is correct
11 Correct 16 ms 35636 KB Output is correct
12 Correct 16 ms 35540 KB Output is correct
13 Correct 16 ms 35668 KB Output is correct
14 Correct 16 ms 35564 KB Output is correct
15 Correct 16 ms 35540 KB Output is correct
16 Correct 15 ms 35600 KB Output is correct
17 Correct 15 ms 35640 KB Output is correct
18 Correct 16 ms 35540 KB Output is correct
19 Correct 16 ms 35668 KB Output is correct
20 Correct 17 ms 35568 KB Output is correct
21 Correct 16 ms 35540 KB Output is correct
22 Correct 18 ms 35668 KB Output is correct
23 Correct 15 ms 35668 KB Output is correct
24 Correct 15 ms 35540 KB Output is correct
25 Correct 16 ms 35532 KB Output is correct
26 Correct 14 ms 35584 KB Output is correct
27 Correct 15 ms 35576 KB Output is correct
28 Correct 16 ms 35668 KB Output is correct
29 Correct 15 ms 35668 KB Output is correct
30 Correct 17 ms 35540 KB Output is correct
31 Correct 15 ms 35540 KB Output is correct
32 Correct 15 ms 35632 KB Output is correct
33 Correct 15 ms 35668 KB Output is correct
34 Correct 16 ms 35644 KB Output is correct
35 Correct 16 ms 35592 KB Output is correct
36 Correct 18 ms 35596 KB Output is correct
37 Correct 15 ms 35560 KB Output is correct
38 Correct 17 ms 35668 KB Output is correct
39 Correct 16 ms 35632 KB Output is correct
40 Correct 15 ms 35652 KB Output is correct
41 Correct 14 ms 35668 KB Output is correct
42 Correct 15 ms 35624 KB Output is correct
43 Correct 17 ms 35668 KB Output is correct
44 Correct 15 ms 35648 KB Output is correct
45 Correct 15 ms 35576 KB Output is correct
46 Correct 17 ms 35668 KB Output is correct
47 Correct 15 ms 35640 KB Output is correct
48 Correct 15 ms 35668 KB Output is correct
49 Correct 15 ms 35668 KB Output is correct
50 Correct 16 ms 35668 KB Output is correct
51 Correct 15 ms 35604 KB Output is correct
52 Correct 15 ms 35604 KB Output is correct
53 Correct 14 ms 35608 KB Output is correct

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 35540 KB Output is correct
2 Correct 17 ms 35616 KB Output is correct
3 Correct 15 ms 35548 KB Output is correct
4 Correct 17 ms 35628 KB Output is correct
5 Correct 16 ms 35532 KB Output is correct
6 Correct 16 ms 35668 KB Output is correct
7 Correct 15 ms 35652 KB Output is correct
8 Correct 15 ms 35636 KB Output is correct
9 Correct 15 ms 35668 KB Output is correct
10 Correct 17 ms 35540 KB Output is correct
11 Correct 16 ms 35636 KB Output is correct
12 Correct 16 ms 35540 KB Output is correct
13 Correct 16 ms 35668 KB Output is correct
14 Correct 16 ms 35564 KB Output is correct
15 Correct 16 ms 35540 KB Output is correct
16 Correct 15 ms 35600 KB Output is correct
17 Correct 15 ms 35640 KB Output is correct
18 Correct 16 ms 35540 KB Output is correct
19 Correct 16 ms 35668 KB Output is correct
20 Correct 17 ms 35568 KB Output is correct
21 Correct 16 ms 35540 KB Output is correct
22 Correct 18 ms 35668 KB Output is correct
23 Correct 15 ms 35668 KB Output is correct
24 Correct 15 ms 35540 KB Output is correct
25 Correct 16 ms 35532 KB Output is correct
26 Correct 14 ms 35584 KB Output is correct
27 Correct 15 ms 35576 KB Output is correct
28 Correct 16 ms 35668 KB Output is correct
29 Correct 15 ms 35668 KB Output is correct
30 Correct 17 ms 35540 KB Output is correct
31 Correct 15 ms 35540 KB Output is correct
32 Correct 15 ms 35632 KB Output is correct
33 Correct 15 ms 35668 KB Output is correct
34 Correct 16 ms 35644 KB Output is correct
35 Correct 16 ms 35592 KB Output is correct
36 Correct 18 ms 35596 KB Output is correct
37 Correct 15 ms 35560 KB Output is correct
38 Correct 17 ms 35668 KB Output is correct
39 Correct 16 ms 35632 KB Output is correct
40 Correct 15 ms 35652 KB Output is correct
41 Correct 14 ms 35668 KB Output is correct
42 Correct 15 ms 35624 KB Output is correct
43 Correct 17 ms 35668 KB Output is correct
44 Correct 15 ms 35648 KB Output is correct
45 Correct 15 ms 35576 KB Output is correct
46 Correct 17 ms 35668 KB Output is correct
47 Correct 15 ms 35640 KB Output is correct
48 Correct 15 ms 35668 KB Output is correct
49 Correct 15 ms 35668 KB Output is correct
50 Correct 16 ms 35668 KB Output is correct
51 Correct 15 ms 35604 KB Output is correct
52 Correct 15 ms 35604 KB Output is correct
53 Correct 14 ms 35608 KB Output is correct
54 Correct 14 ms 35540 KB Output is correct
55 Correct 15 ms 35592 KB Output is correct
56 Correct 14 ms 35792 KB Output is correct
57 Correct 15 ms 35668 KB Output is correct
58 Correct 35 ms 39476 KB Output is correct
59 Correct 170 ms 67956 KB Output is correct
60 Correct 174 ms 67916 KB Output is correct
61 Correct 169 ms 67916 KB Output is correct
62 Correct 15 ms 35624 KB Output is correct
63 Correct 169 ms 66936 KB Output is correct
64 Runtime error 335 ms 262144 KB Execution killed with signal 9
65 Halted 0 ms 0 KB -