【HDU - 4056】Draw a Mess （并查集 or 线段树）

题干：

It's graduated season, every students should leave something on the wall, so....they draw a lot of geometry shape with different color.

When teacher come to see what happened, without getting angry, he was surprised by the talented achievement made by students. He found the wall full of color have a post-modern style so he want to have an in-depth research on it.

To simplify the problem, we divide the wall into n*m (1 ≤ n ≤ 200, 1 ≤ m ≤ 50000) pixels, and we have got the order of coming students who drawing on the wall. We found that all students draw four kinds of geometry shapes in total that is Diamond, Circle, Rectangle and Triangle. When a student draw a shape in pixel (i, j) with color c (1 ≤ c ≤ 9), no matter it is covered before, it will be covered by color c.

There are q (1 ≤ q ≤ 50000) students who have make a drawing one by one. And after q operation we want to know the amount of pixels covered by each color.

Input

There are multiple test cases.

In the first line of each test case contains three integers n, m, q. The next q lines each line contains a string at first indicating the geometry shape:

* Circle: given xc, yc, r, c, and you should cover the pixels(x, y) which satisfied inequality (x - xc) 2 + (y - yc) 2 ≤ r 2 with color c;
* Diamond: given xc, yc, r, c, and you should cover the pixels(x, y) which satisfied inequality abs(x - xc) + abs(y - yc) ≤ r with color c;
* Rectangle: given xc, yc, l, w, c, and you should cover the pixels(x, y) which satisfied xc ≤ x ≤ xc+l-1, yc ≤ y ≤ yc+w-1 with color c;
* Triangle: given xc, yc, w, c, W is the bottom length and is odd, the pixel(xc, yc) is the middle of the bottom. We define this triangle is isosceles and the height of this triangle is (w+1)/2, you should cover the correspond pixels with color c;

Note: all shape should not draw out of the n*m wall! You can get more details from the sample and hint. (0 ≤ xc, x ≤ n-1, 0 ≤ yc, y ≤ m-1)

Output

For each test case you should output nine integers indicating the amount of pixels covered by each color.

Sample Input

8 8 4
Diamond 3 3 1 1
Triangle 4 4 3 2
Rectangle 1 1 2 2 3
Circle 6 6 2 4

Sample Output

4 4 4 11 0 0 0 0 0

Hint

The final distribution of different colors:
00000000
03300000
03310000
00111000
00022240
00002444
00004444
00000444

解题报告：

其实这题建20棵线段树也可以轻松解决，，不过因为数据加强了好像zoj上会被T（因为内存给的很宽松）hdu上会MLE

AC代码：

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<queue>
#include<map>
#include<vector>
#include<set>
#include<string>
#include<cmath>
#include<cstring>
#define ll long long
#define pb push_back
#define pm make_pair
#define fi first
#define se second
using namespace std;
const int MAX = 2e5 + 5;
struct Node {char op[15];int x,y,l,w,c;
} node[MAX];
int f[MAX],ans[MAX];
int n,m,q;
bool vis[MAX];
int getf(int v) {return v == f[v] ? v : f[v] = getf(f[v]);
}
void merge(int u,int v) {int t1 = getf(u);int t2 = getf(v);if(t1!=t2) f[t2]=t1;//都归到左侧的t1上。。
}
int main()
{   while(~scanf("%d%d%d",&n,&m,&q)) {for(int i = 1; i<=q; i++) {scanf("%s",node[i].op);if(node[i].op[0] == 'R') scanf("%d%d%d%d%d",&node[i].x,&node[i].y,&node[i].l,&node[i].w,&node[i].c);else scanf("%d%d%d%d",&node[i].x,&node[i].y,&node[i].l,&node[i].c);}memset(ans,0,sizeof ans);for(int r = 0; r<n; r++) {for(int c=0; c<m; c++) vis[c]=0,f[c]=c;for(int i = q; i>=1; i--) {int L,R,col = node[i].c;if(node[i].op[0] == 'C') {if(node[i].l < abs(r-node[i].x)) continue;int tmp = (int)sqrt(node[i].l*node[i].l - (r-node[i].x) * (r-node[i].x));//半径^2 - 竖直长度= 投影长度 L=node[i].y-tmp;R=node[i].y+tmp; }if(node[i].op[0] == 'D') {if(node[i].l < abs(r-node[i].x)) continue;int tmp = node[i].l - abs(r-node[i].x);L=node[i].y-tmp;R=node[i].y+tmp;}if(node[i].op[0] == 'R') {if(r > node[i].x+node[i].l-1 || r < node[i].x) continue;L=node[i].y;R=node[i].y+node[i].w-1;}if(node[i].op[0] == 'T'){if(r-node[i].x >= (node[i].l+1)/2 || r<node[i].x) continue;int tmp = (node[i].l-1)/2 - (r-node[i].x);L=node[i].y-tmp;R=node[i].y+tmp;}L=max(0,L);R=min(R,m-1);int t1 = getf(L),t2;for(int c = R; c>=L; c=t2-1) {t2=getf(c);if(vis[t2]==0) ans[col]++,vis[t2]=1;//这里必须是标记t2，不能直接标记c。。因为你就不好查询是否被标记过了，，总之这里并查集都是用根节点进行操作，所以都转化成根节点就行了。 merge(t1,t2);}}}for(int i = 1; i<=9; i++) {printf("%d%c",ans[i],i==9?'\n':' ');}}return 0 ;}

【HDU - 4056】Draw a Mess （并查集 or 线段树）相关推荐

UVA1493 - Draw a Mess(并查集)
UVA1493 - Draw a Mess(并查集) 题目链接题目大意:一个N * M 的矩阵,每次你在上面将某个范围上色,不论上面有什么颜色都会被最新的颜色覆盖,颜色是1-9,初始的颜色是0.最后 ...
HDU 5575 Discover Water Tank 并查集+左偏树
不妨假定初始答案为所有的无水询问,因为这样一定没有冲突. 然后枚举有水询问.水位线到这里时,答案能否更优. 若水位线达到某一高度,则可能淹没旁边的水箱,那么实际就变成了一个大水箱,所以考虑用并查集来优 ...
POJ 1944 Fiber Communications (枚举 + 并查集 OR 线段树)
题意在一个有N(1 ≤ N ≤ 1,000)个点环形图上有P(1 ≤ P ≤ 10,000)对点需要连接.连接只能连接环上相邻的点.问至少需要连接几条边. 思路突破点在于最后的结果一定不是一个环! ...
分门别类刷leetcode——高级数据结构（字典树，前缀树，trie树，并查集，线段树）
目录 Trie树(字典树.前缀树)的基础知识字典树的节点表示字典树构造的例子字典树的前序遍历获取字典树中全部单词字典树的整体功能字典树的插入操作字典树的搜索操作字典树的前缀查询字典树 ...
Gym - 101194G Pandaria （并查集+倍增+线段树合并）
题意: 给定一个无向图.每个点有一种颜色.现在给定q个询问,每次询问x和w,求所有能通过边权值不超过w的边走到x的点的集合中,哪一种颜色的点出现的次数最多.次数相同时输出编号最小的那个颜色.强制在线. ...
How Many Answers Are Wrong HDU - 3038（带权并查集经典题，满满的都是注释）
How Many Answers Are Wrong HDU - 3038 点击打开链接题意:现在有n个数(你并不知道这n个数是什么),m次查询,每次查询给出u,v,w.表示从第u个数到第v个数的 ...
hdu 1232 畅通工程最小生成树并查集
1232的连接:http://acm.hdu.edu.cn/showproblem.php?pid=1232 #include <iostream>#include <cstdio& ...
HDU 1213 How Many Tables 并查集水~
http://acm.hdu.edu.cn/showproblem.php?pid=1213 果然是需要我陪跑T T,禽兽工作人员还不让,哼,但还是陪跑了~ 啊,还有呀,明天校运会终于不用去了~耶耶耶 ...
hdu 3234 Exclusive-OR 题解（并查集，思维）
该死的期末复习终于结束了... 暑假来了\color{#ff0000}{暑假来了}暑假来了!!! 所以我就珂以非常开心的写博客了. 原题链接: hdu 题意简述多组数据.你有一个没有确定的数列.有一 ...

【HDU - 4056】Draw a Mess （并查集 or 线段树）

【HDU - 4056】Draw a Mess （并查集 or 线段树）相关推荐

最新文章

热门文章