poj 1279 Art Gallery

模板题

代码：

#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
#define N 2000
#define eps 1e-8
struct Point
{
      double x, y;
      Point(){}
      Point(double x, double y):x(x),y(y){}
}s[N], p[N], q[N];
struct Line
{
      double a, b, c;
      Line(){}
      Line(double a, double b, double c):a(a),b(b),c(c){}
};
int n, size;
int dcmp(double x)
{
      return (x<-eps)?-1:(x>eps);
}
void init()
{
      for (int i=1; i<=n; i++)
            p[i] = s[i];
      p[n+1] = p[1];
      p[0] = p[n];
      size = n;
}
inline Line getline(Point a, Point b)
{
      return Line( b.y-a.y, a.x-b.x, b.x*a.y-b.y*a.x );
}
inline Point intersect(Point a, Point b, Line L)
{
      double u = fabs( L.a*a.x+L.b*a.y+L.c );
      double v = fabs( L.a*b.x+L.b*b.y+L.c );
      return Point( (a.x*v+b.x*u)/(u+v), (a.y*v+b.y*u)/(u+v) );
}
void cut(Line L)
{
      int cur = 0;
      for (int i=1; i<=size; i++)
      {
            if ( dcmp(L.a*p[i].x+L.b*p[i].y+L.c)>=0 )
                  q[++cur] = p[i];
            else
            {
                  if ( dcmp(L.a*p[i-1].x+L.b*p[i-1].y+L.c)>0 )
                        q[++cur] = intersect( p[i], p[i-1], L );
                  if ( dcmp(L.a*p[i+1].x+L.b*p[i+1].y+L.c)>0 )
                        q[++cur] = intersect( p[i], p[i+1], L );
            }
      }
      for (int i=1; i<=cur; i++)
            p[i] = q[i];
      p[cur+1] = p[1];
      p[0] = p[cur];
      size = cur;
}
void solve()
{
      for (int i=1; i<=n; i++)
      {
            Line L = getline(s[i], s[i+1]);
            cut(L);
      }
      double area = 0;
      for (int i=1; i<=size; i++)
            area += p[i].x*p[i+1].y-p[i].y*p[i+1].x;
      printf("%.2f\n", fabs(area/2));
}
int main()
{
      int ncase;
      scanf("%d", &ncase);
      while (ncase--)
      {
            scanf("%d", &n);
            for (int i=1; i<=n; i++)
                  scanf("%lf%lf", &s[i].x, &s[i].y);
            s[n+1] = s[1];
            init();
            solve();
      }
      return 0;
}