oj.uz

Submission #667517

# Submission time Handle Problem Language Result Execution time Memory
667517 2022-12-01T16:30:11 Z AmirAli_H1 Dango Maker (JOI18_dango_maker) C++17
33 / 100
 239 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 = 1e7 + 5;
string s[maxn];
int cntv = 0;
int arr[maxs];
int adj[maxs][10]; int ind[maxs];
bool mark[maxs];
int h[maxs]; bool c4[maxs];
int dp[maxs][8];

int GI(int i, int j) {
	return i * m + j;
}

void dfs(int v) {
	mark[v] = 1;
	vector<int> vc;
	for (int i = 0; i < ind[v]; i++) {
		int u = adj[v][i];
		if (!mark[u]) {
			h[u] = h[v] + 1;
			dfs(u);
			vc.pb(u);
		}
		else if (h[u] == h[v] - 3) {
			c4[v] = 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;
		dp[v][i] += b1;
		for (int u : vc) {
			int val0 = b1 * 2 + b2 * 4, val1 = 1 + b1 * 2 + b2 * 4;
			if (b1 || (c4[u] && b3)) {
				dp[v][i] += dp[u][val0];
			}
			else {
				dp[v][i] += max(dp[u][val0], dp[u][val1]);
			}
		}
	}
	vc.clear();
}

int main() {
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	
	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][0], dp[i][1]);
		}
	}
	
	cout << output << endl;
	
	return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 39476 KB Output is correct
2 Correct 18 ms 39508 KB Output is correct
3 Correct 16 ms 39508 KB Output is correct
4 Correct 16 ms 39476 KB Output is correct
5 Correct 17 ms 39464 KB Output is correct
6 Correct 16 ms 39600 KB Output is correct
7 Correct 15 ms 39508 KB Output is correct
8 Correct 16 ms 39528 KB Output is correct
9 Correct 15 ms 39580 KB Output is correct
10 Correct 16 ms 39480 KB Output is correct
11 Correct 16 ms 39472 KB Output is correct
12 Correct 17 ms 39484 KB Output is correct
13 Correct 16 ms 39508 KB Output is correct
14 Correct 15 ms 39508 KB Output is correct
15 Correct 17 ms 39560 KB Output is correct
16 Correct 21 ms 39492 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 39476 KB Output is correct
2 Correct 18 ms 39508 KB Output is correct
3 Correct 16 ms 39508 KB Output is correct
4 Correct 16 ms 39476 KB Output is correct
5 Correct 17 ms 39464 KB Output is correct
6 Correct 16 ms 39600 KB Output is correct
7 Correct 15 ms 39508 KB Output is correct
8 Correct 16 ms 39528 KB Output is correct
9 Correct 15 ms 39580 KB Output is correct
10 Correct 16 ms 39480 KB Output is correct
11 Correct 16 ms 39472 KB Output is correct
12 Correct 17 ms 39484 KB Output is correct
13 Correct 16 ms 39508 KB Output is correct
14 Correct 15 ms 39508 KB Output is correct
15 Correct 17 ms 39560 KB Output is correct
16 Correct 21 ms 39492 KB Output is correct
17 Correct 18 ms 39508 KB Output is correct
18 Correct 15 ms 39564 KB Output is correct
19 Correct 15 ms 39508 KB Output is correct
20 Correct 16 ms 39592 KB Output is correct
21 Correct 17 ms 39508 KB Output is correct
22 Correct 15 ms 39476 KB Output is correct
23 Correct 15 ms 39512 KB Output is correct
24 Correct 15 ms 39468 KB Output is correct
25 Correct 15 ms 39544 KB Output is correct
26 Correct 15 ms 39528 KB Output is correct
27 Correct 16 ms 39508 KB Output is correct
28 Correct 15 ms 39516 KB Output is correct
29 Correct 18 ms 39700 KB Output is correct
30 Correct 16 ms 39508 KB Output is correct
31 Correct 16 ms 39556 KB Output is correct
32 Correct 16 ms 39484 KB Output is correct
33 Correct 15 ms 39508 KB Output is correct
34 Correct 16 ms 39572 KB Output is correct
35 Correct 18 ms 39576 KB Output is correct
36 Correct 17 ms 39516 KB Output is correct
37 Correct 16 ms 39508 KB Output is correct
38 Correct 16 ms 39596 KB Output is correct
39 Correct 16 ms 39536 KB Output is correct
40 Correct 15 ms 39564 KB Output is correct
41 Correct 22 ms 39572 KB Output is correct
42 Correct 18 ms 39508 KB Output is correct
43 Correct 20 ms 39692 KB Output is correct
44 Correct 18 ms 39508 KB Output is correct
45 Correct 21 ms 39556 KB Output is correct
46 Correct 17 ms 39508 KB Output is correct
47 Correct 17 ms 39508 KB Output is correct
48 Correct 18 ms 39580 KB Output is correct
49 Correct 17 ms 39508 KB Output is correct
50 Correct 16 ms 39508 KB Output is correct
51 Correct 16 ms 39492 KB Output is correct
52 Correct 21 ms 39572 KB Output is correct
53 Correct 17 ms 39508 KB Output is correct

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 39476 KB Output is correct
2 Correct 18 ms 39508 KB Output is correct
3 Correct 16 ms 39508 KB Output is correct
4 Correct 16 ms 39476 KB Output is correct
5 Correct 17 ms 39464 KB Output is correct
6 Correct 16 ms 39600 KB Output is correct
7 Correct 15 ms 39508 KB Output is correct
8 Correct 16 ms 39528 KB Output is correct
9 Correct 15 ms 39580 KB Output is correct
10 Correct 16 ms 39480 KB Output is correct
11 Correct 16 ms 39472 KB Output is correct
12 Correct 17 ms 39484 KB Output is correct
13 Correct 16 ms 39508 KB Output is correct
14 Correct 15 ms 39508 KB Output is correct
15 Correct 17 ms 39560 KB Output is correct
16 Correct 21 ms 39492 KB Output is correct
17 Correct 18 ms 39508 KB Output is correct
18 Correct 15 ms 39564 KB Output is correct
19 Correct 15 ms 39508 KB Output is correct
20 Correct 16 ms 39592 KB Output is correct
21 Correct 17 ms 39508 KB Output is correct
22 Correct 15 ms 39476 KB Output is correct
23 Correct 15 ms 39512 KB Output is correct
24 Correct 15 ms 39468 KB Output is correct
25 Correct 15 ms 39544 KB Output is correct
26 Correct 15 ms 39528 KB Output is correct
27 Correct 16 ms 39508 KB Output is correct
28 Correct 15 ms 39516 KB Output is correct
29 Correct 18 ms 39700 KB Output is correct
30 Correct 16 ms 39508 KB Output is correct
31 Correct 16 ms 39556 KB Output is correct
32 Correct 16 ms 39484 KB Output is correct
33 Correct 15 ms 39508 KB Output is correct
34 Correct 16 ms 39572 KB Output is correct
35 Correct 18 ms 39576 KB Output is correct
36 Correct 17 ms 39516 KB Output is correct
37 Correct 16 ms 39508 KB Output is correct
38 Correct 16 ms 39596 KB Output is correct
39 Correct 16 ms 39536 KB Output is correct
40 Correct 15 ms 39564 KB Output is correct
41 Correct 22 ms 39572 KB Output is correct
42 Correct 18 ms 39508 KB Output is correct
43 Correct 20 ms 39692 KB Output is correct
44 Correct 18 ms 39508 KB Output is correct
45 Correct 21 ms 39556 KB Output is correct
46 Correct 17 ms 39508 KB Output is correct
47 Correct 17 ms 39508 KB Output is correct
48 Correct 18 ms 39580 KB Output is correct
49 Correct 17 ms 39508 KB Output is correct
50 Correct 16 ms 39508 KB Output is correct
51 Correct 16 ms 39492 KB Output is correct
52 Correct 21 ms 39572 KB Output is correct
53 Correct 17 ms 39508 KB Output is correct
54 Correct 19 ms 39552 KB Output is correct
55 Correct 21 ms 39492 KB Output is correct
56 Correct 20 ms 39740 KB Output is correct
57 Correct 19 ms 39764 KB Output is correct
58 Correct 36 ms 47192 KB Output is correct
59 Correct 188 ms 112028 KB Output is correct
60 Correct 198 ms 112208 KB Output is correct
61 Correct 193 ms 112012 KB Output is correct
62 Correct 16 ms 39472 KB Output is correct
63 Correct 189 ms 109692 KB Output is correct
64 Runtime error 239 ms 262144 KB Execution killed with signal 9
65 Halted 0 ms 0 KB -