제출 #291675

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
291675		reymontada61	Dango Maker (JOI18_dango_maker)	C++14	13 / 100	1 ms	640 KiB

dango_maker

#include <bits/stdc++.h>
using namespace std;

const int MXN = 3005;
int n, m;
int grid[MXN][MXN];
int horizontal[MXN][MXN];
int vertical[MXN][MXN];
int hnum, vnum;

int par[MXN * MXN];
int gs[MXN * MXN];
int tgs[MXN * MXN];

int parent(int x) {
	if (par[x] == x) return x;
	return par[x] = parent(par[x]);
}

void connect(int a, int b) {
	a = parent(a);
	b = parent(b);
	if (a == b) return;
	gs[a] += gs[b];
	tgs[a] += tgs[b];
	par[b] = a;
}

signed main() {

	cin >> n >> m;
	for (int i=1; i<=n; i++) {
		string s;
		cin >> s;
		for (int j=1; j<=m; j++) {
			if (s[j-1] == 'R') grid[i][j] = 1;
			if (s[j-1] == 'G') grid[i][j] = 2;
			if (s[j-1] == 'W') grid[i][j] = 3;
		}
	}
	
	
	for (int i=1; i<=n; i++) {
		for (int j=1; j<=m; j++) {
			if (grid[i][j] == 1 && grid[i][j+1] == 2 && grid[i][j+2] == 3) {
				hnum++;
				horizontal[i][j] = hnum;
			}
			if (grid[i][j] == 1 && grid[i+1][j] == 2 && grid[i+2][j] == 3) {
				hnum++;
				vertical[i][j] = hnum;
				tgs[hnum] = 1;
			}
		}
	}
	
	for (int i=0; i<=hnum; i++) par[i] = i, gs[i] = 1;
	
	for (int i=1; i<=n; i++) {
		for (int j=1; j<=m; j++) {
			int c = grid[i][j] - 1;
			if (vertical[i-c][j] > 0 && horizontal[i][j-c] > 0) {
				int x = horizontal[i][j-c];
				int y = vertical[i-c][j];
				connect(x, y);
			}
		}
	}
	
	int x = 0;
	
	for (int i=1; i<=hnum; i++) {
		if (par[i] == i) {
			x += max(gs[i] - tgs[i], tgs[i]);
		}
	}
	
	cout << x << endl;

}

• Subtask 1: 13 / 13
• Subtask 2: 0 / 20
• Subtask 3: 0 / 67