oj.uz

답안 #207874

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
207874 2020-03-09T10:44:31 Z opukittpceno_hhr Dango Maker (JOI18_dango_maker) C++17
13 / 100
 143 ms 211972 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

# 결과 실행 시간 메모리 Grader output
1 Correct 135 ms 211832 KB Output is correct
2 Correct 138 ms 211832 KB Output is correct
3 Correct 135 ms 211832 KB Output is correct
4 Correct 134 ms 211832 KB Output is correct
5 Correct 135 ms 211832 KB Output is correct
6 Correct 134 ms 211832 KB Output is correct
7 Correct 132 ms 211848 KB Output is correct
8 Correct 143 ms 211972 KB Output is correct
9 Correct 131 ms 211832 KB Output is correct
10 Correct 137 ms 211880 KB Output is correct
11 Correct 131 ms 211832 KB Output is correct
12 Correct 140 ms 211888 KB Output is correct
13 Correct 137 ms 211832 KB Output is correct
14 Correct 131 ms 211832 KB Output is correct
15 Correct 136 ms 211848 KB Output is correct
16 Correct 136 ms 211960 KB Output is correct

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 135 ms 211832 KB Output is correct
2 Correct 138 ms 211832 KB Output is correct
3 Correct 135 ms 211832 KB Output is correct
4 Correct 134 ms 211832 KB Output is correct
5 Correct 135 ms 211832 KB Output is correct
6 Correct 134 ms 211832 KB Output is correct
7 Correct 132 ms 211848 KB Output is correct
8 Correct 143 ms 211972 KB Output is correct
9 Correct 131 ms 211832 KB Output is correct
10 Correct 137 ms 211880 KB Output is correct
11 Correct 131 ms 211832 KB Output is correct
12 Correct 140 ms 211888 KB Output is correct
13 Correct 137 ms 211832 KB Output is correct
14 Correct 131 ms 211832 KB Output is correct
15 Correct 136 ms 211848 KB Output is correct
16 Correct 136 ms 211960 KB Output is correct
17 Correct 134 ms 211832 KB Output is correct
18 Correct 134 ms 211832 KB Output is correct
19 Correct 134 ms 211832 KB Output is correct
20 Correct 135 ms 211960 KB Output is correct
21 Correct 131 ms 211832 KB Output is correct
22 Incorrect 136 ms 211836 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 135 ms 211832 KB Output is correct
2 Correct 138 ms 211832 KB Output is correct
3 Correct 135 ms 211832 KB Output is correct
4 Correct 134 ms 211832 KB Output is correct
5 Correct 135 ms 211832 KB Output is correct
6 Correct 134 ms 211832 KB Output is correct
7 Correct 132 ms 211848 KB Output is correct
8 Correct 143 ms 211972 KB Output is correct
9 Correct 131 ms 211832 KB Output is correct
10 Correct 137 ms 211880 KB Output is correct
11 Correct 131 ms 211832 KB Output is correct
12 Correct 140 ms 211888 KB Output is correct
13 Correct 137 ms 211832 KB Output is correct
14 Correct 131 ms 211832 KB Output is correct
15 Correct 136 ms 211848 KB Output is correct
16 Correct 136 ms 211960 KB Output is correct
17 Correct 134 ms 211832 KB Output is correct
18 Correct 134 ms 211832 KB Output is correct
19 Correct 134 ms 211832 KB Output is correct
20 Correct 135 ms 211960 KB Output is correct
21 Correct 131 ms 211832 KB Output is correct
22 Incorrect 136 ms 211836 KB Output isn't correct
23 Halted 0 ms 0 KB -