답안 #207868

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
207868 2020-03-09T10:26:36 Z opukittpceno_hhr Dango Maker (JOI18_dango_maker) C++17
33 / 100
2000 ms 12408 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) {
	if (used[v]) return 0;
	used[v] = 1;
	for (auto t : g[v]) {
		if (mt[t] == -1 || sm(mt[t])) {
			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]);
	}
}

int solve_mathing() {
	int f = (int)g.size();
	for (int i = 0; i < f; i++) {
		if (!used[i]) dfs(i, 0);
	}
	fill(mt, mt + f, -1);
	fill(used, used + f, 0);
	for (int i = 0; i < f; i++) {
		if (!clr[i]) {
			fill(used, used + f, 0);
			sm(i);
		}
	}
	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;
}

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});
			if (ok(i, j, 1)) tk.push_back({i * m + j + n * m});
		}
	}
	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++) {
		for (int j = i + 1; j < (int)tk.size(); j++) {
			vector<pair<int, int>> f = get(i);
			vector<pair<int, int>> s = get(j);
			if (inter(f, s)) {
				g[i].push_back(j);
				g[j].push_back(i);
			}
		}
	}
	cout << solve_mathing() << endl;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 380 KB Output is correct
2 Correct 4 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 4 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 4 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 4 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 380 KB Output is correct
2 Correct 4 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 4 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 4 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 4 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 412 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 380 KB Output is correct
27 Correct 5 ms 380 KB Output is correct
28 Correct 5 ms 376 KB Output is correct
29 Correct 5 ms 376 KB Output is correct
30 Correct 5 ms 376 KB Output is correct
31 Correct 5 ms 376 KB Output is correct
32 Correct 5 ms 376 KB Output is correct
33 Correct 5 ms 376 KB Output is correct
34 Correct 5 ms 376 KB Output is correct
35 Correct 5 ms 376 KB Output is correct
36 Correct 5 ms 376 KB Output is correct
37 Correct 5 ms 376 KB Output is correct
38 Correct 5 ms 376 KB Output is correct
39 Correct 5 ms 376 KB Output is correct
40 Correct 6 ms 376 KB Output is correct
41 Correct 5 ms 376 KB Output is correct
42 Correct 5 ms 376 KB Output is correct
43 Correct 5 ms 376 KB Output is correct
44 Correct 5 ms 376 KB Output is correct
45 Correct 5 ms 504 KB Output is correct
46 Correct 5 ms 376 KB Output is correct
47 Correct 5 ms 376 KB Output is correct
48 Correct 5 ms 376 KB Output is correct
49 Correct 5 ms 376 KB Output is correct
50 Correct 5 ms 376 KB Output is correct
51 Correct 5 ms 376 KB Output is correct
52 Correct 5 ms 376 KB Output is correct
53 Correct 5 ms 376 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 380 KB Output is correct
2 Correct 4 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 4 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 4 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 4 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 412 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 380 KB Output is correct
27 Correct 5 ms 380 KB Output is correct
28 Correct 5 ms 376 KB Output is correct
29 Correct 5 ms 376 KB Output is correct
30 Correct 5 ms 376 KB Output is correct
31 Correct 5 ms 376 KB Output is correct
32 Correct 5 ms 376 KB Output is correct
33 Correct 5 ms 376 KB Output is correct
34 Correct 5 ms 376 KB Output is correct
35 Correct 5 ms 376 KB Output is correct
36 Correct 5 ms 376 KB Output is correct
37 Correct 5 ms 376 KB Output is correct
38 Correct 5 ms 376 KB Output is correct
39 Correct 5 ms 376 KB Output is correct
40 Correct 6 ms 376 KB Output is correct
41 Correct 5 ms 376 KB Output is correct
42 Correct 5 ms 376 KB Output is correct
43 Correct 5 ms 376 KB Output is correct
44 Correct 5 ms 376 KB Output is correct
45 Correct 5 ms 504 KB Output is correct
46 Correct 5 ms 376 KB Output is correct
47 Correct 5 ms 376 KB Output is correct
48 Correct 5 ms 376 KB Output is correct
49 Correct 5 ms 376 KB Output is correct
50 Correct 5 ms 376 KB Output is correct
51 Correct 5 ms 376 KB Output is correct
52 Correct 5 ms 376 KB Output is correct
53 Correct 5 ms 376 KB Output is correct
54 Correct 5 ms 376 KB Output is correct
55 Correct 11 ms 12408 KB Output is correct
56 Correct 395 ms 632 KB Output is correct
57 Correct 475 ms 8568 KB Output is correct
58 Execution timed out 2019 ms 11636 KB Time limit exceeded
59 Halted 0 ms 0 KB -