hdu 3685 多边形重心+凸包

Rotational Painting

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2498    Accepted Submission(s): 702

Problem Description

Josh Lyman is a gifted painter. One of his great works is a glass painting. He creates some well-designed lines on one side of a thick and polygonal glass, and renders it by some special dyes. The most fantastic thing is that it can generate different meaningful paintings by rotating the glass. This method of design is called “Rotational Painting (RP)” which is created by Josh himself. 

You are a fan of Josh and you bought this glass at the astronomical sum of money. Since the glass is thick enough to put erectly on the table, you want to know in total how many ways you can put it so that you can enjoy as many as possible different paintings hiding on the glass. We assume that material of the glass is uniformly distributed. If you can put it erectly and stably in any ways on the table, you can enjoy it. 

More specifically, if the polygonal glass is like the polygon in Figure 1, you have just two ways to put it on the table, since all the other ways are not stable. However, the glass like the polygon in Figure 2 has three ways to be appreciated. 

Pay attention to the cases in Figure 3. We consider that those glasses are not stable.

 

Input

The input file contains several test cases. The first line of the file contains an integer T representing the number of test cases. 

For each test case, the first line is an integer n representing the number of lines of the polygon. (3<=n<=50000). Then n lines follow. The ith line contains two real number x_i and y_i representing a point of the polygon. (x_i, y_i) to (x_i+1, y_i+1) represents a edge of the polygon (1<=i<n), and (x_n,y_n) to (x₁, y₁) also represents a edge of the polygon. The input data insures that the polygon is not self-crossed.

 

Output

For each test case, output a single integer number in a line representing the number of ways to put the polygonal glass stably on the table.

 

Sample Input

2 4 0 0 100 0 99 1 1 1 6 0 0 0 10 1 10 1 1 10 1 10 0

 

Sample Output

2 3

Hint

The sample test cases can be demonstrated by Figure 1 and Figure 2 in Description part.

题目大意：给一个多边形，问把它放到平面上是稳定状态的（重心在支撑点以内，在支撑点是不稳定的）种数。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;

const double eps=1e-8;
const double Pi=acos(-1.0);
struct Point
{
    double x,y;
    Point(double x=0,double y=0):x(x),y(y) {}
};
typedef Point Vector;
Vector operator +(Vector A,Vector B){return Vector(A.x+B.x,A.y+B.y);}
Vector operator -(Vector A,Vector B){return Vector(A.x-B.x,A.y-B.y);}
Vector operator *(Vector A,double p){return Vector(A.x*p,A.y*p);}
Vector operator /(Vector A,double p){return Vector(A.x/p,A.y/p);}
bool operator < (const Point &a,const Point &b)
{
    return a.x<b.x||(a.x==b.x&&a.y<b.y);
}
int dcmp(double x)
{
    if(fabs(x)<eps) return 0;
    else return x<0?-1:1;
}
bool operator == (const Point &a,const Point &b){
    return (dcmp(a.x-b.x)==0 && dcmp(a.y-b.y)==0);
}
double Dot(Vector A,Vector B){return A.x*B.x+A.y*B.y;}//点积
double Cross(Vector A,Vector B){ return A.x*B.y-A.y*B.x;}//叉积
Point GetLineProjection(Point P,Point A,Point B)//P在直线AB上的投影点
{
    Vector v=B-A;
    return A+v*(Dot(v,P-A)/Dot(v,v));
}
bool OnSegment(Point p,Point a1,Point a2)//点是否在直线上（不包括端点）
{
    return dcmp(Cross(a1-p,a2-p))==0 && dcmp(Dot(a1-p,a2-p))<0;
}
Point getcenter(vector<Point> p)//多边形的重心
{
    double area=0;
    Point c=Point(0,0);
    int i,n=p.size();
    for(i=1;i<n-1;i++)
    {
        double temp=Cross(p[i]-p[0],p[i+1]-p[0]);
        c.x+=temp*(p[i].x+p[i+1].x+p[0].x)/3.0;
        c.y+=temp*(p[i].y+p[i+1].y+p[0].y)/3.0;
        area+=temp;
    }
    c.x/=area;c.y/=area;
    return c;
}
vector<Point> ConvexHull(vector<Point>& p)//求凸包
{
    sort(p.begin(), p.end());
    p.erase(unique(p.begin(), p.end()), p.end());
    int i,n = p.size();
    int m = 0;
    vector<Point> ch(n+1);
    for(i = 0; i < n; i++) {
        while(m > 1 && Cross(ch[m-1]-ch[m-2], p[i]-ch[m-2]) <= 0) m--;
        ch[m++] = p[i];
    }
    int k = m;
    for(i = n-2; i >= 0; i--) {
        while(m > k && Cross(ch[m-1]-ch[m-2], p[i]-ch[m-2]) <= 0) m--;
        ch[m++] = p[i];
    }
    if(n > 1) m--;
    ch.resize(m);
    return ch;
}

void solve(vector<Point> p,Point center)
{
    int ans=0,n=p.size();
    for(int i=0;i<n;i++)
    {
        Point t=GetLineProjection(center,p[i],p[(i+1)%n]);
        if(OnSegment(t,p[i],p[(i+1)%n])) ans++;
    }
    printf("%d
",ans);
}

int main()
{
    int i,t,n;
    double x,y;
    vector<Point> p;
    scanf("%d",&t);
    while(t--)
    {
        p.clear();
        scanf("%d",&n);
        for(i=0;i<n;i++)
        {
            scanf("%lf%lf",&x,&y);p.push_back(Point(x,y));
        }
        Point center=getcenter(p);
        p=ConvexHull(p);
        solve(p,center);
    }
    return 0;
}