UVA297

Quadtrees

A quadtree is a representation format used to encode images. The fundamental ideabehind the quadtree is that any image can be split into four quadrants. Each quadrant mayagain be split in four sub quadrants, etc. In the quadtree, the image is represented by aparent node, while the four quadrants are represented by four child nodes, in a predeterminedorder.

Of course, if the whole image is a single color, it can be represented by a quadtree consistingof a single node. In general, a quadrant needs only to be subdivided if it consists of pixels ofdifferent colors. As a result, the quadtree need not be of uniform depth.

A modern computer artist works with black-and-white images of units, for a totalof 1024 pixels per image. One of the operations he performs is adding two images together,to form a new image. In the resulting image a pixel is black if it was black in at least one ofthe component images, otherwise it is white.

This particular artist believes in what he calls the preferred fullness:for an image to beinteresting (i.e. to sell for big bucks) the most important property is the number of filled(black) pixels in the image. So, before adding two images together, he would like to knowhow many pixels will be black in the resulting image. Your job is to write a program that,given the quadtree representation of two images, calculates the number of pixels that areblack in the image, which is the result of adding the two images together.

In the figure, the first example is shown (from top to bottom) as image, quadtree, pre-order string (defined below) and number of pixels. The quadrant numbering is shown at thetop of the figure.

Input Specification

The first line of input specifies the number of test cases (N) your program has to process.

The input for each test case is two strings, each string on its own line. The string is thepre-order representation of a quadtree, in which the letter 'p' indicates a parent node, theletter 'f' (full) a black quadrant and the letter 'e' (empty) a white quadrant. It is guaranteedthat each string represents a valid quadtree, while the depth of the tree is not more than 5(because each pixel has only one color).

Output Specification

For each test case, print on one line the text 'There are X black pixels.', where X is the number of black pixels in the resulting image.

Example Input

3
ppeeefpffeefe
pefepeefe
peeef
peefe
peeef
peepefefe

Example Output

There are 640 black pixels.
There are 512 black pixels.
There are 384 black pixels.

题目的意思是建两棵四叉树，如果是ｐ，就说明这个节点下面还有四个节点，如果是ｅ代表是白色，是ｆ代表是黑色，输入是按照ｄｆｓ给的。。所以可以在建树的同时直接ｄｆｓ搜索因为最大是１０２４，所以就当作有１０２４个点，第一层的黑点一个代表１０２４，第二层一个代表256．所以在每次递归到下一层，要建四棵树的时候，都要把范围分成四份给下一层。。两棵树黑点的标记用同一个数组，自然就叠加了。。。

ＡＣ代码：