我也是QWQ
by I_like_play_eggy @ 2024-03-30 22:03:25
@[SymmFz](/user/1067945)
by I_like_play_eggy @ 2024-03-30 22:03:43
```cpp
#include<bits/stdc++.h>
#define maxn 1010
#define maxm 100010
using namespace std;
bool a[maxn][maxn];
int vis[maxn][maxn];
int b[maxm],n,m,k,x,y;
int op[4][2]={1,0,0,1,-1,0,0,-1};
string tmp;
void dfs(int x,int y,int k,int c){
vis[x][y]=k,b[k]++;
for (int i=0;i<4;i++){
int dx=x+op[i][0],dy=y+op[i][1];
if (dx>0 && dx<=n && dy>0 && dy<=n && !vis[dx][dy] && !c==a[dx][dy]){
dfs(dx,dy,k,a[dx][dy]);
}
}
}
int main(){
scanf("%d%d",&n,&m);
for (int i=1;i<=n;i++){
cin>>tmp;
for (int j=0;j<n;j++){
a[i][j+1]=tmp[j]-'0';
}
}
for (int i=1;i<=n;i++){
for (int j=1;j<=n;j++){
if (vis[i][j]) continue;
dfs(i,j,++k,a[i][j]);
}
}
for (int i=1;i<=m;i++){
scanf("%d%d",&x,&y);
printf("%d\n",b[vis[x][y]]);
}
return 0;
}
```
by I_like_play_eggy @ 2024-03-30 22:04:20
求助 #3 WA too
by I_like_play_eggy @ 2024-03-30 22:04:45
难度：黄
实际一做：蓝
by I_like_play_eggy @ 2024-03-30 22:15:23
@[SymmFz](/user/1067945) @[I_like_play_eggy](/user/1126325) 今天一看，沃趣，正常黄题，对比了输出，FC表示无差异
by I_like_play_eggy @ 2024-04-18 12:32:10