四叉树 bnuoj

点击打开题目链接

建树+广搜一棵树；最下面有更短代码（很巧妙）。

 #include<iostream>
 #include<stdio.h>
 #include<queue>
 #include<string.h>
 #include<algorithm>

 using namespace std;

 int maze[][];
 struct node
 {
     int num;
     node *next[];
 };
 void init_tree(node *root)
 {
     int i;
     for(i=; i<; i++)
         root->next[i] = NULL;
 }
 void built(int istart,int iend,int jstart,int jend,node *root)
 {
     int dive,i,j;
     int istart1=istart,iend1=iend,jstart1=jstart,jend1=jend;
     for(dive=; dive<; dive++)
     {
         if(dive==) istart=istart1,iend=istart1+(iend1-istart1+)/-,jstart=jstart1,jend=jstart1+(jend1-jstart1+)/-;
         else if(dive==) istart=istart1,iend=istart1+(iend1-istart1+)/-,jstart=jstart1+(jend1-jstart1+)/,jend=jend1;
         else if(dive==) istart=istart1+(iend1-istart1+)/,iend=iend1,jstart=jstart1,jend=jstart1+(jend1-jstart1+)/-;
         else istart=istart1+(iend1-istart1+)/,iend=iend1,jstart=jstart1+(jend1-jstart1+)/,jend=jend1;
         int flag0=,flag1=,tree_point;
         for(i=istart; i<=iend; i++)
         {
             for(j=jstart; j<=jend; j++)
             {
                 if(maze[i][j]==) flag0=;
                 if(maze[i][j]==) flag1=;
             }
         }
         if(flag0&&flag1) tree_point=;
         else if(flag0&&!flag1) tree_point=;
         else if(!flag0&&flag1) tree_point=;
         node *p;
         p=new node;
         init_tree(p);
         root->next[dive]=p;
         p->num=tree_point;
         if(tree_point==||tree_point==) continue ;
         built(istart,iend,jstart,jend,p);
     }
 }
 void print(node *root)
 {
     node *ss,*tt;
     queue<node*>q;
     q.push(root);
     while(!q.empty())
     {
         ss=q.front();
         int su=ss->num;
         if(su==) printf("");
         else if(su==) printf("");
         else if(su==) printf("");
         q.pop();
         for(int i=; i<; i++)
         {
             if(ss->next[i] !=NULL)
             {
                 tt=ss->next[i];
                 q.push(tt);
             }
         }
     }
     printf("\n");
 }
 int check_map(int n)
 {
     int i,j,sum=;
     for(i=; i<=n; i++)
         for(j=; j<=n; j++)
             sum+=maze[i][j];
     if(sum==n*n) return ;
     else if(sum==) return ;
     else return -;
 }
 void delete_tree(node *root)
 {
     int i;
     for(i=; i<; i++)
     {
         if(root->next[i]!=NULL)
         {
             delete_tree(root->next[i]);
         }
     }
     delete root;
 }
 int main()
 {
     int n;
     while(scanf("%d",&n)!=EOF)
     {
         int i,j;
         memset(maze,,sizeof(maze));
         for(i=; i<=n; i++)
         {
             for(j=; j<=n; j++)
                 scanf("%d",&maze[i][j]);
         }
         int ans=check_map(n);
         if(ans==) printf("00\n");
         else if(ans==) printf("01\n");
         else
         {
             node *tree;
             tree=new node;
             init_tree(tree);
             tree->num=;
             built(,n,,n,tree);
             print(tree);
             delete_tree(tree);
         }
     }
     return ;
 }

短代码：

 #include <cstring>
 #include <vector>
 #include<stack>
 #include<queue>
 #include<cmath>
 #include<algorithm>
 #include<iostream>
 #include<cstring>
 //#define N 10005
 using namespace std;
 int zu[][],n;
 struct sb
 {
     int x,y,x1,y1;
     bool Get()
     {
         int ans=;
         for(int i=x;i<=x1;i++)
             for(int j=y;j<=y1;j++)
             ans+=zu[i][j];
         if(!ans)
             return true;
         if(ans==(x1-x+)*(y1-y+))
             return true;
         return false;
     }
 };
 int main()
 {
     while(scanf("%d",&n)==)
     {
         for(int i=;i<=n;i++)
             for(int j=;j<=n;j++)
             scanf("%d",&zu[i][j]);
 //
             sb s1,s2;
             s1.x=;
             s1.y=;
             s1.x1=n;
             s1.y1=n;
             queue<sb>Q;
             Q.push(s1);
             while(!Q.empty())
             {
                 s1=Q.front();
                 Q.pop();
                 if(s1.Get())
                 {
                     printf("0%d",zu[s1.x1][s1.y1]);
                     continue;
                 }
                 printf("");
                 int xx=(s1.x+s1.x1)/;
                 int yy=(s1.y+s1.y1)/;
                 s2=s1;
                 s2.y1=yy;
                 s2.x1=xx;
                 Q.push(s2);
 //
                 s2=s1;
                 s2.x1=xx;
                 s2.y=yy+;
                 Q.push(s2);
 //
                 s2=s1;
                 s2.x=xx+;
                 s2.y1=yy;
                 Q.push(s2);
 //
                 s2=s1;
                 s2.x=xx+;
                 s2.y=yy+;
                 Q.push(s2);
             }
             printf("\n");
     }
 }