zoj 3005 矩形覆盖 + 搜索

AC_Lee

于 2017-08-16 12:42:37 发布

阅读量230

点赞数 1

分类专栏：搜索&图论

本文链接：https://blog.csdn.net/xiaoli_nu/article/details/77234079

版权

搜索&图论专栏收录该内容

59 篇文章 0 订阅

订阅专栏

题目：

Bacteria Colony

Time Limit: 2 Seconds Memory Limit: 65536 KB

The biologist Mr.R likes cultivating bacteria on the culture medium. What is interesting is that the new cultivated bacterial colonies always form a rectangle, whose sides are parallel with the x-axis or the y-axis of the plane.

One day, Mr.R cultivated a lot of bacteria on the culture medium. Some of the colonies were overlapping. To his surprise, he found all the new cultivated bacteria defeat the old ones, which means when the new bacteria had been cultivated, the old bacteria lived in the new bacteria's colony disappeared.

Mr.R has picked out some of the bacteria and he wants to know which bacteria have defeated them.

Input

The problem has multiple test cases.

For each test case, the first line contains a integer n (1 <= n <= 500), which represents the total number of bacteria.

The next n lines describe the colonies of the bacteria. Each line has four integers x1 y1 x2 y2 (x1 < x2, y1 < y2, -100,000 <= x1, x2, y1, y2 <= 100,000). They are the coordinates of the left-top and the right-bottom points of the rectangle. The bacteria are numbered from 1 to n. The first rectangle is the colony of the first cultivated bacteria; the second rectangle is the colony of the second cultivated one, etc.

The following line contains a number m ( m <= n ), which means the number of the bacteria that Mr.R picked out.

The last line of the test case contains m numbers (between 1 and n) indicating the picked out bacteria.

Output

For each test case, there are m lines. The first number of each line is the number of the bacteria that have defeated the selected one, and then list them out in increasing order. The first line contains the answer to the first selected bacteria; the second line contains the answer to the second, etc.

Output a blank line after each test case.

Example Input

Example Output

由下到上给出n个矩形，下面的矩形可以被上面的矩形覆盖，被一个矩形覆盖了的点就不能被其他矩形覆盖下面给出m个询问，每次给出一个矩形的id，输出这个矩形被几个矩形覆盖过，并由下到上输出这些矩形的编号

分析：
线段树不太好维护不太好想到dfs 不过由于矩形有顺序关系确实可以按层数递归

代码：

#include<iostream>
#include<cstdio>
#include<set>
using namespace std;
const int maxn=520;

struct node{
	int x1,y1,x2,y2;
	node(){}
	node(int a,int b,int c,int d):x1(a),y1(b),x2(c),y2(d){}
}g[maxn];

int n,m,t;
set<int> s;

/*
分块dfs示意图 
----------------
|    |  3  |   |
|    |-----|   |
|  1 | dep | 2 |
|    |-----|   |
|    |  4  |   |
----------------  也有可能只有1和3部分 或者2和4部分
*/
void dfs(int x1,int y1,int x2,int y2,int dep){  
	while(dep<=n&&(g[dep].x1>=x2||g[dep].x2<=x1||g[dep].y1>=y2||g[dep].y2<=y1)) dep++;
	if(dep>n) return;
	s.insert(dep);
	if(g[dep].x1>x1) {
		dfs(x1,y1,g[dep].x1,y2,dep+1);
		x1=g[dep].x1;
	}
	if(g[dep].x2<x2) {
		dfs(g[dep].x2,y1,x2,y2,dep+1);
		x2=g[dep].x2;
	}
	if(g[dep].y1>y1) dfs(x1,y1,x2,g[dep].y1,dep+1);
	if(g[dep].y2<y2) dfs(x1,g[dep].y2,x2,y2,dep+1);
}

int main(){
	while(scanf("%d",&n)==1){
		for(int i=1;i<=n;i++) scanf("%d%d%d%d",&g[i].x1,&g[i].y1,&g[i].x2,&g[i].y2);
		scanf("%d",&m);
		while(m--) {
			s.clear();
			scanf("%d",&t);
			dfs(g[t].x1,g[t].y1,g[t].x2,g[t].y2,t+1);
			printf("%d",s.size());
			///set默认由小到大排序 
			for(set<int>::iterator it=s.begin();it!=s.end();it++) printf(" %d",*it);
			puts("");
		}
		puts("");
	}
	return 0;
}