[ZJU 1010] Area

ZOJ Problem Set - 1010

Area

---

Time Limit: 2 Seconds      Memory Limit: 65536 KB      Special Judge

---

Jerry, a middle school student, addicts himself to mathematical research. Maybe the problems he has thought are really too easy to an expert. But as an amateur, especially as a 15-year-old boy, he had done very well. He is so rolling in thinking the mathematical problem that he is easily to try to solve every problem he met in a mathematical way. One day, he found a piece of paper on the desk. His younger sister, Mary, a four-year-old girl, had drawn some lines. But those lines formed a special kind of concave polygon by accident as Fig. 1 shows.

Fig. 1 The lines his sister had drawn

"Great!" he thought, "The polygon seems so regular. I had just learned how to calculate the area of triangle, rectangle and circle. I'm sure I can find out how to calculate the area of this figure." And so he did. First of all, he marked the vertexes in the polygon with their coordinates as Fig. 2 shows. And then he found the result--0.75 effortless.

Fig.2 The polygon with the coordinates of vertexes

Of course, he was not satisfied with the solution of such an easy problem. "Mmm, if there's a random polygon on the paper, then how can I calculate the area?" he asked himself. Till then, he hadn't found out the general rules on calculating the area of a random polygon. He clearly knew that the answer to this question is out of his competence. So he asked you, an erudite expert, to offer him help. The kind behavior would be highly appreciated by him.

Input

The input data consists of several figures. The first line of the input for each figure contains a single integer n, the number of vertexes in the figure. (0 <= n <= 1000).

In the following n lines, each contain a pair of real numbers, which describes the coordinates of the vertexes, (xi, yi). The figure in each test case starts from the first vertex to the second one, then from the second to the third, ���� and so on. At last, it closes from the nth vertex to the first one.

The input ends with an empty figure (n = 0). And this figure not be processed.

Output

As shown below, the output of each figure should contain the figure number and a colon followed by the area of the figure or the string "Impossible".

If the figure is a polygon, compute its area (accurate to two fractional digits). According to the input vertexes, if they cannot form a polygon (that is, one line intersects with another which shouldn't be adjoined with it, for example, in a figure with four lines, the first line intersects with the third one), just display "Impossible", indicating the figure can't be a polygon. If the amount of the vertexes is not enough to form a closed polygon, the output message should be "Impossible" either.

Print a blank line between each test cases.

Sample Input

5
0 0
0 1
0.5 0.5
1 1
1 0
4
0 0
0 1
1 0
1 1
0

Output for the Sample Input

Figure 1: 0.75

Figure 2: Impossible

---

Source: Asia 2001, Shanghai (Mainland China)

---

solution:

　　每次读入后暴力判断两线是否相交。后用微积分思想解决。

　　注意在n<3时输出Impossible。

#include<bits/stdc++.h>
using namespace std;
typedef struct point  
{  
    double x;  
    double y;  
}Point;  
bool lineIntersectSide(Point A, Point B, Point C, Point D)  
{
    double fC = (C.y - A.y) * (A.x - B.x) - (C.x - A.x) * (A.y - B.y);  
    double fD = (D.y - A.y) * (A.x - B.x) - (D.x - A.x) * (A.y - B.y);  
  
    if(fC * fD > 0)  
        return false;  
  
    return true;  
}  
bool sideIntersectSide(Point A, Point B, Point C, Point D)  
{  
    if(!lineIntersectSide(A, B, C, D))  
        return false;  
    if(!lineIntersectSide(C, D, A, B))  
        return false;  
    return true;
}
Point a[2000];
int n;
int ID;
double CALC(Point a,Point b)
{
    return (a.x + b.x) * (b.y - a.y) / 2;
}
void solve()
{
    cout << "Figure " << ID << ": ";
    for (int i=1;i<=n;i++)
        cin >> a[i].x >> a[i].y;
    if (n <= 2)
    {
        cout << "Impossible\n\n";
        return;
    }
    for (int i=1;i<=n;i++)
        for (int j=1;j<=n;j++)
        {
            if (i == j  || i%n+1 == j || i == j%n+1 || i%n+1 == j%n+1) continue;
            if (sideIntersectSide(a[i],a[i%n+1],a[j],a[j%n+1]))
            {
                cout << "Impossible\n\n";
                return;
            }
        }
    double ANS=0;
    for (int i=1;i<=n;i++)
        ANS += CALC(a[i],a[i%n+1]);
    printf("%.2f\n\n",abs(ANS));
}
int main()
{
    while (cin >> n,n)
        ID++,solve();
}

 

转载于:https://www.cnblogs.com/dgklr/p/9712765.html