UVA - 297 Quadtrees
来源:互联网 发布:不稳定排序算法有哪些 编辑:程序博客网 时间:2024/06/05 19:28
Description
A quadtree is a representation format used to encode images. The fundamental idea behind the quadtree is that any image can be split into four quadrants. Each quadrant may again be split in four sub quadrants, etc. In the quadtree, the image is represented by a parent node, while the four quadrants are represented by four child nodes, in a predetermined order.
Of course, if the whole image is a single color, it can be represented by a quadtree consisting of a single node. In general, a quadrant needs only to be subdivided if it consists of pixels of different 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 total of 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 of the component images, otherwise it is white.
This particular artist believes in what he calls the preferred fullness: for an image to be interesting (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 know how 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 are black 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 the top 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 the pre-order representation of a quadtree, in which the letter 'p' indicates a parent node, the letter 'f' (full) a black quadrant and the letter 'e' (empty) a white quadrant. It is guaranteed that 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.', whereX is the number of black pixels in the resulting image.
Example Input
3ppeeefpffeefepefepeefepeeefpeefepeeefpeepefefe
Example Output
There are 640 black pixels.There are 512 black pixels.There are 384 black pixels.
分析:四分树比较特殊,只需给出先序遍历就能确定整棵树。只需要编写 画出来 的过程,边画边统计即可。
#include <cstdio>#include <cstring>const int len = 32;const int maxn = 1024 + 10;char s[maxn];int buf[len][len];int cnt;void draw(char* s, int& p, int r, int c, int w) {char ch = s[p++];if(ch == 'p') {draw(s, p, r, c+w/2, w/2);draw(s, p, r, c, w/2);draw(s, p, r+w/2, c, w/2);draw(s, p, r+w/2, c+w/2, w/2);}else if(ch=='f') {for(int i=r; i<r+w; i++)for(int j=c; j<c+w; j++)if(buf[i][j] == 0) { buf[i][j] = 1; cnt++; }}}int main(){int T;scanf("%d",&T);while(T--) {memset(buf, 0, sizeof(buf));cnt = 0;for(int i=0; i<2; i++) {scanf("%s",s);int p = 0;draw(s, p, 0, 0, len);}printf("There are %d black pixels.\n", cnt);} return 0;}
- uva 297 - Quadtrees
- uva 297 Quadtrees
- uva 297 - Quadtrees
- Uva 297 - Quadtrees
- UVA 297 - Quadtrees
- uva 297 Quadtrees
- UVA 297 - Quadtrees
- dfs uva-297-Quadtrees
- UVa 297 - Quadtrees
- UVA 297 Quadtrees
- uva-297 Quadtrees
- uva 297 Quadtrees
- UVa 297 - Quadtrees
- 297 - Quadtrees (UVa)
- uva 297 Quadtrees
- UVa 297 - Quadtrees
- UVA 297 - Quadtrees
- uva 297 Quadtrees
- LINUX 进程调度学习
- Tomcat 自启动环境参数的设置及 Linux 脚本的启动顺序
- ASP.NET 4.0尚未在 Web 服务器上注册 解决方法
- 再回首(三):野指针产生原因及解决方案
- 欢迎使用CSDN-markdown编辑器
- UVA - 297 Quadtrees
- iOS 中的 NSTimer
- URAL 1136 Parliament
- Device Tree(二):基本概念
- 在myEclipse上,基于jetty的android服务端环境配置
- 一、break和return在多层for循环中的作用
- 双链表的操作java版本
- Spinner的简单应用
- 设双链表表示的线性表L=(a1,a2,a3.....an)将L改造为L=(a1,a3,....an...a4,a2)