BZOJ2794 [Poi2012]Cloakroom

离线，把询问和物品按m和a排序，每次把a小于等于当前m的物品加进来，f[i]表示用b尽可能大的物品凑出i，b最小的那个是多少，然后判f[s]是否大于m+k即可

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<cmath>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<map>
#include<set>
#include<bitset>
#include<queue>
#include<stack>
using namespace std;
#define MAXN 1010
#define MAXM 100010
#define MAXQ 1000010
#define INF 1000000000
#define MOD 1000000007
#define eps 1e-8
#define ll long long
struct que{
	int l;
	int r;
	int x;
	int num;
	friend bool operator <(que x,que y){
		return x.l<y.l;
	}
};
struct item{
	int x;
	int y;
	int c;
	friend bool operator <(item x,item y){
		return x.x<y.x;
	}
};
int n,m;
que q[MAXQ];
item a[MAXN];
int f[MAXM];
int lim=100000;
bool ans[MAXQ];
int main(){
	int i,j;
	scanf("%d",&n);
	memset(f,0xef,sizeof(f));
	f[0]=INF;
	for(i=1;i<=n;i++){
		scanf("%d%d%d",&a[i].c,&a[i].x,&a[i].y);
	}
	sort(a+1,a+n+1);
	scanf("%d",&m);
	for(i=1;i<=m;i++){
		scanf("%d%d%d",&q[i].l,&q[i].x,&q[i].r);
		q[i].r+=q[i].l;
		q[i].num=i;
	}
	sort(q+1,q+m+1);
	int wzh=1;
	for(i=1;i<=m;i++){
		while(wzh<=n&&a[wzh].x<=q[i].l){
			for(j=lim;j>=a[wzh].c;j--){
				f[j]=max(f[j],min(f[j-a[wzh].c],a[wzh].y));
			}
			wzh++;
		}
		ans[q[i].num]=f[q[i].x]>q[i].r;
	}
	for(i=1;i<=m;i++){
		printf(ans[i]?"TAK\n":"NIE\n");
	}
	return 0;
}

/*
5
6 2 7
5 4 9
1 2 4
2 5 8
1 3 9
5
2 7 1
2 7 2
3 2 0
5 7 2
4 1 5

*/