UVA 221 - Urban Elevations（枚举+区间覆盖）

Urban Elevations

An elevation of a collection of buildings is an orthogonal projection of the buildings onto a vertical plane. An external elevation of a city would show the skyline and the faces of the ``visible" buildings of the city as viewed from outside the city from a certain direction. A southern elevation shows no sides; it shows the perfectly rectangular faces of buildings or parts of faces of buildings not obstructed on the south by taller buildings. For this problem, you must write a program that determines which buildings of a city are visible in a southern elevation.

For simplicity, assume all the buildings for the elevation are perfect rectangular solids, each with two sides that run directly east-west and two running directly north-south. Your program will find the buildings that appear in a southern elevation based on knowing the positions and heights of each city building. That data can be illustrated by a map of the city as in the diagram on the left below. The southern elevation for that city is illustrated in the diagram on the right.

(The shadow buildings are visible in a southern elevation)

Input

Input for your program consists of the numeric description of maps of several cities. The first line of each map contains the number of buildings in the city (a non-negative integer less than 101). Each subsequent line of a map contains data for a single building - 5 real numbers separated by spaces in the following order:

 
		 x-coordinate of the southwest corner

		 y-coordinate of the southwest corner

		 width of the building (length of the south side)

		 depth of the building (length of the west side)

		 height of the building

Each map is oriented on a rectangular coordinate system so that the positive x-axis points east and the positive y-axis points north. Assume that all input for each map corresponds to a legitimate map (the number of buildings is the same as the number of subsequent lines of input for the map; no two buildings in a single map overlap). Input is terminated by the number 0 representing a map with no buildings.

Output

Buildings are numbered according to where their data lines appear in the map's input data - building #1 corresponding to the first line of building data, building #2 data to the next line, and building #n to thenth line of building data for that map. (Buildings on subsequent maps also begin their numbering with 1.)

For each map, output begins with line identifying the map (map #1, map #2, etc.) On the next line the numbers of the visible buildings as they appear in the southern elevation, ordered south-to-north, west-to-east. This means that if building n and building m are visible buildings and if the southwest corner of building nis west of the southwest corner of building m, then number n is printed before number m. If building n and building m have the same x-coordinate for their southwest corners and if building n is south of building m, then the number n is printed before the number m.

For this program, a building is considered visible whenever the part of its southern face that appears in the elevation has strictly positive area. One blank line must separate output from consecutive input records.

Sample Input

14
160 0 30 60 30
125 0 32 28 60
95 0 27 28 40
70 35 19 55 90
0 0 60 35 80
0 40 29 20 60
35 40 25 45 80
0 67 25 20 50
0 92 90 20 80
95 38 55 12 50
95 60 60 13 30
95 80 45 25 50
165 65 15 15 25
165 85 10 15 35
0

Sample Output

For map #1, the visible buildings are numbered as follows:
5 9 4 3 10 2 1 14

题意：给定n坐房子的西南角坐标x, y.还有宽度w,长度d（其实没用)，高度h。问从南面看过去能看到几座房子。

思路：先枚举每个房子，把可能覆盖的房子保存下来，然后就变成一个区间覆盖问题，判断能完全覆盖的就是会被挡住。最后输出要注意要按x优先，y第二优先输出。

代码：

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
const int N = 105;

int n;
struct House {
	int x, y, w, h, id;
} h[N], save[N];

bool cmp(House a, House b) {
	if (a.x == b.x) return a.y < b.y;
	return a.x < b.x;
}

bool judge(House a) {
	int sn = 0, i;
	for (i = 0; i < n; i++) {
		House b = h[i];
		if (b.y >= a.y) continue;
		if (b.x >= a.x + a.w || b.x + b.w <= a.x) continue;
		if (b.h < a.h) continue;
		save[sn++] = b;
	}
	if (sn == 0) return true;
	sort(save, save + sn, cmp);
	int r = a.x;
	for (i = 0; i < sn; i++) {
		if (save[i].x > r) return true;
		r = max(r, save[i].x + save[i].w);
	}
	if (r < a.x + a.w) return true;
	return false;
}

void solve() {
	sort(h, h + n, cmp);
	int bo = 0;
	for (int i = 0; i < n; i++) {
		if (judge(h[i])) {
			if (bo++) printf(" ");
			printf("%d", h[i].id);
		}
	}
	printf("\n");
}

int main() {
	int cas = 0;
	while (~scanf("%d", &n) && n) {
		if (cas) printf("\n");
		for (int i = 0; i < n; i ++) {
			scanf("%d%d%d%*d%d", &h[i].x, &h[i].y, &h[i].w, &h[i].h);
			h[i].id = i + 1;
		}
		printf("For map #%d, the visible buildings are numbered as follows:\n", ++cas);
		solve();
	}
	return 0;
}