acm培训搜索图论

A


#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#include<map>
using namespace std;
//#define Max(a,b)(a>b?a:b)
int G[105][10];
int n;
int step[105][10]; //step[i][j]:当前编号i的正方体距离第一个正方体j方向的偏移量。
map<int,int>pos;
int bfs()
{
 queue<int>q;
 int vis[105]={0};
 q.push(1); //push的是映射过的i
 vis[1]=1;
 int i,j;
 while(!q.empty())
 {
  int now=q.front();
  q.pop();
  for(i=1;i<=8;i++)
  {
   int next=pos[G[now][i]];
   if(G[now][i]&&pos[G[next][(i%2==0?(i-1):(i+1))]]!=now) //?
    return 0;

   if(G[now][i]&&!vis[next])
   {
    for(j=1;j<=8;j++)
     step[next][j]=step[now][j];
    step[next][i]=step[now][i]+1;
    q.push(next);
    vis[next]=1;
   }
  }
 }
 for(i=1;i<=n;i++)
  if(!vis[i])
   return 0;
 return 1;
}
int main()
{
// freopen("C:\\1.txt","r",stdin);
 int t;
 cin>>t;
 int i,j;
 while(t--)
 {
  memset(G,0,sizeof(G));
  memset(step,0,sizeof(step));
  pos.clear();
  cin>>n;
  for(i=1;i<=n;i++)
  {
   int bianhao;