oj.uz

Submission #97962

# Submission time Handle Problem Language Result Execution time Memory
97962 2019-02-19T16:36:29 Z Anai Dango Maker (JOI18_dango_maker) C++14
33 / 100
 510 ms 263168 KB 
#include <algorithm>
#include <bitset>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;

const int N = 3005;

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;

//	cerr << (sizeof(g) + sizeof(st) + sizeof(dr) + sizeof(f)) / 1024 / 1024 << endl;

	return 0; }

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 212 ms 213496 KB Output is correct
2 Correct 197 ms 213496 KB Output is correct
3 Correct 192 ms 213624 KB Output is correct
4 Correct 200 ms 213596 KB Output is correct
5 Correct 191 ms 213468 KB Output is correct
6 Correct 194 ms 213440 KB Output is correct
7 Correct 201 ms 213512 KB Output is correct
8 Correct 196 ms 213496 KB Output is correct
9 Correct 207 ms 213652 KB Output is correct
10 Correct 213 ms 213496 KB Output is correct
11 Correct 217 ms 213496 KB Output is correct
12 Correct 222 ms 213548 KB Output is correct
13 Correct 214 ms 213496 KB Output is correct
14 Correct 202 ms 213496 KB Output is correct
15 Correct 199 ms 213496 KB Output is correct
16 Correct 183 ms 213488 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 212 ms 213496 KB Output is correct
2 Correct 197 ms 213496 KB Output is correct
3 Correct 192 ms 213624 KB Output is correct
4 Correct 200 ms 213596 KB Output is correct
5 Correct 191 ms 213468 KB Output is correct
6 Correct 194 ms 213440 KB Output is correct
7 Correct 201 ms 213512 KB Output is correct
8 Correct 196 ms 213496 KB Output is correct
9 Correct 207 ms 213652 KB Output is correct
10 Correct 213 ms 213496 KB Output is correct
11 Correct 217 ms 213496 KB Output is correct
12 Correct 222 ms 213548 KB Output is correct
13 Correct 214 ms 213496 KB Output is correct
14 Correct 202 ms 213496 KB Output is correct
15 Correct 199 ms 213496 KB Output is correct
16 Correct 183 ms 213488 KB Output is correct
17 Correct 193 ms 213480 KB Output is correct
18 Correct 193 ms 213820 KB Output is correct
19 Correct 189 ms 213496 KB Output is correct
20 Correct 197 ms 213496 KB Output is correct
21 Correct 195 ms 213564 KB Output is correct
22 Correct 206 ms 213520 KB Output is correct
23 Correct 181 ms 213496 KB Output is correct
24 Correct 193 ms 213492 KB Output is correct
25 Correct 188 ms 213596 KB Output is correct
26 Correct 191 ms 213568 KB Output is correct
27 Correct 186 ms 213628 KB Output is correct
28 Correct 193 ms 213572 KB Output is correct
29 Correct 200 ms 213584 KB Output is correct
30 Correct 194 ms 213496 KB Output is correct
31 Correct 204 ms 213496 KB Output is correct
32 Correct 214 ms 213496 KB Output is correct
33 Correct 189 ms 213496 KB Output is correct
34 Correct 200 ms 213496 KB Output is correct
35 Correct 222 ms 213496 KB Output is correct
36 Correct 202 ms 213496 KB Output is correct
37 Correct 223 ms 213572 KB Output is correct
38 Correct 211 ms 213500 KB Output is correct
39 Correct 200 ms 213496 KB Output is correct
40 Correct 212 ms 213496 KB Output is correct
41 Correct 203 ms 213624 KB Output is correct
42 Correct 213 ms 213496 KB Output is correct
43 Correct 203 ms 213496 KB Output is correct
44 Correct 199 ms 213496 KB Output is correct
45 Correct 193 ms 213496 KB Output is correct
46 Correct 189 ms 213496 KB Output is correct
47 Correct 204 ms 213628 KB Output is correct
48 Correct 196 ms 213532 KB Output is correct
49 Correct 207 ms 213496 KB Output is correct
50 Correct 186 ms 213496 KB Output is correct
51 Correct 196 ms 213440 KB Output is correct
52 Correct 211 ms 213460 KB Output is correct
53 Correct 200 ms 213552 KB Output is correct

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 212 ms 213496 KB Output is correct
2 Correct 197 ms 213496 KB Output is correct
3 Correct 192 ms 213624 KB Output is correct
4 Correct 200 ms 213596 KB Output is correct
5 Correct 191 ms 213468 KB Output is correct
6 Correct 194 ms 213440 KB Output is correct
7 Correct 201 ms 213512 KB Output is correct
8 Correct 196 ms 213496 KB Output is correct
9 Correct 207 ms 213652 KB Output is correct
10 Correct 213 ms 213496 KB Output is correct
11 Correct 217 ms 213496 KB Output is correct
12 Correct 222 ms 213548 KB Output is correct
13 Correct 214 ms 213496 KB Output is correct
14 Correct 202 ms 213496 KB Output is correct
15 Correct 199 ms 213496 KB Output is correct
16 Correct 183 ms 213488 KB Output is correct
17 Correct 193 ms 213480 KB Output is correct
18 Correct 193 ms 213820 KB Output is correct
19 Correct 189 ms 213496 KB Output is correct
20 Correct 197 ms 213496 KB Output is correct
21 Correct 195 ms 213564 KB Output is correct
22 Correct 206 ms 213520 KB Output is correct
23 Correct 181 ms 213496 KB Output is correct
24 Correct 193 ms 213492 KB Output is correct
25 Correct 188 ms 213596 KB Output is correct
26 Correct 191 ms 213568 KB Output is correct
27 Correct 186 ms 213628 KB Output is correct
28 Correct 193 ms 213572 KB Output is correct
29 Correct 200 ms 213584 KB Output is correct
30 Correct 194 ms 213496 KB Output is correct
31 Correct 204 ms 213496 KB Output is correct
32 Correct 214 ms 213496 KB Output is correct
33 Correct 189 ms 213496 KB Output is correct
34 Correct 200 ms 213496 KB Output is correct
35 Correct 222 ms 213496 KB Output is correct
36 Correct 202 ms 213496 KB Output is correct
37 Correct 223 ms 213572 KB Output is correct
38 Correct 211 ms 213500 KB Output is correct
39 Correct 200 ms 213496 KB Output is correct
40 Correct 212 ms 213496 KB Output is correct
41 Correct 203 ms 213624 KB Output is correct
42 Correct 213 ms 213496 KB Output is correct
43 Correct 203 ms 213496 KB Output is correct
44 Correct 199 ms 213496 KB Output is correct
45 Correct 193 ms 213496 KB Output is correct
46 Correct 189 ms 213496 KB Output is correct
47 Correct 204 ms 213628 KB Output is correct
48 Correct 196 ms 213532 KB Output is correct
49 Correct 207 ms 213496 KB Output is correct
50 Correct 186 ms 213496 KB Output is correct
51 Correct 196 ms 213440 KB Output is correct
52 Correct 211 ms 213460 KB Output is correct
53 Correct 200 ms 213552 KB Output is correct
54 Correct 204 ms 213536 KB Output is correct
55 Correct 199 ms 213536 KB Output is correct
56 Correct 195 ms 213688 KB Output is correct
57 Correct 193 ms 213748 KB Output is correct
58 Correct 242 ms 223000 KB Output is correct
59 Runtime error 510 ms 263168 KB Execution killed with signal 9 (could be triggered by violating memory limits)
60 Halted 0 ms 0 KB -