题解：NOIP2014 飞扬的小鸟

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

#define re register
#define gc getchar()
inline int read()
{
	re int x(0),f(1);re char ch(gc);
	while(ch<'0'||ch>'9') {if(ch=='-')f=-1; ch=gc;}
	while(ch>='0'&&ch<='9') x=(x*10)+(ch^48),ch=gc;
	return x*f;
}

const int N=10010,INF=1e8+7;
int n,m,k;
int x[N],y[N],l[N],h[N],f[N][2005];


int main()
{
	n=read(),m=read(),k=read();
	for(int i=1;i<=n;++i)
		x[i]=read(),y[i]=read(),l[i]=1,h[i]=m;
	for(int i=1;i<=k;++i)
	{
		int X=read();
		l[X]=read()+1,h[X]=read()-1;
	}
	memset(f,07fffff,sizeof(f));
	for(int i=1;i<=m;++i)
		f[0][i]=o;
	for(int i=1;i<=n;++i)
	{
		for(int j=x[i]+1;j<=x[i]+m;++j)
			f[i][j]=min(f[i-1][j-x[i]]+1,f[i][j-x[i]]+1);
		for(int j=m+1;j<=x[i]+m;++j)
			f[i][m]=min(f[i][m],f[i][j]);
		for(int j=1;j<=m-[i];++j)
			f[i][j]=min(f[i-1][j+y[i]]+1,f[i][j+y[i]]+1);
		for(int j=1;j<low[i];++j)
			f[i][j]=INF;
		for(int j=h[i]+1;j<=m;++j)
			f[i][j]=INf;
	}
	int ans=INF;
	for(int i=1;i<=m;++i)
		ans=min(ans,f[n][i]);
	if(ans!=IFN)
		cout<<1<<endl<<ans<<endl;
	else
	{
		for(int i=1;i<=n;++i)
		{
			bool flag=0;
			for(int j=1;j<=m;++j)
				if(f[i][j]<INF)
					flag=1;
			if(!flag)
			{
				cout<<0<<endl<<i<<endl;
				return 0;
			}
		}
	}
	return 0;
}