题意: 线段与线段相交会形成密室, 求边界上到宝藏所经过的最少线段数N , 则答案就是N+1
思路: 暴力枚举,我们知道, 起点一定是边界上某一点,而终点一定是宝藏。
因为有 doors should only be blasted at the midpoint of the wall of the room being entered所以特别容易想偏
其实特别重要的一点是, 起点+中点+中点+。。。+ 中点连线再到终点,当所经过的线段最少时这个答案一定等于中点到起点的连线与线段的交点
这一点特别好证明, 画画图就明白了,
设起点S, 中点E, SE与每一条线段交点,经过平移一定可以形成 起点+中点+中点+。。。+ 中点连线再到终点的形式
#include <iostream>
#include <string.h>
#include <stdlib.h>
#include <stdio.h>
using namespace std;
#define MAXN 70
#define eps 1e-8
int sig(double a)
{
if(a > eps)
return 1;
if(a <- eps)
return -1;
return 0;
}
struct Point
{
double x, y;
Point(){};
Point (double a, double b)
{
x = a;
y = b;
}
}sta[MAXN];
double Across(Point a, Point b, Point c)
{
return (b.x - a.x)*(c.y - a.y) - (b.y - a.y)*(c.x - a.x);
}
int minn = 0x1f1f1f, n;
Point aim;
void solve( )
{
for( int i = 1; i <= 2*n ; i++)
{
int res = 0;
for( int j = 1; j <= 2*n ; j+=2)
{
int d1 = sig(Across(aim, sta[j], sta[j+1]));
int d2 = sig(Across(sta[i], sta[j], sta[j+1]));
if(d1*d2 == -1)
res ++;
}
if(res < minn)
minn = res;
}
if(minn == 0x1f1f1f) minn = 0;
printf("Number of doors = %d\n",minn+1);
return ;
}
int main()
{
double a, b, c, d;
while(scanf("%d",&n) != EOF)
{
minn = 0x1f1f1f;
for( int i = 1; i <= 2*n ;i+=2)
{
scanf("%lf %lf %lf %lf",&a, &b, &c, &d);
sta[i] = Point(a, b);
sta[i+1] = Point(c, d);
}
scanf("%lf %lf",&aim.x, &aim.y);
solve();
}
return 0;
}
思路: 暴力枚举,我们知道, 起点一定是边界上某一点,而终点一定是宝藏。
因为有 doors should only be blasted at the midpoint of the wall of the room being entered所以特别容易想偏
其实特别重要的一点是, 起点+中点+中点+。。。+ 中点连线再到终点,当所经过的线段最少时这个答案一定等于中点到起点的连线与线段的交点
这一点特别好证明, 画画图就明白了,
设起点S, 中点E, SE与每一条线段交点,经过平移一定可以形成 起点+中点+中点+。。。+ 中点连线再到终点的形式
#include <iostream>
#include <string.h>
#include <stdlib.h>
#include <stdio.h>
using namespace std;
#define MAXN 70
#define eps 1e-8
int sig(double a)
{
if(a > eps)
return 1;
if(a <- eps)
return -1;
return 0;
}
struct Point
{
double x, y;
Point(){};
Point (double a, double b)
{
x = a;
y = b;
}
}sta[MAXN];
double Across(Point a, Point b, Point c)
{
return (b.x - a.x)*(c.y - a.y) - (b.y - a.y)*(c.x - a.x);
}
int minn = 0x1f1f1f, n;
Point aim;
void solve( )
{
for( int i = 1; i <= 2*n ; i++)
{
int res = 0;
for( int j = 1; j <= 2*n ; j+=2)
{
int d1 = sig(Across(aim, sta[j], sta[j+1]));
int d2 = sig(Across(sta[i], sta[j], sta[j+1]));
if(d1*d2 == -1)
res ++;
}
if(res < minn)
minn = res;
}
if(minn == 0x1f1f1f) minn = 0;
printf("Number of doors = %d\n",minn+1);
return ;
}
int main()
{
double a, b, c, d;
while(scanf("%d",&n) != EOF)
{
minn = 0x1f1f1f;
for( int i = 1; i <= 2*n ;i+=2)
{
scanf("%lf %lf %lf %lf",&a, &b, &c, &d);
sta[i] = Point(a, b);
sta[i+1] = Point(c, d);
}
scanf("%lf %lf",&aim.x, &aim.y);
solve();
}
return 0;
}