148 lines
2.4 KiB
C++
148 lines
2.4 KiB
C++
//finally ac 要把被覆盖的删掉
|
|
#include<cstdio>
|
|
#include<list>
|
|
using namespace std;
|
|
const int N=100005;
|
|
const double eps=1e-10;
|
|
int n;
|
|
bool cover[N];
|
|
struct Point
|
|
{
|
|
double x,y;
|
|
};
|
|
struct edge
|
|
{
|
|
Point a,b;
|
|
int cnt;
|
|
} ;
|
|
//inline void ce()
|
|
//{
|
|
// for(int i=1; i<=n; i++)
|
|
// {
|
|
// printf("%.0lf %.0lf %.0lf %.0lf\n",e[i].a.x,e[i].a.y,e[i].b.x,e[i].b.y);
|
|
// }
|
|
//}
|
|
inline int sign(double u)
|
|
{
|
|
if(u>=-eps&&u<=eps)
|
|
{
|
|
return 0;
|
|
}
|
|
if(u>0)
|
|
{
|
|
return 1;
|
|
}
|
|
else return -1;
|
|
}
|
|
inline double cross(Point a,Point b)
|
|
{
|
|
return a.x*b.y-b.x*a.y;
|
|
}
|
|
inline Point des(Point a,Point b)
|
|
{
|
|
a.x-=b.x;
|
|
a.y-=b.y;
|
|
return a;
|
|
}
|
|
double max(double a,double b)//double ->bool
|
|
{
|
|
return a>b? a:b;
|
|
}
|
|
double min(double a,double b)
|
|
{
|
|
return a<b? a:b;
|
|
}
|
|
//bool cmp()
|
|
inline edge maxe(edge a)
|
|
{
|
|
edge b;
|
|
b.a.x=max(a.a.x,a.b.x);
|
|
b.a.y=max(a.a.y,a.b.y);
|
|
b.b.x=min(a.a.x,a.b.x);
|
|
b.b.y=min(a.a.y,a.b.y);//b->a
|
|
return b;
|
|
}
|
|
inline bool cejiao(edge a,edge b)
|
|
{
|
|
|
|
edge ma=maxe(a),mb=maxe(b);
|
|
// printf("a:%.0lf %.0lf/%.0lf %.0lf \n",a.a.x,a.a.y,a.b.x,a.b.y);
|
|
// printf("b:%.0lf %.0lf/%.0lf %.0lf \n",b.a.x,b.a.y,b.b.x,b.b.y);
|
|
// printf("A:%.0lf %.0lf/%.0lf %.0lf \n",ma.a.x,ma.a.y,ma.b.x,ma.b.y);
|
|
// printf("B:%.0lf %.0lf/%.0lf %.0lf \n",mb.a.x,mb.a.y,mb.b.x,mb.b.y);
|
|
if(ma.a.x>=mb.b.x&&ma.a.y>=mb.b.y)
|
|
{
|
|
if(mb.a.x>=ma.b.x&&mb.a.y>=ma.b.y)
|
|
{
|
|
|
|
}
|
|
else return 0;
|
|
}
|
|
else return 0;
|
|
Point yi=des(a.a,a.b);
|
|
Point er=des(b.a,a.b);
|
|
Point san=des(b.b,a.b);
|
|
int sh=sign(cross(yi,er)),ni=sign(cross(yi,san));
|
|
// printf("%d %d\n",sh,ni);
|
|
if(sh*ni<=0)
|
|
{
|
|
return 1;
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
int main()
|
|
{
|
|
// freopen("ain.txt","r",stdin);//注释掉啊
|
|
// freopen("aout.txt","w",stdout);
|
|
list<edge>s;
|
|
edge e;
|
|
int len;
|
|
list<edge>::iterator p;
|
|
while(~scanf("%d",&n))
|
|
{
|
|
if(n==0)
|
|
{
|
|
break;
|
|
}
|
|
scanf("%lf%lf%lf%lf",&e.a.x,&e.a.y,&e.b.x,&e.b.y );
|
|
e.cnt=1;
|
|
s.push_back(e);
|
|
for(int i=2; i<=n; i++)
|
|
{
|
|
scanf("%lf%lf%lf%lf",&e.a.x,&e.a.y,&e.b.x,&e.b.y );
|
|
e.cnt=i;
|
|
s.push_back(e);
|
|
len=s.size();
|
|
p=s.begin();
|
|
for(int j=1; j<len; j++)
|
|
{
|
|
// printf("%d->%d(%d,%d)\n",i,j,cejiao((*p),e),cejiao(e,(*p)));
|
|
if(cejiao((*p),e)&&cejiao(e,(*p)))
|
|
{
|
|
p=s.erase(p);
|
|
}
|
|
else
|
|
{
|
|
p++;
|
|
}
|
|
}
|
|
}
|
|
p=s.begin();
|
|
len=s.size();
|
|
printf("Top sticks: ");
|
|
int i;
|
|
printf("%d",(*p).cnt);
|
|
p++;
|
|
for(i=1; i<len; i++)
|
|
{
|
|
printf(", %d",(*p).cnt);//,i
|
|
p++;
|
|
}
|
|
printf(".\n");
|
|
s.clear();
|
|
// ce();
|
|
}
|
|
return 0;
|
|
}
|