下落

.
.
.
.
.
题解
模拟
打的好啊zy，我是fw

.
.
.
.
.
程序：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

int x0,y0,n;

struct node
{
	int y,x1,x2;
}a[1000];

bool cmp(node x,node y)
{
	return x.y>y.y;
}

int main()
{
	freopen("fall.in","r",stdin);
	freopen("fall.out","w",stdout);
	scanf("%d%d",&x0,&y0);
	scanf("%d",&n);
	for (int i=1;i<=n;i++)
		scanf("%d%d%d",&a[i].y,&a[i].x1,&a[i].x2);
	sort(a+1,a+n+1,cmp);
	int wz=1;
	while (a[wz].y>y0&&wz<=n) wz++;
	int ans=y0;
	for (int i=wz;i<=n;i++)
		if (x0>=a[i].x1&&x0<=a[i].x2)
		{
			ans+=5;
			x0=a[i].x2;
		}
	printf("%d",ans);
	fclose(stdin);
	fclose(stdout);
	return 0;
}