Quadtree - ZOJ 1955 四分树

原创 2015年07月08日 16:34:33

Quadtree

Time Limit: 2 Seconds      Memory Limit: 65536 KB

While searching for treasures in an ancient Aztec ruin, Florida Jones (the brother of famous Indiana Jones) stumbles across a papyrus roll lettered with a long string of symbols. There are three different symbols occuring in the string which we will call B, W and Q here.

Being somewhat experienced in cryptography, Florida Jones recognizes the code immediately as the famous Quadtree Encoding Scheme that has been invented 3000 years ago.

With the Quadtree system, secret pictures (like treasure maps) were encoded in the following way: If the whole picture was black, it was encoded by the letter B. If it was completely white, it was encoded by W. If both colors were used (what was usually the case), it was encoded by Qxxxx where each x was a string that recursively encoded one quarter of the picture (in the order top left, top right, bottom left, bottom right). As the Aztecs always used quadratic pictures with n*n pixels where n was a power of two, this method always worked perfectly. 

A 2*2 chess board, for instance, would be encoded as QWBBW, a 4*4 chess board as QQWBBWQWBBWQWBBWQWBBW.

Your job is to decode the quadtree string and output the picture in the XBM format (see output specification).


Input

The input contains an integer n (8 <= n <= 512) on the first line, giving the size of the picture in pixels per row/column. n will always be a power of two. 

On the second line, a string consisting of the letters B, W and Q follows. The string encodes a picture with n*n pixels with the quadtree scheme.


Output

  • On the first line, print "#define quadtree_width n" where n is the picture size given in the input.
  • On the second line, print "#define quadtree_height n" accordingly.
  • On the third line, print "static char quadtree_bits[] = {".
  • Then, print n lines (each one encoding one pixel row of the picture) with n/8 hexadecimal numbers per line.
    Each hexadecimal number is composed of 8 bits that encode 8 pixels from left to right (where the leftmost bit has the value 1 and the rightmost bit has the value 128). The hexadecimal numbers should be printed in the form 0xdd where d is one character of the set { 0,1,2,3,4,5,6,7,8,9,a,b,c,d,e,f }. 
    Example: The 8 pixels WBBBBWWB would be written as 0x9e. (2+4+8+16+128 = 158 = 0x9e) 
    Print a comma after each hexadecimal number.
  • On the last line, print "};".


Sample Input

16
QQWBBWQWBBWQWBBWQWBBW


Sample Output

Note: The comments (enclosed by /* and */) are not part of the output. They should help to explain the XBM format. 

#define quadtree_width 16
#define quadtree_height 16
static char quadtree_bits[] = {
0xf0,0xf0, /* WWWWBBBB WWWWBBBB */
0xf0,0xf0, /* WWWWBBBB WWWWBBBB */
0xf0,0xf0, /* WWWWBBBB WWWWBBBB */
0xf0,0xf0, /* WWWWBBBB WWWWBBBB */
0x0f,0x0f, /* BBBBWWWW BBBBWWWW */
0x0f,0x0f, /* BBBBWWWW BBBBWWWW */
0x0f,0x0f, /* BBBBWWWW BBBBWWWW */
0x0f,0x0f, /* BBBBWWWW BBBBWWWW */
0xf0,0xf0, /* WWWWBBBB WWWWBBBB */
0xf0,0xf0, /* WWWWBBBB WWWWBBBB */
0xf0,0xf0, /* WWWWBBBB WWWWBBBB */
0xf0,0xf0, /* WWWWBBBB WWWWBBBB */
0x0f,0x0f, /* BBBBWWWW BBBBWWWW */
0x0f,0x0f, /* BBBBWWWW BBBBWWWW */
0x0f,0x0f, /* BBBBWWWW BBBBWWWW */
0x0f,0x0f, /* BBBBWWWW BBBBWWWW */
};


题意:在一个n*n的矩阵里,用BWQ表示其内容,对于某一个矩阵,B表示其全是B,W表示其全是W,Q表示其WB都有,其后依照左上,右上,左下,右下的顺序给出这四个子矩阵的内容。

思路:四分树的思想,dfs即可。

AC代码如下:

#include<cstdio>
#include<cstring>
using namespace std;
int n,tree[520][520],pos,len;
char s[1000010];
char trans[30]={'0','1','2','3','4','5','6','7','8','9','a','b','c','d','e','f'};
void dfs(int x,int y,int num)
{
    int i,j,k;
    char c=s[++pos];
    if(c=='Q')
    {
        num/=2;
        dfs(x,y,num);
        dfs(x,y+num,num);
        dfs(x+num,y,num);
        dfs(x+num,y+num,num);
    }
    else
    {
        if(c=='W')
          k=0;
        else
          k=1;
        for(i=x;i<=x+num;i++)
           for(j=y;j<=y+num;j++)
              tree[i][j]=k;
    }
}
void print()
{
    int i,j,k,ret;
    printf("#define quadtree_width %d\n",n);
    printf("#define quadtree_height %d\n",n);
    printf("static char quadtree_bits[] = {\n");
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=n;j+=8)
        {
            ret=0;
            for(k=0;k<8;k++)
               ret+=tree[i][j+k]*(1<<k);
            printf("0x%c%c,",trans[ret/16],trans[ret%16]);
        }
        printf("\n");
    }
    printf("};\n");
}
int main()
{
    int i,j,k;
    while(~scanf("%d",&n))
    {
        scanf("%s",s+1);
        len=strlen(s+1);
        pos=0;
        dfs(1,1,n);
        print();
    }
}



相关文章推荐

ACM zoj 1955(四分树实现)

这是道方阵颜色分割的题目,因而可以用四分树来解决。其实这道题对我来说,难点在于将要分割的颜色提取出来,因为当你遇到Q时说明你要将后面的颜色分成四块,如果在这之中又出现Q的话,那你就要用同样的方法将Q后...

Uniform Grid Quadtree kd树 Bounding Volume Hierarchy R树 搜索

Region 資料結構 :  Uniform Grid 楔子 請你嘗試發掘,這一系列的資料結構是為了解決什麼問題呢? Uniform Grid 嗯,就是方格紙。將整個世界...

QuadTree四叉树实现代码 C#

  • 2014年02月07日 17:29
  • 18KB
  • 下载

HTML5实现3D和2D可视化QuadTree四叉树碰撞检测

QuadTree四叉树顾名思义就是树状的数据结构,其每个节点有四个孩子节点,可将二维平面递归分割子区域。QuadTree常用于空间数据库索引,3D的椎体可见区域裁剪,甚至图片分析处理,我们今天介绍的是...

四叉树和八叉树剔除Quadtree and Octree Culling Alternative

Introduction Traditionally computer graphic applications - particularly applications requiring re...
  • wolf96
  • wolf96
  • 2015年09月03日 12:20
  • 674

四分树切割算法MATLAB代码

  • 2011年01月11日 10:43
  • 463KB
  • 下载

2D空间中使用Quadtree四叉树进行碰撞检测优化

很多游戏中都需要使用碰撞检测算法检测两个物体的碰撞,但通常这些碰撞检测算法都很耗时很容易拖慢游戏的速度。这里我们学习一下使用四叉树来对碰撞检测进行优化,优化的根本是碰撞检测时跳过那些明显离得很远的物体...
  • cordova
  • cordova
  • 2016年12月22日 22:44
  • 1840

HT for Web可视化QuadTree四叉树碰撞检测

QuadTree四叉树顾名思义就是树状的数据结构,其每个节点有四个孩子节点,可将二维平面递归分割子区域。QuadTree常用于空间数据库索引,3D的椎体可见区域裁剪,甚至图片分析处理,我们今天介绍的是...

D3D11进阶教程六之四叉树(QuadTree)

本节教程是关于
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Quadtree - ZOJ 1955 四分树
举报原因:
原因补充:

(最多只允许输入30个字)