Created
May 26, 2020 00:44
-
-
Save kenjiSpecial/6279a9ae05a0b29783a25427ba769584 to your computer and use it in GitHub Desktop.
Lake Counting http://poj.org/problem?id=2386 深さ優先探索(DFS)
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <bits/stdc++.h> | |
using namespace std; | |
#define rep(i, n) for (int i = 0; i < (n); ++i) | |
const int INF = 1001001001; | |
void dfs(vector<vector<string>> &vect, int x, int y, int N, int M) { | |
vect[x][y] = "."; | |
for (int dx = -1; dx <= 1; dx++) { | |
for (int dy = -1; dy <= 1; dy++) { | |
int nx = x + dx; | |
int ny = y + dy; | |
if (0 <= nx && nx < N && 0 <= ny && ny < M) { | |
if (vect[nx][ny] == "W") { | |
dfs(vect, nx, ny, N, M); | |
} | |
} | |
} | |
} | |
} | |
int main() { | |
int N; | |
int M; | |
cin >> N >> M; | |
vector<vector<string>> data(N, vector<string>(M)); | |
// rep(i, vect.size()) cout << vect[i] << endl; | |
rep(i, N) { | |
string inputS; | |
cin >> inputS; | |
rep(j, M) { data.at(i).at(j) = inputS.at(j); } | |
} | |
int res = 0; | |
rep(i, N) { | |
rep(j, M) { | |
if (data.at(i).at(j) == "W") { | |
dfs(data, i, j, N, M); | |
res++; | |
} | |
} | |
} | |
rep(i, N) { | |
rep(j, M) { cout << data[i][j]; } | |
} | |
cout << res << endl; | |
return 0; | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment