oj.uz

Submission #667476

# Submission time Handle Problem Language Result Execution time Memory
667476 2022-12-01T14:13:26 Z AmirAli_H1 Dango Maker (JOI18_dango_maker) C++17
13 / 100
 1 ms 424 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;
string s[maxn];
int cntv = 0;
int arr[maxs];
int adj[maxs][3]; int ind[maxs];
bool mark[maxs];
int h[maxs]; int cnt[2];

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

void dfs(int v) {
	mark[v] = 1;
	cnt[h[v] % 2]++;
	for (int i = 0; i < ind[v]; i++) {
		int u = adj[v][i];
		if (!mark[u]) {
			h[u] = h[v] + 1;
			dfs(u);
		}
	}
}

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 + n * m, -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(cnt[0], cnt[1]);
			cnt[0] = 0; cnt[1] = 0;
		}
	}
	
	cout << output << endl;
	
	return 0;
}

Subtask #1
13.0 / 13.0

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

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 416 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 416 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 412 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 416 KB Output is correct
14 Correct 1 ms 420 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 424 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 404 KB Output is correct
22 Correct 1 ms 424 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 340 KB Output is correct
26 Correct 1 ms 424 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 340 KB Output is correct
30 Correct 1 ms 420 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 424 KB Output is correct
34 Incorrect 1 ms 340 KB Output isn't correct
35 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 416 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 416 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 412 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 416 KB Output is correct
14 Correct 1 ms 420 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 424 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 404 KB Output is correct
22 Correct 1 ms 424 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 340 KB Output is correct
26 Correct 1 ms 424 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 340 KB Output is correct
30 Correct 1 ms 420 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 424 KB Output is correct
34 Incorrect 1 ms 340 KB Output isn't correct
35 Halted 0 ms 0 KB -