第二点的数据下载下来的，是100×100的，但是这点数据怎么会内存超限，是我哪里写的有问题吗。

#include <bits/stdc++.h>

#define fi first
#define se second
#define pb push_back
#define sz(x) ((int) x.size())
#define all(x) (x).begin(), (x).end()

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pa;

const int N = 105;

int n, m;
int dx[8] = {-1, -1, -1, 0, 1, 1, 1, 0};
int dy[8] = {-1, 0, 1, 1, 1, 0, -1, -1};
string str[N];

void bfs(pa v) {
    queue<pa> q;
    q.push(v);
    while (!q.empty()) {
        pa now = q.front(); q.pop();
        str[now.fi][now.se] = '.';
        for (int i = 0; i < 8; i++) {
            int x = now.fi + dx[i], y = now.se + dy[i];
            if (x < 0 || y < 0 || x >= n || y >= m || str[x][y] == '.') continue;
            q.push(make_pair(x, y));
        }
    }
}

int main() {
    cin >> n >> m;
    for (int i = 0; i < n; i++) cin >> str[i];
    int ans = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (str[i][j] == 'W') { bfs(make_pair(i, j)); ans++; }
        }
    }
    cout << ans;
    return 0;
}