#include <bits/stdc++.h>
using namespace std;
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
int main(){
int n, m;
cin >> n >> m;
vector<string> a(n);
for (int i = 0; i < n; i ++) cin >> a[i];
char cur = a[0][0];
int graph[n][m];
for (int i = 0; i < n; i ++){
for (int j = 0; j < m; j ++){
if (a[i][j] == cur) graph[i][j] = 1;
else if (a[i][j] == '.') graph[i][j] = 0;
else graph[i][j] = 2;
}
}
int ans = 1;
bool add = false;
for (int i = 0; i < n; i ++) for (int j = 0; j < m; j ++) if (graph[i][j] == 2) add = true;
if (add) ans ++;
add = false;
bool vis[n][m];
memset(vis, false, sizeof(vis));
vis[0][0] = true;
queue<pair<int, int> > que;
que.push(make_pair(0, 0));
while(! que.empty()){
pair<int, int> p = que.front();
que.pop();
for (int i = 0; i < 4; i ++){
int x = p.first + dx[i];
int y = p.second + dy[i];
if (x >= 0 && x < n && y >= 0 && y < m && ! vis[x][y]){
vis[x][y] = true;
que.push(make_pair(x, y));
}
}
}
for (int i = 0; i < n; i ++){
for (int j = 0; j < m; j ++){
if (graph[i][j] == 1 && ! vis[i][j]) {
add = true;
}
}
}
if (add) ans ++;
cout << ans << endl;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
16 ms |
2124 KB |
Output isn't correct |
| 2 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
| 3 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
| 4 |
Incorrect |
10 ms |
1328 KB |
Output isn't correct |
| 5 |
Incorrect |
6 ms |
844 KB |
Output isn't correct |
| 6 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
| 7 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
| 8 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
| 9 |
Incorrect |
2 ms |
332 KB |
Output isn't correct |
| 10 |
Incorrect |
4 ms |
716 KB |
Output isn't correct |
| 11 |
Incorrect |
4 ms |
460 KB |
Output isn't correct |
| 12 |
Incorrect |
7 ms |
844 KB |
Output isn't correct |
| 13 |
Incorrect |
5 ms |
844 KB |
Output isn't correct |
| 14 |
Incorrect |
6 ms |
844 KB |
Output isn't correct |
| 15 |
Incorrect |
16 ms |
2252 KB |
Output isn't correct |
| 16 |
Incorrect |
16 ms |
2124 KB |
Output isn't correct |
| 17 |
Incorrect |
15 ms |
2124 KB |
Output isn't correct |
| 18 |
Incorrect |
9 ms |
1436 KB |
Output isn't correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
5 ms |
688 KB |
Output isn't correct |
| 2 |
Incorrect |
89 ms |
11840 KB |
Output isn't correct |
| 3 |
Incorrect |
1048 ms |
123052 KB |
Output isn't correct |
| 4 |
Incorrect |
206 ms |
29508 KB |
Output isn't correct |
| 5 |
Incorrect |
524 ms |
64552 KB |
Output isn't correct |
| 6 |
Incorrect |
991 ms |
122960 KB |
Output isn't correct |
| 7 |
Incorrect |
4 ms |
588 KB |
Output isn't correct |
| 8 |
Incorrect |
4 ms |
684 KB |
Output isn't correct |
| 9 |
Incorrect |
4 ms |
716 KB |
Output isn't correct |
| 10 |
Incorrect |
2 ms |
460 KB |
Output isn't correct |
| 11 |
Incorrect |
4 ms |
588 KB |
Output isn't correct |
| 12 |
Incorrect |
2 ms |
464 KB |
Output isn't correct |
| 13 |
Incorrect |
91 ms |
11852 KB |
Output isn't correct |
| 14 |
Incorrect |
50 ms |
7228 KB |
Output isn't correct |
| 15 |
Incorrect |
57 ms |
7968 KB |
Output isn't correct |
| 16 |
Incorrect |
37 ms |
4812 KB |
Output isn't correct |
| 17 |
Incorrect |
230 ms |
31812 KB |
Output isn't correct |
| 18 |
Incorrect |
222 ms |
31300 KB |
Output isn't correct |
| 19 |
Incorrect |
208 ms |
29448 KB |
Output isn't correct |
| 20 |
Incorrect |
191 ms |
27144 KB |
Output isn't correct |
| 21 |
Incorrect |
580 ms |
66752 KB |
Output isn't correct |
| 22 |
Incorrect |
504 ms |
64452 KB |
Output isn't correct |
| 23 |
Incorrect |
492 ms |
55256 KB |
Output isn't correct |
| 24 |
Incorrect |
528 ms |
65516 KB |
Output isn't correct |
| 25 |
Incorrect |
1042 ms |
123084 KB |
Output isn't correct |
| 26 |
Correct |
685 ms |
85648 KB |
Output is correct |
| 27 |
Incorrect |
928 ms |
122824 KB |
Output isn't correct |
| 28 |
Incorrect |
1016 ms |
122968 KB |
Output isn't correct |
| 29 |
Incorrect |
1241 ms |
122904 KB |
Output isn't correct |
| 30 |
Incorrect |
947 ms |
120812 KB |
Output isn't correct |
| 31 |
Incorrect |
682 ms |
72684 KB |
Output isn't correct |
| 32 |
Incorrect |
1039 ms |
123032 KB |
Output isn't correct |
