背包问题求助，55pts

#include <bits/stdc++.h>
#define re register
const int INF=0x3f3f3f3f;

int min(int a,int b){return a<b?a:b;}
int max(int a,int b){return a>b?a:b;}
int n,m,k;
int x[10009],y[10009];
int g[1009],f[1009];
int l[10009],h[10009];
int main(){
	scanf("%d%d%d",&n,&m,&k);
	for(int i=1;i<=n;i++){//0;i<n
		scanf("%d%d",&x[i],&y[i]);
	}
	for(int i=1;i<=k;i++){
		int p;scanf("%d",&p);
		scanf("%d%d",&l[p],&h[p]);
	}
	memset(f,0x3f,sizeof f);
	int cnt=0;
	for(int i=1;i<=n;i++){
		if(!h[i]){
			for(int j=x[i]+1;j<=m;j++){//i-1
				f[j]=min(f[j-x[i]]+1,g[j-x[i]]+1);
			}//完全背包
			for(int j=m-x[i]+1;j<=m;j++){
				f[m]=min(f[m],g[j]+1);
			}
			for(int j=m-y[i];j;j--){
				f[j]=min(f[j],g[j+y[i]]);
			}
		}else{
			for(int j=x[i]+1;j<=h[i]-1;j++){
				f[j]=min(f[j-x[i]]+1,g[j-x[i]]+1);
			}//
			for(int j=l[i]+1;j<=min(h[i]-1,m-y[i]);j++){
					f[j]=min(f[j],g[j+y[i]]);
				}
			int ans=INF;
			for(int j=l[i]+1;j<=h[i]-1;j++)
				if(f[j]<ans){
					ans=f[j];cnt++;
					break;
				}
			if(ans==INF){
				printf("0\n%d",cnt);return 0;
			}
		}
		memcpy(g,f,sizeof g);memset(f,0x3f,sizeof f);
	}
	int res=INF;
	for(int i=1;i<=m;i++){
		if(g[i]<res)res=g[i];
	}
	printf("1\n%d",res);
	
	return 0;
}