ZOJ3187 Inviting Friends

 #include <iostream>

using namespace std;

#include<string>

#include<memory.h>

int n,money;

int a[101][6];

int maxN;

int need[101];

int minM[101];

void minMoney()

{

int i,j;

int bn,sn;

for(i=1;i<=n;i++){

bn=need[i]/a[i][4];

sn=0;

if(need[i]%a[i][4]!=0)

bn++;

minM[i]=bn*a[i][5];

for(j=bn-1;j>=0;j--){

sn=(need[i]-j*a[i][4])/a[i][2];

if((need[i]-j*a[i][4])%a[i][2]!=0)

sn++;

int temp=j*a[i][5]+sn*a[i][3];

if(temp<minM[i])

minM[i]=temp;

}

}

}

bool may()

{

minMoney();

int sum=0;

for(int i=1;i<=n;i++){

sum+=minM[i];

}

if(sum>money)

return false;

else

return true;

}

void calneed(int m)

{

for(int i=1;i<=n;i++){

need[i]=a[i][0]*m-a[i][1];

}

}

int cal(int x,int y)

{

if(x>y)

return x-1;

int m=(x+y)/2;

calneed(m);

if(may())

cal(m+1,y);

else

cal(x,m-1);

}

void precal()

{

int t,t1,t2;

t1=((money/a[1][3]+1)*a[1][2]+a[1][1])/a[1][0]+1;

t2=((money/a[1][5]+1)*a[1][4]+a[1][1])/a[1][0]+1;

maxN=t1>t2?t1:t2;

for(int i=2;i<=n;i++){

t1=((money/a[i][3]+1)*a[i][2]+a[i][1])/a[i][0]+1;

t2=((money/a[i][5]+1)*a[i][4]+a[i][1])/a[i][0]+1;

t=t1>t2?t1:t2;

if(maxN>t)

maxN=t;

}

}

int main()

{

int i;

while(cin>>n>>money && n!=0){

memset(need,0,sizeof(need));

memset(minM,0,sizeof(minM));

memset(a,0,sizeof(a));

for(i=1;i<=n;i++){

cin>>a[i][0]>>a[i][1]>>a[i][2]>>a[i][3]>>a[i][4]>>a[i][5];

}

precal();

cout<<cal(1,maxN)<<endl;

}

return 0;

}