「POJ1066」Treasure Hunt
Description
Archeologists from the Antiquities and Curios Museum (ACM) have flown to Egypt to examine the great pyramid of Key-Ops. Using state-of-the-art technology they are able to determine that the lower floor of the pyramid is constructed from a series of straightline walls, which intersect to form numerous enclosed chambers. Currently, no doors exist to allow access to any chamber. This state-of-the-art technology has also pinpointed the location of the treasure room. What these dedicated (and greedy) archeologists want to do is blast doors through the walls to get to the treasure room. However, to minimize the damage to the artwork in the intervening chambers (and stay under their government grant for dynamite) they want to blast through the minimum number of doors. For structural integrity purposes, doors should only be blasted at the midpoint of the wall of the room being entered. You are to write a program which determines this minimum number of doors.
An example is shown below:
An example is shown below:
Input
The input will consist of one case. The first line will be an integer n (0 <= n <= 30) specifying number of interior walls, followed by n lines containing integer endpoints of each wall x1 y1 x2 y2 . The 4 enclosing walls of the pyramid have fixed endpoints at (0,0); (0,100); (100,100) and (100,0) and are not included in the list of walls. The interior walls always span from one exterior wall to another exterior wall and are arranged such that no more than two walls intersect at any point. You may assume that no two given walls coincide. After the listing of the interior walls there will be one final line containing the floating point coordinates of the treasure in the treasure room (guaranteed not to lie on a wall).
Output
Print a single line listing the minimum number of doors which need to be created, in the format shown below.
Sample Input
|
1 2 3 4 5 6 7 8 9 |
7 20 0 37 100 40 0 76 100 85 0 0 75 100 90 0 90 0 71 100 61 0 14 100 38 100 47 47 100 54.5 55.4 |
Sample Output
|
1 |
Number of doors = 2 |
题解
因为从一个点到终点不可能“绕过”围墙，只能穿过去，所以门是否开在中点是无所谓的，只要求四周线段中点到终点的线段与墙的最少交点个数即可。
更进一步，实际上，只需判断四周围墙的所有点与终点的连线与内墙的最少交点加一即可
注意n=0时输出1。。
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 |
#include<iostream> #include<cstdio> #include<cstring> #define inf 0x7fffffff using namespace std; int n,ans=inf; struct point{double x,y;}p[101],ed; struct line{point a,b;}l[51]; point sub(point a,point b) {point t;t.x=a.x-b.x;t.y=a.y-b.y;return t;} double cmul(point a,point b) {return a.x*b.y-a.y*b.x;} double turn(point a,point b,point c) {return cmul(sub(c,a),sub(b,a));} bool cross(line a,line b) { if(turn(b.a,b.b,a.a)*turn(b.a,b.b,a.b)>=0)return 0; if(turn(a.a,a.b,b.a)*turn(a.a,a.b,b.b)>=0)return 0; return 1; } void cal(point a,point b) { int s=0; line t;t.a=a;t.b=b; for(int i=1;i<=n;i++) if(cross(t,l[i]))s++; ans=min(ans,s); } int main() { scanf("%d",&n); if(!n){printf("Number of doors = 1");return 0;} for(int i=1;i<=n;i++) { scanf("%lf%lf%lf%lf",&p[2*i-1].x,&p[2*i-1].y,&p[2*i].x,&p[2*i].y); l[i].a=p[2*i-1];l[i].b=p[2*i]; } scanf("%lf%lf",&ed.x,&ed.y); for(int i=1;i<=2*n;i++) cal(p[i],ed); printf("Number of doors = %d",ans+1); return 0; } |
Subscribe
计数器 9786178
OI 课件=>
OI 课件=>