POJ 1265 Area 几何公式

http://poj.org/problem?id=1265

Area
Time Limit: 1000MS        Memory Limit: 10000K
Total Submissions: 4725        Accepted: 2135

Description
Being well known for its highly innovative products, Merck would definitely be a good target for industrial espionage. To protect its brand-new research and development facility the company has installed the latest system of surveillance robots patrolling the area. These robots move along the walls of the facility and report suspicious observations to the central security office. The only flaw in the system a competitor抯 agent could find is the fact that the robots radio their movements unencrypted. Not being able to find out more, the agent wants to use that information to calculate the exact size of the area occupied by the new facility. It is public knowledge that all the corners of the building are situated on a rectangular grid and that only straight walls are used. Figure 1 shows the course of a robot around an example area.


Figure 1: Example area.

You are hired to write a program that calculates the area occupied by the new facility from the movements of a robot along its walls. You can assume that this area is a polygon with corners on a rectangular grid. However, your boss insists that you use a formula he is so proud to have found somewhere. The formula relates the number I of grid points inside the polygon, the number E of grid points on the edges, and the total area A of the polygon. Unfortunately, you have lost the sheet on which he had written down that simple formula for you, so your first task is to find the formula yourself.

Input
The first line contains the number of scenarios.
For each scenario, you are given the number m, 3 <= m < 100, of movements of the robot in the first line. The following m lines contain pairs 揹x dy?of integers, separated by a single blank, satisfying .-100 <= dx, dy <= 100 and (dx, dy) != (0, 0). Such a pair means that the robot moves on to a grid point dx units to the right and dy units upwards on the grid (with respect to the current position). You can assume that the curve along which the robot moves is closed and that it does not intersect or even touch itself except for the start and end points. The robot moves anti-clockwise around the building, so the area to be calculated lies to the left of the curve. It is known in advance that the whole polygon would fit into a square on the grid with a side length of 100 units.

Output
The output for every scenario begins with a line containing 揝cenario #i:? where i is the number of the scenario starting at 1. Then print a single line containing I, E, and A, the area A rounded to one digit after the decimal point. Separate the three numbers by two single blanks. Terminate the output for the scenario with a blank line.

Sample Input

2
4
1 0
0 1
-1 0
0 -1
7
5 0
1 3
-2 2
-1 0
0 -3
-3 1
0 -3

Sample Output

Scenario #1:
0 4 1.0

Scenario #2:

12 16 19.0

这个题目的核心是Pick定理：对给定顶点坐标均是整点的简单多边形，其面积A和内部格点数目i、边上格点数目b满足：A=i+b/2-1。

    因此我们可以先求出多边形的面积以及边上的格点数，进而可以得到多边形内部的格点数。边上的格点数可以通过求|dx|和|dy|的最大公约数得到。

#include<stdio.h>
#include<string.h>
long long int ans, din, don;
int abs(int x)
{
    return x < 0 ? -x : x;
}
long long int det(int x1, int y1, int x2, int y2)
{
    return (long long int )x1 * y2 - (long long int)x2 * y1;
}
int gcd(int x, int y)
{
    return y == 0 ? x : gcd(y, x % y);
}
void solve()
{
    int i, j, k, n, d, dx, dy, x, y, px, py;
    ans = don = dx = dy = px = py = 0;
    scanf("%d", &n);
    for(i = 0; i < n; i ++)
    {
        scanf("%d%d", &dx, &dy);
        x = px + dx, y = py + dy;
        don += gcd(abs(dx), abs(dy));
        ans += det(px, py, x, y);
        px = x, py = y;
    }
    ans = ans < 0 ? -ans : ans;
    din = (ans - don) / 2 + 1;
    if(ans % 2)
        printf("%lld %lld %lld.5\n", din, don, ans / 2);
    else
        printf("%lld %lld %lld.0\n", din, don, ans / 2);
}
int main()
{
    int t, tt;
    scanf("%d", &t);
    for(tt = 0; tt < t; tt ++)
    {
        printf("Scenario #%d:\n", tt + 1);
        solve();
        printf("\n");
    }
    return 0;
}