1#include <vector>
2#include <queue>
3using namespace std;
4
5class Solution {
6public:
7    vector<vector<int>> findFarmland(vector<vector<int>>& land) {
8        int m = land.size();
9        int n = land[0].size();
10        vector<vector<bool>> visited(m, vector<bool>(n, false));
11        vector<vector<int>> results;
12        
13        for (int i = 0; i < m; ++i) {
14            for (int j = 0; j < n; ++j) {
15                if (land[i][j] == 1 && !visited[i][j]) {
16                    int minRow = i, minCol = j, maxRow = i, maxCol = j;
17                    queue<pair<int, int>> que;
18                    que.push({i, j});
19                    visited[i][j] = true;
20
21                    while (!que.empty()) {
22                        auto [r, c] = que.front();
23                        que.pop();
24                        maxRow = max(maxRow, r);
25                        maxCol = max(maxCol, c);
26
27                        vector<pair<int, int>> directions = {{0, 1}, {1, 0}};
28                        for (auto &[dr, dc] : directions) {
29                            int newRow = r + dr, newCol = c + dc;
30                            if (newRow < m && newCol < n && land[newRow][newCol] == 1 && !visited[newRow][newCol]) {
31                                visited[newRow][newCol] = true;
32                                que.push({newRow, newCol});
33                            }
34                        }
35                    }
36                    results.push_back({minRow, minCol, maxRow, maxCol});
37                }
38            }
39        }
40
41        return results;
42    }
43};