POJ 1899 Farmer Bill's Problem

 

Farmer Bill's Problem

Time Limit: 1000MS		Memory Limit: 30000K
Total Submissions: 2159		Accepted: 514

Description

It is rumored that the planet Earth is often visited by Unidentified Flying Objects (UFOs). Sometimes UFOs land and leave burned out regions. Observations show that these regions have the form of circles.

Recently farmer Bill has found such circles on his nice rectangular wheat field. Bill likes all mysterious things very much, so he has decided to keep these circles on the field. However, although being an ufolog, first of all Bill is the farmer, so he needs to harvest his wheat. Therefore he has decided to keep some regions containing circles intact, and harvest the rest of the field.

All regions that Bill keeps unharvested must be rectangles that neither touch nor overlap each other. The sides of the rectangles must be parallel to the sides of the field. All circles left by UFOs must be inside these regions. The total area of the regions must be minimal possible, so that Bill could harvest the maximal possible part of his field.

Now Bill wants to know the total area of the field that he will be able to harvest. Help him!

Input

The first line of the input contains two integer numbers x and y -- the dimensions of Bill's field (1 <= x, y <= 1000). Let Bill's field be positioned on the plane in such a way that its corners are located in points with coordinates (0, 0), (x, 0), (x, y) and (0, y). The second line of the case contains N -- the number of circles left by UFOs on Bill's field (0 <= N <= 100). Next N lines describe circles: each line contains three positive integer numbers xi, yi and ri -- coordinates of the center and radius of the circle. Circles may touch, overlap or contain each other. All circles are completely located within the field bounds.

Output

Output a single integer number — the area of the part of the field that Bill will be able to harvest.

Sample Input

10 8
2
3 3 1
1 1 1

Sample Output

64

Source

Northeastern Europe 2003

 

 /* 纯粹的计算集合，我看网上有人用并查集，我觉得繁琐了，直接扫描就可以了 6155532 bobten2008 1899 Accepted 168K 32MS C++ 2003B 2009-11-21 17:25:11 */ #include <iostream> #define maxv(a, b) ((a) >= (b) ? (a) : (b)) #define minv(a, b) ((a) <= (b) ? (a) : (b)) #define MAX_N 105 using namespace std; int x, y, num; struct rec { bool unvalid; int x1, y1, x2, y2; }recs[MAX_N + 1]; //判断两线是否相交，前一部分是横线，后一部分是竖线的数据 bool segCross(int hx1, int hx2, int hy, int vx, int vy1, int vy2) { return vx >= hx1 && vx <= hx2 && vy1 <= hy && hy <= vy2; } //判断两个矩形是否有包含关系 bool in(const rec &r1, const rec &r2) { return ((r2.x1 >= r1.x1 && r2.x2 <= r1.x2 && r2.y1 >= r1.y1 && r2.y2 <= r1.y2) || (r1.x1 >= r2.x1 && r1.x2 <= r2.x2 && r1.y1 >= r2.y1 && r1.y2 <= r2.y2)); } //判断两个矩形是否相交或者包含 bool cross(const rec &r1, rec &r2) { if (segCross(r1.x1, r1.x2, r1.y1, r2.x1, r2.y1, r2.y2) || segCross(r1.x1, r1.x2, r1.y1, r2.x2, r2.y1, r2.y2) || segCross(r1.x1, r1.x2, r1.y2, r2.x1, r2.y1, r2.y2) || segCross(r1.x1, r1.x2, r1.y2, r2.x2, r2.y1, r2.y2) || segCross(r2.x1, r2.x2, r2.y1, r1.x1, r1.y1, r1.y2) || segCross(r2.x1, r2.x2, r2.y1, r1.x2, r1.y1, r1.y2) || segCross(r2.x1, r2.x2, r2.y2, r1.x1, r1.y1, r1.y2) || segCross(r2.x1, r2.x2, r2.y2, r1.x2, r1.y1, r1.y2) || in(r1, r2)) { r2.x1 = minv(r1.x1, r2.x1); r2.y1 = minv(r1.y1, r2.y1); r2.x2 = maxv(r1.x2, r2.x2); r2.y2 = maxv(r1.y2, r2.y2); return true; } return false; } int main() { int i, j, x0, y0, r; scanf("%d%d%d", &x, &y, &num); for(i = 1; i <= num; i++) { scanf("%d%d%d", &x0, &y0, &r); recs[i].x1 = x0 - r; recs[i].y1 = y0 - r; recs[i].x2 = x0 + r; recs[i].y2 = y0 + r; } bool change = true; //注意这个外层循环一定要加，不然可能会遗漏很多矩形，我就WA在了这的 while(change) { change = false; for(i = 1; i < num; i++) { if(recs[i].unvalid) continue; for(j = 1; j <= num; j++) { if(i == j || recs[j].unvalid) continue; if(cross(recs[i], recs[j])) { change = true; recs[i].unvalid = true; break; } } } } int total = x * y; for(i = 1; i <= num; i++) if(!recs[i].unvalid) total -= (recs[i].x2 - recs[i].x1) * (recs[i].y2 - recs[i].y1); printf("%d/n", total); return 0; }