From e4e866f5d00354a1ec9d32bc34b9a2b19e1289cb Mon Sep 17 00:00:00 2001
From: cxx <2103761762@qq.com>
Date: Thu, 23 Oct 2025 13:33:09 +0000
Subject: [PATCH] add 11.

Signed-off-by: cxx <2103761762@qq.com>
---
 11 | 45 +++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 45 insertions(+)
 create mode 100644 11

diff --git a/11 b/11
new file mode 100644
index 0000000..afa3609
--- /dev/null
+++ b/11
@@ -0,0 +1,45 @@
+#include <bits/stdc++.h>
+using namespace std;
+int n,m;
+const int dx[4]={-1,0,1,0};
+const int dy[4]={0,1,0,-1};
+
+void bfs(vector<vector<int>>& grid,int x,int y) {
+    queue<pair<int, int>> q;
+    q.push({x, y});
+    grid[x][y]=0;
+    while (!q.empty()) {
+        int cx=q.front().first;
+		int cy=q.front().second;
+        q.pop();
+        for(int i=0;i<4;i++) {
+            int nx=cx+dx[i];
+            int ny=cy+dy[i];
+            if (nx>=0&&nx<n&&ny>=0&&ny<m&&grid[nx][ny]==1) {
+                grid[nx][ny]=0;
+                q.push({nx, ny});
+            }
+        }
+    }
+}
+
+int main() {
+    cin>>n>>m;
+    vector<vector<int>> grid(n, vector<int>(m));
+    for(int i=0;i<n;i++) {
+        for (int j=0;j<m;j++) {
+            cin>>grid[i][j];
+        }
+    }
+    int count=0;
+    for (int i=0;i<n;i++) {
+        for (int j=0;j<m;j++) {
+            if (grid[i][j]==1){
+                count++;
+                bfs(grid,i,j);
+            }
+        }
+    }
+    cout<<count<<endl;
+    return 0;
+}
\ No newline at end of file
-- 
Gitee