UVA - 297 Quadtrees

夏令营暂告一段落 目前0offer状态
继续随心刷几题吧

#include <bits/stdc++.h>

using namespace std;
bool g[1124];
void buildTree(int level,int base){
    char c;
    scanf("%c",&c);
    if(c=='p'){
        int perbloc=pow(2,level-2);
        buildTree(level-2,base);
        buildTree(level-2,base+perbloc);
        buildTree(level-2,base+2*perbloc);
        buildTree(level-2,base+3*perbloc);
    }else if(c=='f'){
        int endidx=base+pow(2,level);
        fill(g+base,g+endidx,true);
    }
}
int main(){
    int casecnt;
    cin>>casecnt;
    getchar();
    while(casecnt>0){
        casecnt--;
        fill(g,g+1124,false);
        buildTree(10,0);
        getchar();
        buildTree(10,0);
        getchar();
        int blaccnt=0;
        for(int i=0;i<1024;i++)if(g[i])blaccnt++;
        printf("There are %d black pixels.\n",blaccnt);
    }
}