백준/백준-C++
10026번: 적록색약
Beabletoet
2018. 2. 5. 14:51
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 | #include<cstdio> using namespace std; void cnt(int y, int x, int n, char(*c)[101], char h); int dx[4] = { -1,0,1,0 }; int dy[4] = { 0,1,0,-1 }; int main() { int n, ans[2] = { 0,0 }; char c1[100][101], c2[100][101]; scanf("%d", &n); for (int i = 0; i < n; ++i) { scanf("%s", &c1[i]); for (int j = 0; j < n; ++j) if (c1[i][j] != 'G') c2[i][j] = c1[i][j]; else c2[i][j] = 'R'; } for (int i = 0; i < n; ++i) for (int j = 0; j < n; ++j) { if (c1[i][j] != 'X') { cnt(i, j, n, c1, c1[i][j]); ++ans[0]; } if (c2[i][j] != 'X') { cnt(i, j, n, c2, c2[i][j]); ++ans[1]; } } printf("%d %d",ans[0], ans[1]); } void cnt(int y, int x, int n, char(*c)[101], char h) { int k, j; c[y][x] = 'X'; for (int i = 0; i < 4; ++i) { k = y + dy[i]; j = x + dx[i]; if (k > -1 && k < n && j > -1 && j < n) if (c[k][j] == h) cnt(k, j, n, c, h); } } | cs |