oj.uz

답안 #208838

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
208838 2020-03-12T09:38:26 Z Siberian Dango Maker (JOI18_dango_maker) C++14
33 / 100
 538 ms 262148 KB 
#pragma GCC optimize("no-stack-protector")
#pragma comment(linker, "/stack:200000000")
#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
#define all(x) x.begin(), x.end()

template <typename T1, typename T2> inline void chkmin(T1 &x, const T2 & y) {if (x > y) x = y;}
template <typename T1, typename T2> inline void chkmax(T1 &x, const T2 & y) {if (x < y) x = y;}

const int MAXN = 3001;
char table[MAXN][MAXN];
vector<int> g[MAXN * MAXN];
int n, m;

void read() {
	cin >> n >> m;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cin >> table[i][j];
		}
	}
}

bool check_right(int i, int j) {
	return j >= 0 && j + 2 < m && i >= 0 && i < n && table[i][j] == 'R' && table[i][j + 1] == 'G' && table[i][j + 2] == 'W';
}

bool check_down(int i, int j) {
	return j >= 0 && j < m && i >= 0 && i + 2 < n && table[i][j] == 'R' && table[i + 1][j] == 'G' && table[i + 2][j] == 'W';
}

int cnt;

void build() {
	cnt = 0;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			if (!check_down(i, j)) continue;
			if (check_right(i, j)) {
				g[i * m + j].push_back(i * m + j);
			}
			if(check_right(i + 1, j - 1)) {
				g[i * m + j].push_back((i + 1) * m + j - 1);
				//cout << "puhh" << endl;
			}
			if (check_right(i + 2, j - 2)) {
				g[i * m + j].push_back((i + 2) * m + j - 2);
				//cout << "puhh" << endl;
			}
		}
	}
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cnt += check_right(i, j);
			cnt += check_down(i, j);
		}
	}
}

int used[MAXN * MAXN];
int mt[MAXN * MAXN];

bool dfs(int v, int c) {
	if (used[v] == c) return false;
	used[v] = c;
	for (auto i : g[v]) {
		if (mt[i] == -1) {
			mt[i] = v;
			return true;
		}
	}

	for (auto i : g[v]) {
		if (dfs(mt[i], c)) {
			mt[i] = v;
			return true;
		}
	}
	return false;
} 

int ans;

void calc() {
	for (int i = 0; i < n * m; i++) {
		mt[i] = used[i] = -1;
	}
	int c = 0;
	for (int i = 0; i < n * m; i++) {
		dfs(i, c++);
	}
	ans = cnt;
	for (int i = 0; i < n * m; i++) {
		if (mt[i] != -1) {
			ans--;
		}
	}
}

void run() {
	build();
	calc();
}

void write() {
	cout << ans << endl;
}

signed main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	read();
	run();
	write();
	return 0;
}

Compilation message

dango_maker.cpp:2:0: warning: ignoring #pragma comment  [-Wunknown-pragmas]
 #pragma comment(linker, "/stack:200000000")

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 142 ms 211832 KB Output is correct
2 Correct 148 ms 211912 KB Output is correct
3 Correct 140 ms 211832 KB Output is correct
4 Correct 143 ms 211832 KB Output is correct
5 Correct 140 ms 211868 KB Output is correct
6 Correct 144 ms 211960 KB Output is correct
7 Correct 142 ms 211832 KB Output is correct
8 Correct 143 ms 211832 KB Output is correct
9 Correct 144 ms 211836 KB Output is correct
10 Correct 145 ms 211832 KB Output is correct
11 Correct 142 ms 211832 KB Output is correct
12 Correct 144 ms 211832 KB Output is correct
13 Correct 141 ms 211832 KB Output is correct
14 Correct 141 ms 211960 KB Output is correct
15 Correct 144 ms 211836 KB Output is correct
16 Correct 139 ms 211832 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 142 ms 211832 KB Output is correct
2 Correct 148 ms 211912 KB Output is correct
3 Correct 140 ms 211832 KB Output is correct
4 Correct 143 ms 211832 KB Output is correct
5 Correct 140 ms 211868 KB Output is correct
6 Correct 144 ms 211960 KB Output is correct
7 Correct 142 ms 211832 KB Output is correct
8 Correct 143 ms 211832 KB Output is correct
9 Correct 144 ms 211836 KB Output is correct
10 Correct 145 ms 211832 KB Output is correct
11 Correct 142 ms 211832 KB Output is correct
12 Correct 144 ms 211832 KB Output is correct
13 Correct 141 ms 211832 KB Output is correct
14 Correct 141 ms 211960 KB Output is correct
15 Correct 144 ms 211836 KB Output is correct
16 Correct 139 ms 211832 KB Output is correct
17 Correct 147 ms 212032 KB Output is correct
18 Correct 143 ms 211784 KB Output is correct
19 Correct 142 ms 211832 KB Output is correct
20 Correct 143 ms 211832 KB Output is correct
21 Correct 148 ms 211832 KB Output is correct
22 Correct 145 ms 211832 KB Output is correct
23 Correct 140 ms 211832 KB Output is correct
24 Correct 140 ms 211832 KB Output is correct
25 Correct 142 ms 211832 KB Output is correct
26 Correct 145 ms 212008 KB Output is correct
27 Correct 142 ms 211832 KB Output is correct
28 Correct 142 ms 211832 KB Output is correct
29 Correct 141 ms 211836 KB Output is correct
30 Correct 148 ms 211960 KB Output is correct
31 Correct 143 ms 211832 KB Output is correct
32 Correct 143 ms 211832 KB Output is correct
33 Correct 143 ms 212076 KB Output is correct
34 Correct 144 ms 211832 KB Output is correct
35 Correct 143 ms 211832 KB Output is correct
36 Correct 142 ms 211832 KB Output is correct
37 Correct 148 ms 211832 KB Output is correct
38 Correct 147 ms 211912 KB Output is correct
39 Correct 142 ms 211832 KB Output is correct
40 Correct 146 ms 211832 KB Output is correct
41 Correct 142 ms 211960 KB Output is correct
42 Correct 142 ms 211836 KB Output is correct
43 Correct 141 ms 211828 KB Output is correct
44 Correct 147 ms 211832 KB Output is correct
45 Correct 153 ms 211960 KB Output is correct
46 Correct 143 ms 211832 KB Output is correct
47 Correct 145 ms 211832 KB Output is correct
48 Correct 148 ms 211832 KB Output is correct
49 Correct 143 ms 211960 KB Output is correct
50 Correct 144 ms 211832 KB Output is correct
51 Correct 143 ms 211832 KB Output is correct
52 Correct 149 ms 211808 KB Output is correct
53 Correct 148 ms 212088 KB Output is correct

Subtask #3
0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 142 ms 211832 KB Output is correct
2 Correct 148 ms 211912 KB Output is correct
3 Correct 140 ms 211832 KB Output is correct
4 Correct 143 ms 211832 KB Output is correct
5 Correct 140 ms 211868 KB Output is correct
6 Correct 144 ms 211960 KB Output is correct
7 Correct 142 ms 211832 KB Output is correct
8 Correct 143 ms 211832 KB Output is correct
9 Correct 144 ms 211836 KB Output is correct
10 Correct 145 ms 211832 KB Output is correct
11 Correct 142 ms 211832 KB Output is correct
12 Correct 144 ms 211832 KB Output is correct
13 Correct 141 ms 211832 KB Output is correct
14 Correct 141 ms 211960 KB Output is correct
15 Correct 144 ms 211836 KB Output is correct
16 Correct 139 ms 211832 KB Output is correct
17 Correct 147 ms 212032 KB Output is correct
18 Correct 143 ms 211784 KB Output is correct
19 Correct 142 ms 211832 KB Output is correct
20 Correct 143 ms 211832 KB Output is correct
21 Correct 148 ms 211832 KB Output is correct
22 Correct 145 ms 211832 KB Output is correct
23 Correct 140 ms 211832 KB Output is correct
24 Correct 140 ms 211832 KB Output is correct
25 Correct 142 ms 211832 KB Output is correct
26 Correct 145 ms 212008 KB Output is correct
27 Correct 142 ms 211832 KB Output is correct
28 Correct 142 ms 211832 KB Output is correct
29 Correct 141 ms 211836 KB Output is correct
30 Correct 148 ms 211960 KB Output is correct
31 Correct 143 ms 211832 KB Output is correct
32 Correct 143 ms 211832 KB Output is correct
33 Correct 143 ms 212076 KB Output is correct
34 Correct 144 ms 211832 KB Output is correct
35 Correct 143 ms 211832 KB Output is correct
36 Correct 142 ms 211832 KB Output is correct
37 Correct 148 ms 211832 KB Output is correct
38 Correct 147 ms 211912 KB Output is correct
39 Correct 142 ms 211832 KB Output is correct
40 Correct 146 ms 211832 KB Output is correct
41 Correct 142 ms 211960 KB Output is correct
42 Correct 142 ms 211836 KB Output is correct
43 Correct 141 ms 211828 KB Output is correct
44 Correct 147 ms 211832 KB Output is correct
45 Correct 153 ms 211960 KB Output is correct
46 Correct 143 ms 211832 KB Output is correct
47 Correct 145 ms 211832 KB Output is correct
48 Correct 148 ms 211832 KB Output is correct
49 Correct 143 ms 211960 KB Output is correct
50 Correct 144 ms 211832 KB Output is correct
51 Correct 143 ms 211832 KB Output is correct
52 Correct 149 ms 211808 KB Output is correct
53 Correct 148 ms 212088 KB Output is correct
54 Correct 140 ms 211828 KB Output is correct
55 Correct 143 ms 220664 KB Output is correct
56 Correct 148 ms 211964 KB Output is correct
57 Correct 147 ms 217848 KB Output is correct
58 Correct 192 ms 223016 KB Output is correct
59 Runtime error 538 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
60 Halted 0 ms 0 KB -