poj 3093 Margaritas on the River Walk //joj

 

Margaritas on the River Walk

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 1579		Accepted: 545

Description

One of the more popular activities in San Antonio is to enjoy margaritas in the park along the river know as the River Walk. Margaritas may be purchased at many establishments along the River Walk from fancy hotels to Joe’s Taco and Margarita stand. (The problem is not to find out how Joe got a liquor license. That involves Texas politics and thus is much too difficult for an ACM contest problem.) The prices of the margaritas vary depending on the amount and quality of the ingredients and the ambience of the establishment. You have allocated a certain amount of money to sampling different margaritas.

Given the price of a single margarita (including applicable taxes and gratuities) at each of the various establishments and the amount allocated to sampling the margaritas, find out how many different maximal combinations, choosing at most one margarita from each establishment, you can purchase. A valid combination must have a total price no more than the allocated amount and the unused amount (allocated amount – total price) must be less than the price of any establishment that was not selected. (Otherwise you could add that establishment to the combination.)

For example, suppose you have $25 to spend and the prices (whole dollar amounts) are:

Vendor	A	B	C	D	H	J
Price	8	9	8	7	16	5

Then possible combinations (with their prices) are:

ABC(25), ABD(24), ABJ(22), ACD(23), ACJ(21), ADJ( 20), AH(24), BCD(24), BCJ(22), BDJ(21), BH(25), CDJ(20), CH(24), DH(23) and HJ(21).

Thus the total number of combinations is 15.

Input

The input begins with a line containing an integer value specifying the number of datasets that follow, N (1 ≤ N ≤ 1000). Each dataset starts with a line containing two integer values V and D representing the number of vendors (1 ≤ V ≤ 30) and the dollar amount to spend (1 ≤ D ≤ 1000) respectively. The two values will be separated by one or more spaces. The remainder of each dataset consists of one or more lines, each containing one or more integer values representing the cost of a margarita for each vendor. There will be a total of V cost values specified. The cost of a margarita is always at least one (1). Input values will be chosen so the result will fit in a 32 bit unsigned integer.

Output

For each problem instance, the output will be a single line containing the dataset number, followed by a single space and then the number of combinations for that problem instance.

Sample Input

2
6 25
8 9 8 7 16 5
30 250
1 2 3 4 5 6 7 8 9 10 11
12 13 14 15 16 17 18 19 20
21 22 23 24 25 26 27 28 29 30

Sample Output

1 15
2 16509438

Hint

Note: Some solution methods for this problem may be exponential in the number of vendors. For these methods, the time limit may be exceeded on problem instances with a large number of vendors such as the second example below.

Source

Greater New York 2006

 

 

#include<cstdio> #include<algorithm> #include<cstring> using namespace std; unsigned int a[31]; unsigned int f[2010]; const int inf=1<<30; int main() { int t; scanf("%d",&t); int cas=1; while(t--) { int v,d; scanf("%d%d",&d,&v); unsigned int asum=0; for(int i=0; i<d; i++) { scanf("%d",&a[i]); asum+=a[i]; } sort(a,a+d); unsigned int sum=0; int num; if(a[0]>v) //还有种特殊情况，都放不进去 { printf("%d 0/n",cas++); continue; } if(asum<v) { printf("%d 1/n",cas++); continue; } for(int i=0; i<d; i++) { // printf("%d/n",i); for(int j=0; j<=v; j++) f[j]=-inf; num=0; if(i>0) { for(int j=0; j<i; j++) num=num+a[j]; } if(num>v) break; if(num==v) { sum++; break; } f[num]=1; for(int k=i+1; k<d; k++) for(int j=v-a[k];j>=0; j--) if(f[j]!=-inf) { if(f[j+a[k]]==-inf) f[j+a[k]]=f[j]; else f[j+a[k]]+=f[j]; } for(int j=v-a[i]+1; j<=v; j++) if(f[j]!=-inf) sum+=f[j]; } printf("%d %u/n",cas++,sum); } return 0; }