75PTS 求助awa（码风也许优良，可艾萌新悬关)

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>

using namespace std;

const int N = 1e4 + 10, M = 1e3 + 10, inf = 0x3f3f3f3f;

int n, m, k, reach = -1;
int up[N], down[N];
int y11[N], y2[N]; //specially, (0,0) means no pipe
int f[2][N]; //scrolling array
int s[N];

int main(){
//	freopen("P1941_4.in", "r", stdin);
//	freopen(".out", "w", stdout);
	
	cin >> n >> m >> k;
	for(int i = 1; i <= n; i ++) scanf("%d%d", &up[i], &down[i]);
	for(int i = 1; i <= k; i ++){
		int pos, Y1, Y2;
		scanf("%d%d%d", &pos, &Y1, &Y2);
		y11[pos] = Y1, y2[pos] = Y2, s[pos] ++;
	}
	for(int i = 1; i <= n; i ++) s[i] = s[i - 1] + s[i];
	
	memset(f, 0x3f, sizeof f);
	for(int i = 1; i <= m; i ++) f[0][i] = 0;
	for(int i = 1; i <= n; i ++){
		for(int j = 1; j <= m + up[i] - 1; j ++){
			int &state = f[i & 1][min(j, m)]; if(j <= m) state = inf;
//			if(y2[i] && (j <= y11[i] || j >= y2[i])) continue;
			//increase from previous states
			if(j - up[i] >= 1)
				state = min(state, min(f[i + 1 & 1][j - up[i]] + 1, f[i & 1][j - up[i]] + 1));
		}
		for(int j = 1; j <= m; j ++){
			int &state = f[i & 1][min(j, m)];
//			if(y2[i] && (j <= y11[i] || j >= y2[i])) continue;
			//decrease from previous states
			if(j + down[i] <= m) state = min(state, f[i + 1 & 1][j + down[i]]);
		}
		for(int j = 1; j <= m; j ++)
			if(y2[i] && (j <= y11[i] || j >= y2[i])) f[i & 1][min(j, m)] = inf;
			else if(f[i & 1][min(j, m)] < inf) reach = max(reach, i);
			
//		printf("%d : ", i);
//		for(int j = 1; j <= m + up[i] - 1; j ++) printf("%d ", f[i & 1][j]);
//		puts("");
		
		if(reach != i) break;
	}
	if(reach != n) {printf("0\n%d\n", s[reach]); return 0; }
	int ans = inf;
	for(int i = 1; i <= m; i ++) ans = min(ans, f[n & 1][i]);
	printf("1\n%d\n", ans);

	return 0;
}