[UVA][矩形集] 870 - Intersecting Rectangles＠Morris' Blog｜PChome Online 人新台

Morris' Blog 我在摸索我存在的意、生命的意、涵及值。有真正神手般的害，套用模式是大部分的情。那害的我存在的意何，托出神的存在？有候不能怪人不我，我已始省思，什我有人的原因，而是全要靠人。有候我我不同，那是因我做不到很多人能到的事情。我不到、玩不起、得不明、理解得不多，我缺少的文能力，就是一切一切能的判定。此，我不得能做些人有助的事情。我知道我自己是不服的性格，但在我不得不。我有能力，因此我必。我到底世界作什？充不定性，而我是法出拔萃，想一般人似乎也回不了了。越大的挑需要越力的支持，而我的支持是什？最近人，但都是失的局，人能接受，不需要言，不需要通，一切所想都表不出。
49的鼓 6站台

2013-03-27 12:16:18| 人1,410| 回0 | 上一篇 | 下一篇

[UVA][矩形集] 870 - Intersecting Rectangles

推 0 收藏 0 0 站台

Intersecting Rectangles

Background

Consider, in a 2D space, a set of rectangles with edges that are parallel to the axis X and Y. One is the main rectangle and there are intersections between several rectangles. According to these intersections, one or more closed polygons called "islands" can be defined. The main island is the one that contains the main rectangle.

Figure 1 - The ten rectangles are defining 3 islands

The proposed problem is to evaluate the area of the main island. For example, in Figure 1, considering that polygon 1 is the main polygon, the main island is composed by polygons 1,2,3,5 and 10, so the problem here is to evaluate the area of the polygon presented in Figure 2.

Figure 2 - The polygon defined by the main island

Problem

Given a list of rectangles, starting with the main rectangle, the problem is to identify the main island and evaluate the correspondent area. Each rectangle is geometrically characterized by the coordinates of its bottom-left and upper-right corners; the maximum number of rectangles is 100; as a simplification, it can be considered that no coincidences between edges and vertices exist.

Input

The input begins with a single positive integer on a line by itself indicating the number of the cases following, each of them as described below. This line is followed by a blank line, and there is also a blank line between two consecutive inputs.

The first line of the input contains the number of rectangles N (integer format) to be considered. Each one of the following N lines contains the coordinates of bottom-left and upper-right vertices of a rectangle, in the sequence x_min y_min x_max y_max, separated by a single space. The first rectangle given is the main one.

Output

For each test case, the output must follow the description below. The outputs of two consecutive cases will be separated by a blank line.

One integer number that represents the main island area as defined above.

Figure 3 - Sample input

Sample Input

1

9
2 5 8 8
4 6 10 10
5 7 6 12
9 9 11 11 12 7 15 8
1 3 3 6
4 2 8 3
13 6 14 9
2 1 11 4

Sample Output

University of Porto ACM Programming Contest / Round 12/2000

求矩形的即面，一函判矩形之有有相交。

利用散化再次去算面。

#include <stdio.h>
#include <algorithm>
using namespace std;

int hasIntersect(int lx, int ly, int rx, int ry,
                int la, int lb, int ra, int rb) {
    lx = max(lx, la);
    ly = max(ly, lb);
    rx = min(rx, ra);
    ry = min(ry, rb);
    return lx < rx && ly < ry;
}
int main() {
    int t, n, i, j, k;
    scanf("%d", &t);
    while(t--) {
        scanf("%d", &n);
        int lx[105], ly[105], rx[105], ry[105];
        int X[305], Y[305], m = 0;
        for(i = 0; i < n; i++) {
            scanf("%d %d %d %d", &lx[i], &ly[i], &rx[i], &ry[i]);
            X[m] = lx[i], Y[m] = ly[i];
            m++;
            X[m] = rx[i], Y[m] = ry[i];
            m++;
        }
        sort(X, X+m);
        sort(Y, Y+m);
        int Q[105], Qt = 0, used[105] = {};
        Q[Qt] = 0, used[0] = 1;
        for(i = 0; i <= Qt; i++) {
            k = Q[i];
            for(j = 0; j < n; j++) {
                if(used[j]) continue;
                if(hasIntersect(lx[k], ly[k], rx[k], ry[k], lx[j], ly[j], rx[j], ry[j])) {
                    Q[++Qt] = j;
                    used[j] = 1;
                }
            }
        }
        n = Qt;
        int ans = 0;
        for(i = 1; i < m; i++) {
            for(j = 1; j < m; j++) {
                for(k = 0; k <= n; k++) {
                    if(X[i-1] >= lx[Q[k]] && X[i] <= rx[Q[k]] &&
                       Y[j-1] >= ly[Q[k]] && Y[j] <= ry[Q[k]]) {
                        break;
                    }
                }
                if(k != n+1) {
                    ans += (X[i]-X[i-1])*(Y[j]-Y[j-1]);
                }
            }
        }
        printf("%d\n", ans);
        if(t)
            puts("");
    }
    return 0;
}