Old Wine Into New Bottles - UVa 10280 dp

Problem C: Old Wine Into New Bottles

Wine bottles are never completely filled: a small amount of air must be left in the neck to allow for thermal expansion and contraction. If too little air is left in the bottle, the wine may expand and expel the cork; if too much air is left in the bottle, the wine may spoil. Thus each bottle has a minimum and maximum capacity.

Given a certain amount of wine and a selection of bottles of various sizes, determine which bottles to use so that each is filled to between its minimum and maximum capacity and so that as much wine as possible is bottled.

Input

The input begins with a single positive integer on a line by itself indicating the number of the cases following, each of them as described below. This line is followed by a blank line, and there is also a blank line between two consecutive inputs.

The first line of input contains two integers: the amount of wine to be bottled (in litres, between 0 and 1,000,000) and the number of sizes of bottles (between 1 and 100). For each size of bottle, one line of input follows giving the minimum and maximum capacity of each bottle in millilitres. The maximum capacity is not less than 325 ml and does not exceed 4500 ml. The minimum capacity is not less than 95% and not greater than 99% of the maximum capacity. You may assume that an unlimited number of each bottle is available.

Output

For each test case, the output must follow the description below. The outputs of two consecutive cases will be separated by a blank line.

Your output should consist of a single integer: the amount of wine, in ml, that cannot be bottled.

Sample Input

2

10 2
4450 4500
725 750

10000 2
4450 4500
725 750

Sample Output

250

0

题意：你有vL的酒，n个类型的酒瓶，每个酒瓶可以装一点限度的酒水，问最少剩下多少毫升的酒。

思路：首先，设你有k个某一种的酒瓶，那么你盛水的数量就是mi*k到ma*k，当ma*k-mi*k>=mi时，那么你最后肯定能全部装进酒瓶里，这样就可以剪枝，然后做完全背包。

AC代码如下：

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int a[110],b[110],c[110],dp[600010],vis[600010];
int main()
{ int T,t,n,i,j,k,v,ans;
  scanf("%d",&T);
  for(t=1;t<=T;t++)
  { if(t!=1)
     printf("\n");
    scanf("%d%d",&v,&n);
    v*=1000;
    k=v+1;
    for(i=1;i<=n;i++)
    { scanf("%d%d",&a[i],&b[i]);
      c[i]=b[i]-a[i];
      if(k>a[i]*a[i]/c[i])
       k=a[i]*a[i]/c[i];
    }
    if(v>=k)
    { printf("0\n");
      continue;
    }
    vis[0]=t;
    for(i=1;i<=n;i++)
     for(j=a[i];j<=v;j++)
      if(vis[j-a[i]]==t)
      { if(vis[j]==t)
         dp[j]=max(dp[j],dp[j-a[i]]+c[i]);
        else
        { dp[j]=dp[j-a[i]]+c[i];
          vis[j]=t;
        }
      }
    ans=v;
    for(i=0;i<=v;i++)
     if(vis[i]==t)
      ans=min(ans,v-i-dp[i]);
    if(ans<0)
     ans=0;
    printf("%d\n",ans);
  }
}