Sicily 1114 Food Cubes

广度优先搜索在三维空间上的扩展，题目本身难度不大，但是在写的时候有个判断条件没有考虑仔细，多刷了好几次提交，几乎崩溃。

#include <iostream>
#include <deque>
#include <memory.h>
using namespace std;
int data[105][105][105];
bool is_valid( int x, int y, int z ) {
    if ( x>=0&&x<=101&&y>=0&&y<=101&&z>=0&&z<=101 )
	    return true;
    return false; 
}
struct coor {
    int x;
    int y;
    int z;
};
int main()
{
    int t,m,x,y,z,i,j,k,ctr;
    deque<struct coor> temp;
    struct coor qq,pp;


    cin >> t;
    while ( t-- ) {
        cin >> m;
        ctr=0;
        memset(data,0,105*105*105*sizeof(int));
        for ( i=0;i<m;i++ ) {
            cin >> x >> y >> z;
            data[x][y][z]=1;
        }
        for ( x=1;x<=100;x++ ) {
            for ( y=1;y<=100;y++ ) {
                for ( z=1;z<=100;z++ ) {
                    if ( data[x][y][z]==0 ) {
                        ctr++;
                       qq.x=x;
                       qq.y=y;
                       qq.z=z;
                       temp.push_back(qq);
                        data[x][y][z]=1;
                        while (!temp.empty()) {
                            pp=temp.front();
                            i=pp.x;
                            j=pp.y;
                            k=pp.z;
                            temp.pop_front();
                           // tempy.pop_front();
                            //tempz.pop_front();
                            if ( is_valid(i+1,j,k)&&data[i+1][j][k]==0 ) {
                                data[i+1][j][k]=1;
                                qq.x=i+1;
                                qq.y=j;
                                qq.z=k;
                                temp.push_back(qq);
                            }
                            if ( is_valid(i,j+1,k)&&data[i][j+1][k]==0 ) {
                                data[i][j+1][k]=1;
                                qq.x=i;
                                qq.y=j+1;
                                qq.z=k;
                                temp.push_back(qq);
                            }
                            if ( is_valid(i,j,k+1)&&data[i][j][k+1]==0 ) {
                                data[i][j][k+1]=1;
                                qq.x=i;
                                qq.y=j;
                                qq.z=k+1;
                                temp.push_back(qq);
                            }
                           if ( is_valid(i-1,j,k)&&data[i-1][j][k]==0 ) {
                                data[i-1][j][k]=1;
                                qq.x=i-1;
                                qq.y=j;
                                qq.z=k;
                                temp.push_back(qq);
                            }
                            if ( is_valid(i,j-1,k)&&data[i][j-1][k]==0 ) {
                                data[i][j-1][k]=1;
                                qq.x=i;
                                qq.y=j-1;
                                qq.z=k;
                                temp.push_back(qq);
                            }
                            if ( is_valid(i,j,k-1)&&data[i][j][k-1]==0 ) {
                                data[i][j][k-1]=1;
                                qq.x=i;
                                qq.y=j;
                                qq.z=k-1;
                                temp.push_back(qq);
                            }
                        }
                    }
                }
            }
        }
        cout << ctr-1 << endl;
    }
//  system("pause"); 
    return 0;
}