Cod sursa(job #2375135)

Utilizator ivan.tudorIvan Tudor ivan.tudor Data 7 martie 2019 22:32:53
Problema Lapte Scor 100
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 1.49 kb
#include <iostream>
#include<cstdio>
#include<cstring>
using namespace std;
struct lapte{
  int la,lb;
};
const int N=105;
int d[N][N];
lapte sol[N][N];
int n,l;
lapte om[N];
lapte ultcoord;
bool check(int t){
  for(int i=1;i<=n;i++){
    for(int j=0;j<=l;j++){
      d[i][j]=-1;
      sol[i][j]={0,0};
    }
  }
  for(int j=0;j<=l && j<=t/om[1].la;j++){
    d[1][j]=(t-om[1].la*j)/om[1].lb;
    sol[1][j]={j,d[1][j]};
  }
  for(int i=2;i<=n;i++){
    for(int j=0;j<=l;j++){
      for(int k=0;k<=j && k<=t/om[i].la;k++){
        if(d[i-1][j-k]>=0){
          int laptepos=d[i-1][j-k]+(t-om[i].la*k)/om[i].lb;
          d[i][j]=max(d[i][j],d[i-1][j-k]+(t-om[i].la*k)/om[i].lb);
          if(d[i][j]==d[i-1][j-k]+(t-om[i].la*k)/om[i].lb){
            sol[i][j]={k,(t-om[i].la*k)/om[i].lb};
          }
        }
      }
    }
  }
  if(d[n][l]>=l)
    return true;
  return false;
}
int cautb(){
  int p2=1<<6,pas=0;
  while(p2){
    if(!check(pas+p2))
      pas+=p2;
    p2/=2;
  }
  return pas+1;
}
FILE*fin,*fout;
void printsol(int nr,int lin){
  if(nr==0)
    return;
  printsol(nr-1,lin-sol[nr][lin].la);
  fprintf(fout,"%d %d\n",sol[nr][lin].la,sol[nr][lin].lb);
}
int main()
{

    fin=fopen("lapte.in","r");
    fout=fopen("lapte.out","w");
    fscanf(fin,"%d%d",&n,&l);
    for(int i=1;i<=n;i++){
      fscanf(fin,"%d%d",&om[i].la,&om[i].lb);
    }
    int rez=cautb();
    fprintf(fout,"%d\n",rez);
    check(rez);
    printsol(n,l);
    return 0;
}