uva 297 Quadtrees 四分树

#include<cstring>
#include<string>
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<sstream>
#include<cmath>
#include<algorithm>
#include<queue>
#include<vector>
#include<map>
#include<stack>
#include<climits>
#include<cctype>
#include<bitset>
#include<set>
using namespace std;
#define mod 1000000007
#define PI acos(-1.0)
#define INF 0x3f3f3f3f
typedef long long LL;

const int MAXN=1100;
const int len=32;
char s[MAXN];
int buf[len][len],cnt;
int T,p;
void f(const char* s,int& p,int r,int c,int w){
char ch=s[p++];
if(ch=='p'){
f(s,p,r,c+w/2,w/2);
f(s,p,r,c,w/2);
f(s,p,r+w/2,c,w/2);
f(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()
{
scanf("%d",&T);
while(T--){
memset(buf,0,sizeof(buf));
cnt=0;
scanf("%s",s);
p=0;
f(s,p,0,0,len);
scanf("%s",s);
p=0;
f(s,p,0,0,len);
printf("There are %d black pixels.\n",cnt);
}
return 0;
}