# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
484886 | Olympia | Tracks in the Snow (BOI13_tracks) | C++17 | 1513 ms | 1048580 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <vector>
#include <iostream>
#include <cassert>
#include <cmath>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <algorithm>
#include <iomanip>
using namespace std;
vector<vector<bool>> hasVisited;
vector<string> grid;
int R = 0;
int B = 0;
void dfs (int x, int y) {
if (hasVisited[x][y]) {
return;
}
hasVisited[x][y] = true;
R += (grid[x][y] == 'R');
B += (grid[x][y] == 'F');
for (int dx = -1; dx <= 1; dx++) {
for (int dy = -1; dy <= 1; dy++) {
if (dx + x < 0 || dx + x == hasVisited.size() || dy + y < 0 || dy + y == hasVisited[0].size()) {
continue;
}
if (grid[x + dx][y + dy] != '.') {
dfs(dx + x, dy + y);
}
}
}
}
int main() {
int n, m;
cin >> n >> m;
hasVisited.resize(n), grid.resize(n);
for (int i = 0; i < n; i++) {
hasVisited[i].resize(m);
cin >> grid[i];
for (int j = 0; j < m; j++) {
hasVisited[i][j] = false;
}
}
int ans = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (!hasVisited[i][j] && grid[i][j] != '.') {
dfs(i, j);
//cout << R << " " << B << '\n';
//R = B = 0;
ans += (bool)R + (bool)B;
}
}
}
cout << ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |