1020. 飞地的数量

class Solution {
public:
    int dir[4][2]={1,0,0,1,-1,0,0,-1};
    int ans=0;
    void bfs(vector>& grid,vector >&flag,int x,int y){
        queue >q;
        q.push({x,y});
        flag[x][y]=true;
        ans++;
        
        while(!q.empty()){
            pairp=q.front();
            q.pop();
            int nx=p.first;
            int ny=p.second;
            grid[nx][ny]=0;
        for(int i=0;i<4;i++){
            int xx=nx+dir[i][0];
            int yy=ny+dir[i][1];
            if(xx<0||xx>=grid.size()||yy<0||yy>=grid[0].size())continue;
            if(grid[xx][yy]==1&&flag[xx][yy]==false){
                q.push({xx,yy});
                flag[xx][yy]=true;
                ans++;
            }
        }
        }
    }
    int numEnclaves(vector>& grid) {
        int n=grid.size();
        int m=grid[0].size();
        vector >flag=vector >(n,vector(m,false));
        for(int i=0;i