답안 #97979 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
97979	2019-02-19T17:02:48 Z	Anai	Dango Maker (JOI18_dango_maker)	C++14	33 / 100	534 ms	263168 KB

dango_maker

#include <algorithm>
#include <bitset>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;

const int N = 3005;

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

vector<int> used;
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)
			used.push_back(cod(i, j));
		if (hor && ver) {
			g[used.size()].push_back(used.size()); } }

	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) {
			int h = lower_bound(begin(used), end(used), cod(i - 2, j)) - begin(used) + 1;
			int v = lower_bound(begin(used), end(used), cod(i, j - 2)) - begin(used) + 1;
			g[v].push_back(h); } }


	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') {
			int h = lower_bound(begin(used), end(used), cod(i - 1, j)) - begin(used) + 1;
			int v = lower_bound(begin(used), end(used), cod(i, j - 1)) - begin(used) + 1;
			g[v].push_back(h); } }

	mx.clear();
	mx.shrink_to_fit();
	st.resize(used.size() + 5);
	dr.resize(used.size() + 5);

	do {
		f = 0;
		add = 0;
		for (int i = 1; i <= used.size(); ++i)
			if (!st[i] && !f[i])
				add+= int(match(i));
		ant-= add; }
	while (add);

	cout << ant << endl;

	return 0; }

Compilation message

dango_maker.cpp: In function 'int main()':
dango_maker.cpp:90:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 1; i <= used.size(); ++i)
                   ~~^~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	188 ms	213544 KB	Output is correct
2	Correct	186 ms	213496 KB	Output is correct
3	Correct	187 ms	213496 KB	Output is correct
4	Correct	200 ms	213596 KB	Output is correct
5	Correct	195 ms	213436 KB	Output is correct
6	Correct	209 ms	213440 KB	Output is correct
7	Correct	210 ms	213496 KB	Output is correct
8	Correct	234 ms	213496 KB	Output is correct
9	Correct	187 ms	213496 KB	Output is correct
10	Correct	229 ms	213480 KB	Output is correct
11	Correct	186 ms	213496 KB	Output is correct
12	Correct	191 ms	213496 KB	Output is correct
13	Correct	214 ms	213608 KB	Output is correct
14	Correct	199 ms	213496 KB	Output is correct
15	Correct	183 ms	213496 KB	Output is correct
16	Correct	190 ms	213492 KB	Output is correct

Subtask #2
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	188 ms	213544 KB	Output is correct
2	Correct	186 ms	213496 KB	Output is correct
3	Correct	187 ms	213496 KB	Output is correct
4	Correct	200 ms	213596 KB	Output is correct
5	Correct	195 ms	213436 KB	Output is correct
6	Correct	209 ms	213440 KB	Output is correct
7	Correct	210 ms	213496 KB	Output is correct
8	Correct	234 ms	213496 KB	Output is correct
9	Correct	187 ms	213496 KB	Output is correct
10	Correct	229 ms	213480 KB	Output is correct
11	Correct	186 ms	213496 KB	Output is correct
12	Correct	191 ms	213496 KB	Output is correct
13	Correct	214 ms	213608 KB	Output is correct
14	Correct	199 ms	213496 KB	Output is correct
15	Correct	183 ms	213496 KB	Output is correct
16	Correct	190 ms	213492 KB	Output is correct
17	Correct	193 ms	213584 KB	Output is correct
18	Correct	193 ms	213572 KB	Output is correct
19	Correct	188 ms	213468 KB	Output is correct
20	Correct	194 ms	213452 KB	Output is correct
21	Correct	206 ms	213468 KB	Output is correct
22	Correct	204 ms	213496 KB	Output is correct
23	Correct	193 ms	213524 KB	Output is correct
24	Correct	196 ms	213500 KB	Output is correct
25	Correct	198 ms	213496 KB	Output is correct
26	Correct	202 ms	213676 KB	Output is correct
27	Correct	193 ms	213496 KB	Output is correct
28	Correct	189 ms	213496 KB	Output is correct
29	Correct	188 ms	213476 KB	Output is correct
30	Correct	190 ms	213500 KB	Output is correct
31	Correct	186 ms	213492 KB	Output is correct
32	Correct	191 ms	213468 KB	Output is correct
33	Correct	193 ms	213496 KB	Output is correct
34	Correct	205 ms	213444 KB	Output is correct
35	Correct	217 ms	213584 KB	Output is correct
36	Correct	222 ms	213508 KB	Output is correct
37	Correct	217 ms	213624 KB	Output is correct
38	Correct	242 ms	213496 KB	Output is correct
39	Correct	207 ms	213560 KB	Output is correct
40	Correct	201 ms	213468 KB	Output is correct
41	Correct	224 ms	213624 KB	Output is correct
42	Correct	210 ms	213496 KB	Output is correct
43	Correct	217 ms	213520 KB	Output is correct
44	Correct	191 ms	213700 KB	Output is correct
45	Correct	207 ms	213548 KB	Output is correct
46	Correct	195 ms	213496 KB	Output is correct
47	Correct	197 ms	213524 KB	Output is correct
48	Correct	231 ms	213624 KB	Output is correct
49	Correct	192 ms	213496 KB	Output is correct
50	Correct	237 ms	213636 KB	Output is correct
51	Correct	214 ms	213496 KB	Output is correct
52	Correct	199 ms	213496 KB	Output is correct
53	Correct	206 ms	213556 KB	Output is correct

Subtask #3
0 / 67.0

#	결과	실행 시간	메모리	Grader output
1	Correct	188 ms	213544 KB	Output is correct
2	Correct	186 ms	213496 KB	Output is correct
3	Correct	187 ms	213496 KB	Output is correct
4	Correct	200 ms	213596 KB	Output is correct
5	Correct	195 ms	213436 KB	Output is correct
6	Correct	209 ms	213440 KB	Output is correct
7	Correct	210 ms	213496 KB	Output is correct
8	Correct	234 ms	213496 KB	Output is correct
9	Correct	187 ms	213496 KB	Output is correct
10	Correct	229 ms	213480 KB	Output is correct
11	Correct	186 ms	213496 KB	Output is correct
12	Correct	191 ms	213496 KB	Output is correct
13	Correct	214 ms	213608 KB	Output is correct
14	Correct	199 ms	213496 KB	Output is correct
15	Correct	183 ms	213496 KB	Output is correct
16	Correct	190 ms	213492 KB	Output is correct
17	Correct	193 ms	213584 KB	Output is correct
18	Correct	193 ms	213572 KB	Output is correct
19	Correct	188 ms	213468 KB	Output is correct
20	Correct	194 ms	213452 KB	Output is correct
21	Correct	206 ms	213468 KB	Output is correct
22	Correct	204 ms	213496 KB	Output is correct
23	Correct	193 ms	213524 KB	Output is correct
24	Correct	196 ms	213500 KB	Output is correct
25	Correct	198 ms	213496 KB	Output is correct
26	Correct	202 ms	213676 KB	Output is correct
27	Correct	193 ms	213496 KB	Output is correct
28	Correct	189 ms	213496 KB	Output is correct
29	Correct	188 ms	213476 KB	Output is correct
30	Correct	190 ms	213500 KB	Output is correct
31	Correct	186 ms	213492 KB	Output is correct
32	Correct	191 ms	213468 KB	Output is correct
33	Correct	193 ms	213496 KB	Output is correct
34	Correct	205 ms	213444 KB	Output is correct
35	Correct	217 ms	213584 KB	Output is correct
36	Correct	222 ms	213508 KB	Output is correct
37	Correct	217 ms	213624 KB	Output is correct
38	Correct	242 ms	213496 KB	Output is correct
39	Correct	207 ms	213560 KB	Output is correct
40	Correct	201 ms	213468 KB	Output is correct
41	Correct	224 ms	213624 KB	Output is correct
42	Correct	210 ms	213496 KB	Output is correct
43	Correct	217 ms	213520 KB	Output is correct
44	Correct	191 ms	213700 KB	Output is correct
45	Correct	207 ms	213548 KB	Output is correct
46	Correct	195 ms	213496 KB	Output is correct
47	Correct	197 ms	213524 KB	Output is correct
48	Correct	231 ms	213624 KB	Output is correct
49	Correct	192 ms	213496 KB	Output is correct
50	Correct	237 ms	213636 KB	Output is correct
51	Correct	214 ms	213496 KB	Output is correct
52	Correct	199 ms	213496 KB	Output is correct
53	Correct	206 ms	213556 KB	Output is correct
54	Correct	226 ms	213540 KB	Output is correct
55	Correct	225 ms	213516 KB	Output is correct
56	Correct	217 ms	213508 KB	Output is correct
57	Correct	200 ms	213600 KB	Output is correct
58	Correct	263 ms	215856 KB	Output is correct
59	Correct	531 ms	237824 KB	Output is correct
60	Correct	533 ms	237964 KB	Output is correct
61	Correct	534 ms	237880 KB	Output is correct
62	Correct	205 ms	213496 KB	Output is correct
63	Correct	496 ms	237016 KB	Output is correct
64	Runtime error	316 ms	263168 KB	Execution killed with signal 9 (could be triggered by violating memory limits)
65	Halted	0 ms	0 KB	-

답안 #97979

Compilation message

Subtask #1 13.0 / 13.0

Subtask #2 20.0 / 20.0

Subtask #3 0 / 67.0

Subtask #1
13.0 / 13.0

Subtask #2
20.0 / 20.0

Subtask #3
0 / 67.0