Contest1290/J.cpp

#include<bits/stdc++.h>

using namespace std;
int a[500][500];
int n, m;

void input() {
    cin >> n >> m;
    for (int i = 0; i < n; i++)for (int j = 0; j < m; j++)cin >> a[i][j];
}

bool ok() {
    for (int i = 0; i < n; i++)for (int j = 0; j < m; j++)if (a[i][j])return false;
    return true;
}

void solve() {
    input();
    int areas = 0, Max = 0;
    while (!ok()) {
        int cnt = 0;
        queue<pair<int, int>> Q;//创建一个队列
        ///Q.push(make_pair(0,0));//起点加入队列
        //a[0][0]=0;
        int X = 0, Y = 0;
        for (int i = 0; i < n; i++)
            for (int j = 0; j < m; j++)
                if (a[i][j]) {
                    X = i;
                    Y = j;
                    break;//遇到1就停下
                }
        Q.push(make_pair(X, Y));
        a[X][Y] = 0;
        while (Q.size()) {
            pair<int, int> cur = Q.front();//获得队列的第一个元素
            int x = cur.first, y = cur.second;
            for (int dx = -1; dx <= 1; ++dx)
                for (int dy = -1; dy <= 1; ++dy) { //按照宽度去扩展
                    if (abs(dx - dy) != 1)continue;
                    int nx = x + dx, ny = y + dy;
                    if (nx < 0 || nx > n - 1 || ny < 0 || ny > n - 1 || a[nx][ny] == 0)continue;
                    Q.push(make_pair(nx, ny));
                    a[nx][ny] = 0;
                }
            //cout<<cur.first<<cur.second<<endl;//计数
            ++cnt;
            Q.pop();//出队
        }
        Max = max(cnt, Max);
    }
    cout << Max << endl;
}

int main() {
    //freopen("a.in","r",stdin);
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}