记录编号	351435	评测结果	AAAAAAAAAA
题目名称	为爱追寻	最终得分	100
用户昵称	Yuri	是否通过	通过
代码语言	C++	运行时间	3.795 s
提交时间	2016-11-16 15:56:23	内存使用	7.92 MiB

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
 
#define cg ch=getchar()
 
#define maxn 1000010
 
struct node{
	int x, y;
}no[maxn];
 
bool cmp(const node& a,const node& b){
	if(a.x == b.x) return a.y < b.y;
	return a.x < b.x;
}
 
int main(){
	freopen("loverfinding.in","r",stdin);
	freopen("loverfinding.out","w",stdout);
	int n,sx,sy,tx,ty;
	scanf("%d%d%d%d%d",&n,&sx,&sy,&tx,&ty);
	if(sx == tx && sy == ty){
		puts("1");return 0;
	}
	no[0].x = sx;no[0].y = sy;
	int ck = -1;
	for(int i = 1,a,b;i <= n;i ++){
		scanf("%d%d",&a,&b);
		no[i].x = no[i-1].x+a;
		no[i].y = no[i-1].y+b;
		if(no[i].x == tx && no[i].y == ty){
			ck = i;break;
		}
	}
	if(ck == -1){puts("SingleDogMZX");return 0;}
	sort(no, no+1+ck, cmp);
	int ans = 1;
	for(int i = 1;i <= ck;i ++){
		if(no[i].x == no[i-1].x && no[i].y == no[i-1].y) continue;
		ans++;
	}
	printf("%d\n",ans);
	getchar();getchar();
	return 0;
}