[Luogu] 家族

https://www.luogu.org/problemnew/show/1767

字符串的读入有点麻烦

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <iostream>

using namespace std;
const int N = ;

#define yxy getchar()

char A[N][N << ];
int n, Answer;
int Vis[N][N << ];
struct Node{int x, y;};
Node Queue[N * N];

inline int read(){
    int x = ; char c = yxy;
    while(c < '' || c > '') c = yxy;
    while(c >= '' && c <= '') x = x *  + c - '', c = yxy;
    return x;
}

void Bfs(int x, int y){
    int T = , H = ;
    Node now; now.x = x, now.y = y;
    Queue[H] = now;
    while(H <= T){
        Node topp = Queue[H ++];
        int X = topp.x, Y = topp.y; Node nxt;
        Vis[X][Y] = ;
        if(!Vis[X][Y + ]) {nxt.x = X, nxt.y = Y + ; Queue[++ T] = nxt;}
        if(!Vis[X][Y - ]) {nxt.x = X, nxt.y = Y - ; Queue[++ T] = nxt;}
        if(!Vis[X + ][Y]) {nxt.x = X + , nxt.y = Y; Queue[++ T] = nxt;}
        if(!Vis[X - ][Y]) {nxt.x = X - , nxt.y = Y; Queue[++ T] = nxt;}
    }
}

int main()
{
    n = read();
    memset(Vis, -, sizeof Vis);
    for(int i = ; i <= n; i ++) gets(A[i] + );
    for(int i = ; i <= n; i ++) {
        int len = strlen(A[i] + );
        for(int j = ; j <= len; j ++){
            Vis[i][j] = ;
            if(A[i][j] < 'a' || A[i][j] > 'z') Vis[i][j] = ;
        }
    }
    for(int i = ; i <= n; i ++) {
        int len = strlen(A[i] + );
        for(int j = ; j <= len; j ++){
            if(!Vis[i][j]) Answer ++, Bfs(i, j);
        }
    }
    printf("%d", Answer);
    return ;
}