题意:
看白书
要点:
非二叉树,因为四分树比较特殊(有中间结点这种东西),所以给出先序遍历就可以确定整棵树(因为如果要向下必须要用中间结点,而且中间结点本身没有值),所以只要模拟一个方块的分割就行
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
const int len = 32;
const int maxn = 1024 + 10;
char s[maxn];
int buff[len][len], cnt;void draw(char s[], int &p, int r, int c, int w)//w代表边长,r,c代表小方块左上角坐标
{ //p此时是传递地址会随函数调用而改变char ch = s[p++];if (ch == 'p'){draw(s, p, r, c, w / 2); //递归调用,此时小方块坐标及边长都会改变draw(s, p, r, c + w / 2, 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 (buff[i][j] == 0){buff[i][j] = 1;cnt++;}}
}
int main()
{int t;scanf("%d", &t);while (t--){memset(buff, 0, sizeof(buff));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;
}