oj.uz

Submission #97959

# Submission time Handle Problem Language Result Execution time Memory
97959 2019-02-19T16:28:49 Z Anai Dango Maker (JOI18_dango_maker) C++14
33 / 100
 498 ms 263168 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 3001;


vector<int> g[N * N];
int st[N * N], dr[N * N];
bitset<N * N> f;

vector<string> mx;
int n, m, fp;

static int cod(int l, int c) {
	return 1 + l * m + c; }

static bool match(int u) {
	if (f[u])
		return false;
	f[u] = 1;

	for (auto v: g[u]) if (!dr[v]) {
		st[u] = v;
		dr[v] = u;
		return true; }

	for (auto v: g[u]) if (match(dr[v])) {
		st[u] = v;
		dr[v] = u;
		return true; }
	return false;}


int main() {
#ifdef HOME
	freopen("joi_dango.in", "r", stdin);
	freopen("joi_dango.out", "w", stdout);
#endif
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	int add, ant;

	cin >> n >> m;
	mx.resize(n);
	for (auto &line: mx)
		cin >> line;

	ant = 0;
	for (int i = 0; i < n; ++i)
	for (int j = 0; j < m; ++j) if (mx[i][j] == 'R') {
		bool hor = j + 2 < m ? (mx[i][j + 1] == 'G' && mx[i][j + 2] == 'W') : 0;
		bool ver = i + 2 < n ? (mx[i + 1][j] == 'G' && mx[i + 2][j] == 'W') : 0;

		ant+= int(hor) + int(ver);
		if (hor && ver)
			g[cod(i, j)].push_back(cod(i, j)); }

	for (int i = 2; i < n; ++i)
	for (int j = 2; j < m; ++j) if (mx[i][j] == 'W') {
		bool hor = mx[i][j - 2] == 'R' && mx[i][j - 1] == 'G';
		bool ver = mx[i - 2][j] == 'R' && mx[i - 1][j] == 'G';
		if (hor && ver)
			g[cod(i - 2, j)].push_back(cod(i, j - 2)); }
	
	

	for (int i = 1; i < n - 1; ++i)
	for (int j = 1; j < m - 1; ++j) if (mx[i][j] == 'G') {
		if (mx[i - 1][j] == 'R' && mx[i + 1][j] == 'W')
		if (mx[i][j - 1] == 'R' && mx[i][j + 1] == 'W')
			g[cod(i - 1, j)].push_back(cod(i, j - 1)); }

	mx.clear();
	mx.shrink_to_fit();

	do {
		f = 0;
		add = 0;
		for (int i = n * m; i >= 1; --i)
			if (!st[i] && !f[i])
				add+= int(match(i));
		ant-= add; }
	while (add);

	cout << ant << endl;

	return 0; }

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 196 ms 212904 KB Output is correct
2 Correct 183 ms 212988 KB Output is correct
3 Correct 185 ms 212984 KB Output is correct
4 Correct 194 ms 212992 KB Output is correct
5 Correct 195 ms 212972 KB Output is correct
6 Correct 196 ms 213012 KB Output is correct
7 Correct 201 ms 212984 KB Output is correct
8 Correct 190 ms 213112 KB Output is correct
9 Correct 214 ms 212916 KB Output is correct
10 Correct 197 ms 212964 KB Output is correct
11 Correct 190 ms 213112 KB Output is correct
12 Correct 200 ms 213132 KB Output is correct
13 Correct 203 ms 212876 KB Output is correct
14 Correct 199 ms 212856 KB Output is correct
15 Correct 189 ms 212984 KB Output is correct
16 Correct 191 ms 212984 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 196 ms 212904 KB Output is correct
2 Correct 183 ms 212988 KB Output is correct
3 Correct 185 ms 212984 KB Output is correct
4 Correct 194 ms 212992 KB Output is correct
5 Correct 195 ms 212972 KB Output is correct
6 Correct 196 ms 213012 KB Output is correct
7 Correct 201 ms 212984 KB Output is correct
8 Correct 190 ms 213112 KB Output is correct
9 Correct 214 ms 212916 KB Output is correct
10 Correct 197 ms 212964 KB Output is correct
11 Correct 190 ms 213112 KB Output is correct
12 Correct 200 ms 213132 KB Output is correct
13 Correct 203 ms 212876 KB Output is correct
14 Correct 199 ms 212856 KB Output is correct
15 Correct 189 ms 212984 KB Output is correct
16 Correct 191 ms 212984 KB Output is correct
17 Correct 196 ms 212928 KB Output is correct
18 Correct 197 ms 212984 KB Output is correct
19 Correct 192 ms 212984 KB Output is correct
20 Correct 189 ms 212984 KB Output is correct
21 Correct 208 ms 212872 KB Output is correct
22 Correct 207 ms 212980 KB Output is correct
23 Correct 208 ms 212984 KB Output is correct
24 Correct 230 ms 212996 KB Output is correct
25 Correct 204 ms 212916 KB Output is correct
26 Correct 204 ms 212952 KB Output is correct
27 Correct 210 ms 212976 KB Output is correct
28 Correct 229 ms 212948 KB Output is correct
29 Correct 200 ms 212856 KB Output is correct
30 Correct 208 ms 212856 KB Output is correct
31 Correct 195 ms 213028 KB Output is correct
32 Correct 199 ms 212920 KB Output is correct
33 Correct 237 ms 212948 KB Output is correct
34 Correct 199 ms 212964 KB Output is correct
35 Correct 193 ms 212984 KB Output is correct
36 Correct 190 ms 212984 KB Output is correct
37 Correct 202 ms 212884 KB Output is correct
38 Correct 199 ms 212984 KB Output is correct
39 Correct 220 ms 212984 KB Output is correct
40 Correct 184 ms 213132 KB Output is correct
41 Correct 193 ms 212860 KB Output is correct
42 Correct 217 ms 212984 KB Output is correct
43 Correct 202 ms 212984 KB Output is correct
44 Correct 187 ms 212984 KB Output is correct
45 Correct 190 ms 212972 KB Output is correct
46 Correct 202 ms 213012 KB Output is correct
47 Correct 185 ms 212984 KB Output is correct
48 Correct 206 ms 212984 KB Output is correct
49 Correct 208 ms 213112 KB Output is correct
50 Correct 186 ms 212856 KB Output is correct
51 Correct 185 ms 212984 KB Output is correct
52 Correct 197 ms 212984 KB Output is correct
53 Correct 191 ms 212984 KB Output is correct

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 196 ms 212904 KB Output is correct
2 Correct 183 ms 212988 KB Output is correct
3 Correct 185 ms 212984 KB Output is correct
4 Correct 194 ms 212992 KB Output is correct
5 Correct 195 ms 212972 KB Output is correct
6 Correct 196 ms 213012 KB Output is correct
7 Correct 201 ms 212984 KB Output is correct
8 Correct 190 ms 213112 KB Output is correct
9 Correct 214 ms 212916 KB Output is correct
10 Correct 197 ms 212964 KB Output is correct
11 Correct 190 ms 213112 KB Output is correct
12 Correct 200 ms 213132 KB Output is correct
13 Correct 203 ms 212876 KB Output is correct
14 Correct 199 ms 212856 KB Output is correct
15 Correct 189 ms 212984 KB Output is correct
16 Correct 191 ms 212984 KB Output is correct
17 Correct 196 ms 212928 KB Output is correct
18 Correct 197 ms 212984 KB Output is correct
19 Correct 192 ms 212984 KB Output is correct
20 Correct 189 ms 212984 KB Output is correct
21 Correct 208 ms 212872 KB Output is correct
22 Correct 207 ms 212980 KB Output is correct
23 Correct 208 ms 212984 KB Output is correct
24 Correct 230 ms 212996 KB Output is correct
25 Correct 204 ms 212916 KB Output is correct
26 Correct 204 ms 212952 KB Output is correct
27 Correct 210 ms 212976 KB Output is correct
28 Correct 229 ms 212948 KB Output is correct
29 Correct 200 ms 212856 KB Output is correct
30 Correct 208 ms 212856 KB Output is correct
31 Correct 195 ms 213028 KB Output is correct
32 Correct 199 ms 212920 KB Output is correct
33 Correct 237 ms 212948 KB Output is correct
34 Correct 199 ms 212964 KB Output is correct
35 Correct 193 ms 212984 KB Output is correct
36 Correct 190 ms 212984 KB Output is correct
37 Correct 202 ms 212884 KB Output is correct
38 Correct 199 ms 212984 KB Output is correct
39 Correct 220 ms 212984 KB Output is correct
40 Correct 184 ms 213132 KB Output is correct
41 Correct 193 ms 212860 KB Output is correct
42 Correct 217 ms 212984 KB Output is correct
43 Correct 202 ms 212984 KB Output is correct
44 Correct 187 ms 212984 KB Output is correct
45 Correct 190 ms 212972 KB Output is correct
46 Correct 202 ms 213012 KB Output is correct
47 Correct 185 ms 212984 KB Output is correct
48 Correct 206 ms 212984 KB Output is correct
49 Correct 208 ms 213112 KB Output is correct
50 Correct 186 ms 212856 KB Output is correct
51 Correct 185 ms 212984 KB Output is correct
52 Correct 197 ms 212984 KB Output is correct
53 Correct 191 ms 212984 KB Output is correct
54 Correct 216 ms 212920 KB Output is correct
55 Correct 201 ms 213112 KB Output is correct
56 Correct 196 ms 213112 KB Output is correct
57 Correct 205 ms 213112 KB Output is correct
58 Correct 271 ms 222332 KB Output is correct
59 Runtime error 498 ms 263168 KB Execution killed with signal 9 (could be triggered by violating memory limits)
60 Halted 0 ms 0 KB -