Light oj 1180 - Software Company(二分+背包)
来源:互联网 发布:数据的分散和集中程度 编辑:程序博客网 时间:2024/06/07 11:34
A software developing company has been assigned two programming projects. As both projects are within the same contract, both must be handed in at the same time. It does not help if one is finished earlier.
This company has n employees to do the jobs. To manage the two projects more easily, each is divided into m independent subprojects. Only one employee can work on a single subproject at one time, but it is possible for two employees to work on different subprojects of the same project simultaneously. Our goal is to finish the projects as soon as possible.
Input
Input starts with an integer T (≤ 12), denoting the number of test cases.
Each case starts with two integers n (1 ≤ n ≤ 100), and m (1 ≤ m ≤ 100). Each of the next n lines contains two integers which specify how much time in seconds it will take for the specified employee to complete one subproject of each project. So if the line contains x and y, it means that it takes the employee x seconds to complete a subproject from the first project, and y seconds to complete a subproject from the second project.
Output
For each case, print the case number and the minimum amount of time in seconds after which both projects can be completed. The input will be such that answer will be within 50000.
Sample Input
Output for Sample Input
1
3 20
1 1
2 4
1 6
Case 1: 18
/*参考链接 : http://www.cnblogs.com/jianglangcaijin/archive/2012/10/22/2734212.html*/#pragma comment(linker, "/STACK:1024000000,1024000000")#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>#include<queue>#include<stack>#include<vector>#include<map>#define L(x) (x<<1)#define R(x) (x<<1|1)#define MID(x,y) ((x+y)>>1)#define bug printf("hihi\n")#define eps 1e-12typedef __int64 ll;using namespace std;#define N 105int n,m;int a[N],b[N];int dp[N];int judge(int mid){ int i,j; memset(dp,-1,sizeof(dp)); dp[0]=0; for(int i=1;i<=n;i++) { int t=mid/a[i]; //对于第i个人,可以做t个a[i],拿出s个来做b[i] for(int v=m;v>=0;v--) for(int s=0;s<=t&&s<=v;s++) if(dp[v-s]!=-1) dp[v]=max(dp[v],dp[v-s]+(mid-s*a[i])/b[i]); } return dp[m]>=m;}int main(){ int i,j,t,ca=0; scanf("%d",&t); while(t--) { scanf("%d%d",&n,&m); for(i=1;i<=n;i++) scanf("%d%d",&a[i],&b[i]); int le,ri,ans; le=0; ri=a[1]*m+b[1]*m; while(le<=ri) { int mid=(le+ri)>>1; if(judge(mid)) { ans=mid; ri=mid-1; } else { le=mid+1; } } printf("Case %d: %d\n",++ca,ans); } return 0;}
- Light oj 1180 - Software Company(二分+背包)
- Light OJ 1180 Software Company (二分+DP)
- LightOJ - 1180 Software Company(二分+dp)
- lightoj 1180 - Software Company 二分+DP
- Light OJ 1036A Refining Company (DP)
- Light OJ 1036A Refining Company
- 【Light-oj】-Expanding Rods(二分&几何)
- 【light-oj】-’1307 - Counting Triangles(二分)
- light oj 1062 二分
- Light OJ-----1138二分
- Poj 1973 Software Company(二分+并行DP)
- Light OJ 1231(背包dp)
- Light OJ 1088 Points in Segments-二分(水)
- Light OJ 1105 Fi Binary Number(二分+数位DP)
- Light OJ:1138 Trailing Zeroes (III)(二分)
- Light OJ:1137 Expanding Rods(二分+几何数学)
- light oj 1149 - Factors and Multiples (二分匹配)
- 【Light-oj】-1138 - Trailing Zeroes (III)(二分,数学)
- 使用Word2013/2016发布CSDN博客
- USACO刷怪塔的开始
- HDU5477 A Sweet Journey 模拟
- 【猪猪-前端】HTML5+CSS3技术制作的计算器,下载即可使用,学习HTML5必备DEMO
- 美國公佈 防老年癡呆幾個秘訣: "飲食寡淡是老年癡呆的禍根"
- Light oj 1180 - Software Company(二分+背包)
- URLSession 介绍
- JFreeChart(三.饼状图.2)
- 这件事如何引发李连杰、高晓松、吴莫愁共同参与?
- Prime Ring Problem 1016 (dfs)
- iOS程序的启动过程
- 这件事如何引发李连杰、高晓松、吴莫愁共同参与?
- spring4mvc+hibernate4整合
- JavaScript高级程序设计之引用类型之单体内置对象之Global对象第5.7.1讲笔记