oj.uz

Submission #207875

# Submission time Handle Problem Language Result Execution time Memory
207875 2020-03-09T10:45:19 Z opukittpceno_hhr Dango Maker (JOI18_dango_maker) C++17
33 / 100
 2000 ms 226128 KB 
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>
#include <bitset>
#include <complex>
#include <random>

using namespace std;

const int N = 3001;

int a[N][N];

int read() {
	char c;
	cin >> c;
	if (c == 'R') return 0;
	if (c == 'G') return 1;
	if (c == 'W') return 2;
	assert(false);
	return -1;
}

int n, m;

int ok(int i, int j, int dir) {
	if (dir == 0) {
		if (i == 0 || i + 1 == n) return 0;
		return a[i - 1][j] == 0 && a[i][j] == 1 && a[i + 1][j] == 2;
	} else {
		if (j == 0 || j + 1 == m) return 0;
		return a[i][j - 1] == 0 && a[i][j] == 1 && a[i][j + 1] == 2;
	}
}

vector<pair<int, int>> gt(int i, int j, int dir) {
	if (dir == 0) {
		return {{i - 1, j}, {i, j}, {i + 1, j}};
	} else {
		return {{i, j - 1}, {i, j}, {i, j + 1}};
	}
}

bool inter(vector<pair<int, int>> &x, vector<pair<int, int>> &y) {
	for (auto f : x) {
		for (auto s : y) {
			if (f == s) return 1;
		}
	}
	return 0;
}

vector<vector<int>> g;

int used[N * N];
int clr[N * N];
int mt[N * N];


void dfs(int v, int c) {
	clr[v] = c;
	used[v] = 1;
	for (auto t : g[v]) {
		if (!used[t]) dfs(t, c ^ 1);
	}
}


int sm(int v, int timer) {
	if (used[v] == timer) return 0;
	used[v] = timer;
	for (auto t : g[v]) {
		if (mt[t] == -1 || sm(mt[t], timer)) {
			mt[t] = v;
			return 1;
		}
	}
	return 0;
}

void dfs2(int v) {
	used[v] = 1;
	for (auto t : g[v]) {
		if (mt[t] == v) continue;
		used[t] = 1;
		if (mt[t] != -1 && !used[mt[t]]) dfs2(mt[t]);
	}
}

void init_matching(int f) {
	fill(mt, mt + f, -1);
	fill(used, used + f, 0);
	int timer = 1;
	for (int i = 0; i < f; i++) {
		if (!clr[i]) {
			fill(used, used + f, 0);
			sm(i, timer);
			timer++;
		}
	}
}

int solve_mathing() {
	int f = (int)g.size();
	for (int i = 0; i < f; i++) {
		if (!used[i]) dfs(i, 0);
	}
	init_matching(f);
	fill(used, used + f, 0);
	vector<int> ns(f);
	for (int i = 0; i < f; i++) {
		if (mt[i] != -1) {
			ns[mt[i]] = 1;
		}
	}
	for (int i = 0; i < f; i++) {
		if (!clr[i] && !ns[i]) {
			dfs2(i);
		}
	}
	int ans = 0;
	for (int i = 0; i < f; i++) {
		ans += (used[i] && !clr[i]);
	}
	for (int i = 0; i < f; i++) {
		ans += (!used[i] && clr[i]);
	}
	return ans;
}

vector<int> cd[N][N];

signed main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);

	cin >> n >> m;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			a[i][j] = read();
		}
	}
	vector<int> tk;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			if (ok(i, j, 0)) {
				tk.push_back({i * m + j});
				cd[i][j].push_back((int)tk.size() - 1);
			}
			if (ok(i, j, 1)) {
				tk.push_back({i * m + j + n * m});
				cd[i][j].push_back((int)tk.size() - 1);

			}
		}
	}
	auto get  = [&](int x) {
		int v = tk[x];
		int tp = (v / (n * m));
		v %= n * m;
		int i = v / m;
		int j = v % m;
		return gt(i, j, tp);
	};
	g.resize(tk.size());
	for (int i = 0; i < (int)tk.size(); i++) {
		int v = (tk[i] % (n * m));
		int ri = v / m;
		int rj = v % m;
		for (int ti = ri - 1; ti <= ri + 1; ti++) {
			for (int tj = rj - 1; tj <= rj + 1; tj++) {
				if (ti < 0 || tj < 0 || ti >= n || tj >= m) continue;
				for (auto j : cd[ti][tj]) {
					if (i == j) continue;
					vector<pair<int, int>> f = get(i);
					vector<pair<int, int>> s = get(j);
					if (inter(f, s)) {
						g[i].push_back(j);
					}
				}
			}
		}
	}
	cout << solve_mathing() << endl;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 141 ms 211832 KB Output is correct
2 Correct 140 ms 211832 KB Output is correct
3 Correct 135 ms 211832 KB Output is correct
4 Correct 139 ms 211832 KB Output is correct
5 Correct 140 ms 211808 KB Output is correct
6 Correct 138 ms 211832 KB Output is correct
7 Correct 135 ms 211832 KB Output is correct
8 Correct 146 ms 212088 KB Output is correct
9 Correct 139 ms 211832 KB Output is correct
10 Correct 135 ms 211832 KB Output is correct
11 Correct 138 ms 211832 KB Output is correct
12 Correct 142 ms 211900 KB Output is correct
13 Correct 137 ms 211832 KB Output is correct
14 Correct 134 ms 211832 KB Output is correct
15 Correct 133 ms 211836 KB Output is correct
16 Correct 147 ms 211832 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 141 ms 211832 KB Output is correct
2 Correct 140 ms 211832 KB Output is correct
3 Correct 135 ms 211832 KB Output is correct
4 Correct 139 ms 211832 KB Output is correct
5 Correct 140 ms 211808 KB Output is correct
6 Correct 138 ms 211832 KB Output is correct
7 Correct 135 ms 211832 KB Output is correct
8 Correct 146 ms 212088 KB Output is correct
9 Correct 139 ms 211832 KB Output is correct
10 Correct 135 ms 211832 KB Output is correct
11 Correct 138 ms 211832 KB Output is correct
12 Correct 142 ms 211900 KB Output is correct
13 Correct 137 ms 211832 KB Output is correct
14 Correct 134 ms 211832 KB Output is correct
15 Correct 133 ms 211836 KB Output is correct
16 Correct 147 ms 211832 KB Output is correct
17 Correct 135 ms 211832 KB Output is correct
18 Correct 133 ms 211832 KB Output is correct
19 Correct 139 ms 211804 KB Output is correct
20 Correct 132 ms 211832 KB Output is correct
21 Correct 133 ms 211832 KB Output is correct
22 Correct 135 ms 211844 KB Output is correct
23 Correct 138 ms 211960 KB Output is correct
24 Correct 142 ms 211832 KB Output is correct
25 Correct 139 ms 211832 KB Output is correct
26 Correct 141 ms 211832 KB Output is correct
27 Correct 141 ms 211896 KB Output is correct
28 Correct 139 ms 211960 KB Output is correct
29 Correct 135 ms 211832 KB Output is correct
30 Correct 137 ms 211832 KB Output is correct
31 Correct 138 ms 211836 KB Output is correct
32 Correct 138 ms 211960 KB Output is correct
33 Correct 148 ms 211832 KB Output is correct
34 Correct 140 ms 211960 KB Output is correct
35 Correct 138 ms 211960 KB Output is correct
36 Correct 136 ms 211964 KB Output is correct
37 Correct 137 ms 211828 KB Output is correct
38 Correct 137 ms 211832 KB Output is correct
39 Correct 141 ms 212088 KB Output is correct
40 Correct 133 ms 211832 KB Output is correct
41 Correct 129 ms 211832 KB Output is correct
42 Correct 141 ms 211832 KB Output is correct
43 Correct 140 ms 211832 KB Output is correct
44 Correct 145 ms 211832 KB Output is correct
45 Correct 142 ms 211960 KB Output is correct
46 Correct 135 ms 211960 KB Output is correct
47 Correct 136 ms 211960 KB Output is correct
48 Correct 136 ms 211868 KB Output is correct
49 Correct 136 ms 211832 KB Output is correct
50 Correct 145 ms 212088 KB Output is correct
51 Correct 132 ms 211832 KB Output is correct
52 Correct 130 ms 211960 KB Output is correct
53 Correct 137 ms 211832 KB Output is correct

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 141 ms 211832 KB Output is correct
2 Correct 140 ms 211832 KB Output is correct
3 Correct 135 ms 211832 KB Output is correct
4 Correct 139 ms 211832 KB Output is correct
5 Correct 140 ms 211808 KB Output is correct
6 Correct 138 ms 211832 KB Output is correct
7 Correct 135 ms 211832 KB Output is correct
8 Correct 146 ms 212088 KB Output is correct
9 Correct 139 ms 211832 KB Output is correct
10 Correct 135 ms 211832 KB Output is correct
11 Correct 138 ms 211832 KB Output is correct
12 Correct 142 ms 211900 KB Output is correct
13 Correct 137 ms 211832 KB Output is correct
14 Correct 134 ms 211832 KB Output is correct
15 Correct 133 ms 211836 KB Output is correct
16 Correct 147 ms 211832 KB Output is correct
17 Correct 135 ms 211832 KB Output is correct
18 Correct 133 ms 211832 KB Output is correct
19 Correct 139 ms 211804 KB Output is correct
20 Correct 132 ms 211832 KB Output is correct
21 Correct 133 ms 211832 KB Output is correct
22 Correct 135 ms 211844 KB Output is correct
23 Correct 138 ms 211960 KB Output is correct
24 Correct 142 ms 211832 KB Output is correct
25 Correct 139 ms 211832 KB Output is correct
26 Correct 141 ms 211832 KB Output is correct
27 Correct 141 ms 211896 KB Output is correct
28 Correct 139 ms 211960 KB Output is correct
29 Correct 135 ms 211832 KB Output is correct
30 Correct 137 ms 211832 KB Output is correct
31 Correct 138 ms 211836 KB Output is correct
32 Correct 138 ms 211960 KB Output is correct
33 Correct 148 ms 211832 KB Output is correct
34 Correct 140 ms 211960 KB Output is correct
35 Correct 138 ms 211960 KB Output is correct
36 Correct 136 ms 211964 KB Output is correct
37 Correct 137 ms 211828 KB Output is correct
38 Correct 137 ms 211832 KB Output is correct
39 Correct 141 ms 212088 KB Output is correct
40 Correct 133 ms 211832 KB Output is correct
41 Correct 129 ms 211832 KB Output is correct
42 Correct 141 ms 211832 KB Output is correct
43 Correct 140 ms 211832 KB Output is correct
44 Correct 145 ms 211832 KB Output is correct
45 Correct 142 ms 211960 KB Output is correct
46 Correct 135 ms 211960 KB Output is correct
47 Correct 136 ms 211960 KB Output is correct
48 Correct 136 ms 211868 KB Output is correct
49 Correct 136 ms 211832 KB Output is correct
50 Correct 145 ms 212088 KB Output is correct
51 Correct 132 ms 211832 KB Output is correct
52 Correct 130 ms 211960 KB Output is correct
53 Correct 137 ms 211832 KB Output is correct
54 Correct 140 ms 211992 KB Output is correct
55 Correct 141 ms 223864 KB Output is correct
56 Correct 144 ms 212216 KB Output is correct
57 Correct 145 ms 220152 KB Output is correct
58 Execution timed out 2080 ms 226128 KB Time limit exceeded
59 Halted 0 ms 0 KB -