Ps_algorithm/10026bj.cpp at main · chanik-s/Ps_algorithm · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
#include <iostream>
#include <queue>
#include <string>
#include <utility>

using namespace std;
string board[102];
bool vis[102][102];
bool vis2[102][102];
int n;

int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };
queue <pair<int,int> > q1;
queue <pair<int,int> > q2;
int cnt1;
int cnt2;

int main() {

	cin >> n;
	for(int i=0;i<n;i++) {
		cin >> board[i];//RRRBB
		//R과 G는 같은색으로 인식
	}
	//정상
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			if (vis[i][j] == 1) continue;
			//방문 안했으면
			cnt1++;
			vis[i][j] = 1;
			//색 정해주고
			char color = board[i][j]; //R
			q1.push({ i,j });

			while (!q1.empty()) {

				auto cur = q1.front(); q1.pop();
				for (int dir = 0; dir < 4; dir++) {

					int nx = cur.first + dx[dir];
					int ny = cur.second + dy[dir];

					if (nx < 0 || nx >= n || ny < 0 || ny >= n) continue;
					if (vis[nx][ny]||board[nx][ny]!=color) continue;
					vis[nx][ny] = 1; //방문처리
					q1.push({ nx,ny });
				}

			}
		}
	}


	//적록색약
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			if (vis2[i][j] == 1) continue;
			cnt2++;
			//방문 안했으면
			vis2[i][j] = 1;
			//색 정해주고
			//char color2 = board[i][j]; //R
			q2.push({ i,j });

			while (!q2.empty()) {

				auto cur = q2.front(); q2.pop();
				for (int dir = 0; dir < 4; dir++) {

					int nx = cur.first + dx[dir];
					int ny = cur.second + dy[dir];

					if (nx < 0 || nx >= n || ny < 0 || ny >= n) continue;
					if (vis2[nx][ny]) continue;

					if (board[i][j] == 'R') {
						if (board[nx][ny] == 'G'||board[nx][ny]=='R') {
							vis2[nx][ny] = 1;
							q2.push({ nx,ny });
						}
						else {

						}
					}
					else if (board[i][j] == 'G') {

						if (board[nx][ny] == 'G' || board[nx][ny] == 'R') {
							vis2[nx][ny] = 1;
							q2.push({ nx,ny });
						}
						else {

						}
					}
					else { //'B'
						if (board[nx][ny] == board[i][j]) {
							vis2[nx][ny] = 1;
							q2.push({ nx,ny });
						}

					}


				}


			}
		}
	}


	cout << cnt1 << ' ' << cnt2;

	return 0;
}