# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
209980 | 2020-03-16T07:44:00 Z | SamAnd | Emacs (COCI20_emacs) | C++17 | 5 ms | 404 KB |
#include <bits/stdc++.h> using namespace std; const int N = 102; const int xx[4] = {0, 1, 0, -1}; const int yy[4] = {1, 0, -1, 0}; int n, m; char a[N][N]; bool c[N][N]; void dfs(int x, int y) { if (c[x][y]) return; c[x][y] = true; for (int i = 0; i < 4; ++i) { int hx = x + xx[i]; int hy = y + yy[i]; if (hx >= 0 && hx < n && hy >= 0 && hy < m && a[hx][hy] == '*') dfs(hx, hy); } } int main() { scanf("%d%d", &n, &m); for (int i = 0; i < n; ++i) scanf(" %s", a[i]); int ans = 0; for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { if (a[i][j] == '*' && !c[i][j]) { ++ans; dfs(i, j); } } } printf("%d\n", ans); return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 376 KB | Output is correct |
2 | Correct | 5 ms | 404 KB | Output is correct |
3 | Correct | 5 ms | 380 KB | Output is correct |
4 | Correct | 5 ms | 256 KB | Output is correct |
5 | Correct | 5 ms | 376 KB | Output is correct |
6 | Correct | 5 ms | 376 KB | Output is correct |
7 | Correct | 5 ms | 376 KB | Output is correct |
8 | Correct | 5 ms | 376 KB | Output is correct |
9 | Correct | 5 ms | 376 KB | Output is correct |
10 | Correct | 5 ms | 376 KB | Output is correct |