PKU 2318 叉积+二分

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

题目大意：给你一个箱子，里面放入n张卡片，给出玩具坐标，求被卡片分割开的每个空间的玩具数量。

很明显是几何题，用叉积判断每个玩具和每两个相邻卡片的相对位置就能知道玩具所在的位置。n、m的范围都是5000，暴力枚举复杂度应该是O(n*m)的，题目给2s，感觉应该是可以过的，但是返回了个TL，不知道时间复杂度有没有算错。

二分优化区间，二分到左右两个卡片的下标差1时借结束，然后就过了。题目还有一个很坑爹的地方，叉积中的乘法运算用int竟然保存不下，要用__int64，花了不少时间做这题，只能怪自己菜。

#include <cstdio>
#include <cstring>

const __int64 maxn = 5000 + 20;
typedef struct _node
{
	__int64 x,y;
	_node (__int64 xx = 0, __int64 yy = 0)
	{
		x = xx;
		y = yy;
	}
}Node, Vector;
typedef struct _cardboard
{
	Node n1,n2;
}Cardboard;
Cardboard card[maxn];
__int64 ans[maxn];

const Node operator - (const Node a, const Node b)
{
	return _node (a.x - b.x, a.y - b.y);
}
const Node operator + (const Node a, const Node b)
{
	return _node (a.x + b.x, a.y + b.y);
}
__int64 Cross (Node a, Node b)
{
	return a.x * b.y - a.y * b.x;
}

int erfen (int l, int r, int a, int b)
{
	if (l == r - 1)
		return r;
	int mid = (l + r) / 2;
	if (Cross (card[l].n1 - card[l].n2, Node(a, b) - card[l].n2) * 
		Cross (card[mid].n1 - card[mid].n2, Node(a, b) - card[mid].n2) < 0)
	{
		return erfen (l, mid, a, b);
	}
	else
	{
		return erfen (mid, r, a, b);
	}
}

int main ()
{
	__int64 n,m,x1,x2,y1,y2;
	bool flag = false;
	while (scanf ("%I64d", &n) !=EOF && n)
	{
		if (flag)
			printf ("\n");
		flag = true;
		scanf ("%I64d%I64d%I64d%I64d%I64d", &m, &x1, &y1, &x2, &y2);
		__int64 i, j;
		__int64 a, b;
		//初始化n+2条边
		memset (ans, 0, sizeof (ans));
		card[0].n1.x = x1; card[0].n1.y = y1;
		card[0].n2.x = x1; card[0].n2.y = y2;
		for (i = 1; i <= n; i++)
		{
			scanf ("%I64d%I64d",&a, &b);
			card[i].n1.x = a; card[i].n1.y = y1;
			card[i].n2.x = b; card[i].n2.y = y2;
		}
		card[n + 1].n1.x = x2; card[n + 1].n1.y = y1;
		card[n + 1].n2.x = x2; card[n + 1].n2.y = y2;

		for (i = 0; i < m; i++)
		{
			scanf ("%I64d%I64d",&a, &b);
			ans[erfen (0, n + 1, a, b)] ++;
		}
		for (i = 0; i <= n; i++)
		{
			printf ("%I64d: %I64d\n", i, ans[i + 1]);
		}

	}
	return 0;
}