【usaco】MAR10

以前排极角判象限太傻了。。。

#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
using namespace std;
#define sqr(x) (x)*(x)
const double eps=1e-15,pi=3.14159265357;
struct point{double x,y,z,d,_;}p[2000];
int n,m,flag,u[2000],st[2000],h,r;
double cr(point e,point r) {return e.x*r.y-e.y*r.x;}
double dot(point e,point r) {return e.x*r.x+e.y*r.y+e.z*r.z;}
void cross(point p,point q,point &e)
{
  e.x=p.y*q.z-p.z*q.y;
  e.y=p.z*q.x-p.x*q.z;
  e.z=p.x*q.y-p.y*q.x;
}
void ori(point &a)
{
  a._=atan2(a.y,a.x);
  a.d=a.z/sqrt(sqr(a.x)+sqr(a.y));
}
bool cmp(int i,int j)
{
  //  return p[i]._<p[j]._;
  if (fabs(p[i]._-p[j]._)>pi/2) return p[i]._<p[j]._;
  if (fabs(cr(p[i],p[j]))>eps) return cr(p[i],p[j])>eps;
  return p[i].d<p[j].d;
}
bool check(point L,point T,point I)
{
  point p;
  cross(L,T,p);
  if (dot(p,I)>-eps) return 1;
  return 0;
}
int main()
{
  int i,j,a[4],b[4],k[4];
  char ch;
  freopen("Starc.in","r",stdin);
  freopen("Starc.out","w",stdout);
  scanf("%d%d\n",&n,&m);
  for (i=1;i<=n;i++) {
    scanf("%c%d%d%d%d%d%d\n",&ch,&a[1],&a[2],&a[3],&b[1],&b[2],&b[3]);
    for (j=1;j<=3;j++) k[j]=a[j]-b[j];
    p[i].x=k[2],p[i].y=k[3],p[i].z=k[1];
    if (ch=='B') p[i].x=-p[i].x,p[i].y=-p[i].y,p[i].z=-p[i].z;
  }
  i--;
  p[i+1].x=1,p[i+1].z=-1.0/100;
  p[i+2].x=-1,p[i+2].z=100;//-pi~pi
  p[i+3].y=1,p[i+3].z=-1.0/100;
  p[i+4].y=-1,p[i+4].z=100;
  p[i+5].x=-1,p[i+5].y=100;
  p[i+6].x=100,p[i+6].y=-1;
  for (i=1;i<=n+6;i++) ori(p[i]),u[i]=i;//,printf("%lf %lf %lf\n",p[i].x,p[i].y,p[i].z);//p[n+2]._=-pi;
  sort(u+1,u+n+6+1,cmp);
  st[h=r=1]=u[1];
  for (i=2;i<=n+6;i++) {
    if (p[u[i]]._==p[u[i-1]]._) continue;
/*    printf("%d %d\n",h,r);
    for (int i=h;i<=r;i++) printf("%lf %lf %lf\n",p[st[i]].x,p[st[i]].y,p[st[i]].z);*/
    for (;h<r && (!check(p[st[r-1]],p[st[r]],p[u[i]]));r--) ;
    for (;h<r && (!check(p[st[h]],p[st[h+1]],p[u[i]]));h++) ;
    st[++r]=u[i];
  }
/*    printf("%d %d\n",h,r);
    for (int i=h;i<=r;i++) printf("%lf %lf %lf\n",p[st[i]].x,p[st[i]].y,p[st[i]].z);*/
  for (;h<r && (!check(p[st[r-1]],p[st[r]],p[st[h]]));r--) ;
  for (;h<r && (!check(p[st[h]],p[st[h+1]],p[st[r]]));h++) ;
//  printf("%d %d\n",h,r);
  st[r+1]=st[h];
  for (i=1;i<=m;i++) {
    scanf("%d%d%d%d%d%d\n",&a[1],&a[2],&a[3],&b[1],&b[2],&b[3]);
    for (j=1;j<=3;j++) k[j]=a[j]-b[j];
    point P,e;
    P.x=k[2],P.y=k[3],P.z=k[1];
//    printf("%lf %lf %lf\n",P.x,P.y,P.z);
    flag=0;
    for (j=h;j<=r;j++) {
      cross(p[st[j]],p[st[j+1]],e);
      e.x/=e.z,e.y/=e.z,e.z/=e.z;
//      printf("%lf\n",dot(P,e));
      if (dot(P,e)>eps) flag|=1;
      else if (dot(P,e)<-eps) flag|=2;
      else flag|=3;
    }
//    printf("\n");
    switch (flag) 
      {
      case 1:
      	printf("J\n");break;
      case 2:
	      printf("B\n");break;
      default :
	      printf("U\n");break;
      }
  }
  return 0;
}