Cod sursa(job #799878)

Utilizator BarracudaFMI-Alex Dobrin Barracuda Data 20 octombrie 2012 11:59:22
Problema Lapte Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.06 kb
#include<fstream>

#define dim 102
using namespace std;



ifstream f("lapte.in");
ofstream g("lapte.out");

int D[dim][dim],TM,i,j,LA[dim],LB[dim],CA[dim],CB[dim],AF[dim][dim],n,L;
int det(	int X 	){
	int i,j,k,TLA;
	for(i=1;i<=n;++i)
		for(j=1;j<=n;++j)
			D[i][j]=-1;
	for(i=1;i<=n;++i)
		for(j=0;j<=L;++j){
			D[i][j]=-1;
			for(k=0;k<=j;++k){
				
				if(D[i-1][k]!=-1){
					TLA=(j-k)*LA[i];
					if(TLA<=X){
						if(D[i][j]<D[i-1][k]+(X-TLA)/LB[i]){
							D[i][j]=D[i-1][k]+(X-TLA)/LB[i];
							AF[i][j]=k;
						}
					}
				}
			}
			
		}
	
	if(D[n][L]>=L)
		return 1;
	
	return 0;
}
int bs(int st,int dr){
	
	int poz=st;
	int m;
	while(st<=dr){
		
		m=(st+dr)/2;
		if(det(m)){
			poz=m;
			st=m+1;
		}
		else
			dr=m-1;
		
	}
	return poz;
}
int main () {
	
	f>>n>>L;
	
	
	for(i=1;i<=n;++i)
		f>>LA[i]>>LB[i];

	TM=bs(1,110);
	
	det(TM);
	
	for(i=n;i>=1;i--){
		CB[i]=D[i][L]-D[i-1][AF[i][L]];
		CA[i]=L-AF[i][L];
		L-=CA[i];
	}
	
	for(i=1;i<=n;++i)
		g<<CA[i]<<" "<<CB[i]<<"\n";

	return 0;
}