（Pick定理）POJ2954Triangle

POJ2954Triangle

题意：

给三角形的三个顶点（保证是整数），求三角形内部的点数。

思路：

Pick定理模板题，由定理可得:$\begin{array}{r}a=S-\frac{b}{2}+1\end{array}$。
用叉积求面积，可得$\begin{array}{r}a=\frac{|\overrightarrow{AB}\times \overrightarrow{AC}|-b}{2}+1\end{array}$。
以下求$b$：
设斜率为$k，g=gcd(|x_2-x_1|,|y_2-y_1|)$
$\begin{array}{r}k=\frac{x_2-x_1}{y_2-y_1}=\frac{\frac{x_2-x_1}{g}}{\frac{y_2-y_1}{g}}\end{array}$
直线两点式方程可变形为$\begin{array}{r}x-x_2=\frac{x_1-x_2}{y_1-y_2}\times (y-y_1)\end{array}$
假设一点为$(x,p)$,其中$p$为整数。
那么$\begin{array}{r}x=\frac{x_1-x_2}{y_1-y_2}\times (p-y_1)+x_2=\frac{\frac{x_2-x_1}{g}}{\frac{y_2-y_1}{g}}\times (p-y_2)+x_2\end{array}$
令$x$为整数，那么$\begin{array}{r}p-y_2|\frac{y_1-y_2}{g}\end{array}$,那么可得从$x\in [0,k]$满足$x$为整数的个数为$\begin{array}{r}k÷\frac{y_1-y_2}{g}\end{array}$。
可得一条$(x_1,y_1)$到$(x_2,y_2)$的线段经过的格点数为$\begin{array}{r}{b}_1=y_2÷\frac{y_1-y_2}{g}-y_1÷\frac{y_1-y_2}{g}+1=(y_2-y_1)\times \frac{g}{y_1-y_2}+1=g+1\end{array}$
因为顶点计算会重合，所以要减$3$
所以$b=gcd(|x_2-x_1|,|y_2-y_1|)+gcd(|x_2-x_3|,|y_2-y_3|)+gcd(|x_3-x_1|,|y_3-y_1|)$

代码：

#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<algorithm>
#include<string.h>
#include<ctype.h>
#include<queue>
#include<set>
#include<stack>
#include<cmath>
#include<map>
#define pii pair<int,int>
#define ll long long
#define cl(x,y) memset(x,y,sizeof(x))
#define ct cerr<<"Time elapsed:"<<1.0*clock()/CLOCKS_PER_SEC<<"s.\n";
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(),x.end()
#define lson x<<1,l,mid
#define rson x<<1|1,mid+1,r
#define INF 1e18
const int N=1e6+10;
const int mod=1e9+7;
const int inf=0x3f3f3f3f;
const double eps=1e-8;
const double pi=acos(-1);
using namespace std;
struct point
{
    double x,y;
    point(){}
    point(double xx,double yy){x=xx;y=yy;}
    point operator +(point b){return point(x+b.x,y+b.y);}
    point operator -(point b){return point(x-b.x,y-b.y);}
    double operator ^(point b){return x*b.y-y*b.x;}//叉乘 
    double operator *(point b){return x*b.x+y*b.y;}//点乘 
    point operator *(double b){return point(x*b,y*b);}//数乘  
	double gettan(){return atan2(y,x);}//角度 
    void read(){scanf("%lf%lf",&x,&y);}
}a,b,c;
int f(point a,point b)
{
	return __gcd(abs((int)(a.x-b.x)),abs((int)(a.y-b.y)));
}
int pick()
{
	double p=f(a,b)+f(a,c)+f(b,c);
	double ans=fabs(((a-b)^(a-c))/2)-p/2+1;
	return (int)ans;
}
int main()
{
	while(1)
	{
		a.read();
		b.read();
		c.read();
		if(a.x==0 && a.y==0 && b.x==0 && b.y==0 && c.x==0 && c.y==0)
			break;
		printf("%d\n",pick());		
	}
	return 0;
}