1; if(L>R) return false; return true; } } inline bool getDiamond(int pos,int xc,int yc,int r , int &L , int &R) { int tmp = r - abs(xc-pos); if(tmp < 0) return false; L = yc-tmp; //L = max(0,L); if(0 > L) L = 0; R = yc+tmp; //R = min(m-1,R); if(R > m-1) R = m-1; if(L>R) return false; return true; } inline bool getTriangle(int pos , int xc , int yc , int w , int &L , int &R){ if(pos < xc) return false; L = yc-w/2+pos-xc; R = yc+w/2-(pos-xc); //L = max(L , 0); if(0 > L) L = 0; //R = min(R , m-1); if(R > m-1) R = m-1; if(L>R) return false; return true; } void initial(){ for(int i = 0; i < 15; i++) color[i] = 0; v.clear(); for(int i = 0; i < maxm; i++) father[i] = i , vis[i] = 0; } void computing(){ char shape[20]; int xc , yc , w , r , c , l , L , R; while(q--){ scanf("%s" , shape); if(shape[0] == 'C'){ scanf("%d%d%d%d" , &xc , &yc , &r , &c); } if(shape[0] == 'D'){ scanf("%d%d%d%d" , &xc , &yc , &r , &c); } if(shape[0] == 'R'){ scanf("%d%d%d%d%d" ,&xc ,&yc ,&l ,&w ,&c); } if(shape[0] == 'T'){ scanf("%d%d%d%d" ,&xc,&yc,&w,&c); } v.push_back(Node(shape[0] , xc , yc , r , l , w , c)); } int fl , fr; for(int i = 0; i < n; i++){ //cout << i << ": "; for(int j = 0; j < m; j++) father[j] = j , vis[j] = 0; for(int k = v.size()-1; k >= 0; k--){ if(v[k].op == 'C' && !getCircle(i , v[k].xc , v[k].yc , v[k].r , L , R))continue; if(v[k].op == 'D' && !getDiamond(i , v[k].xc , v[k].yc , v[k].r , L , R)) continue; if(v[k].op == 'R' && !getRect(i , v[k].xc , v[k].yc , v[k].l , v[k].w , L , R)) continue; if(v[k].op == 'T' && !getTriangle(i , v[k].xc , v[k].yc , v[k].w , L , R)) continue; c = v[k].c; //cout << L << " " << R << " " << c << endl; int fl = findFather(L); while(R>=L){ if(vis[R] == 0){ vis[R] = 1; color[c]++; } fr = findFather(R); R = min(fr-1 , R-1); if(fr > fl)father[fr] = fl; } } } printf("%d" , color[1]); for(int i = 2; i <= 9; i++) printf(" %d" , color[i]); printf("\n"); } int main(){ while(~scanf("%d%d%d" , &n , &m , &q)){ initial(); computing(); } return 0; }
|