[JZOJ4863] Market

Description

Solution

Code

#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cmath>
#define fo(i,a,b) for(i=a;i<=b;i++)
#define fod(i,a,b) for(i=a;i>=b;i--)
#define N 305
#define M 100005
using namespace std;
int a[N][3],b[N],f[N*N],n,m,ti[M][2],tl[M],ans[M];
bool cmp(int x,int y)
{
return a[x][2]<a[y][2];
}
bool cmp2(int x,int y)
{
return ti[x][0]<ti[y][0];
}
int main()
{
cin>>n>>m;
int i,j,k,s=0;
fo(i,1,n)
{
fo(j,0,2) scanf("%d",&a[i][j]);
s+=a[i][1];
b[i]=i;
}
sort(b+1,b+n+1,cmp);
j=1;
memset(f,107,sizeof(f));
f[0]=0;
fo(i,1,m) scanf("%d%d",&ti[i][0],&ti[i][1]),tl[i]=i;
sort(tl+1,tl+m+1,cmp2);
fo(i,1,m)
{
int t=ti[tl[i]][0],p=ti[tl[i]][1];
while(a[b[j]][2]<=t&&j<=n)
{
fod(k,s,a[b[j]][1]) f[k]=min(f[k+1],min(f[k],f[k-a[b[j]][1]]+a[b[j]][0]));
fod(k,a[b[j]][1],0) f[k]=min(f[k+1],f[k]);
j++;
}
int l=0,r=s;
while(l+1<r)
{
int mid=(l+r)/2;
if (f[mid]<=p) l=mid;
else r=mid;
}
if (f[r]<=p) ans[tl[i]]=r;
else ans[tl[i]]=l;
}
fo(i,1,m) printf("%d\n",ans[i]);
}