hdu 4442 贪心(交换排序)
来源:互联网 发布:网络推广服务协议 编辑:程序博客网 时间:2024/06/06 12:23
Physical Examination
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5816 Accepted Submission(s): 1627
Problem Description
WANGPENG is a freshman. He is requested to have a physical examination when entering the university.
Now WANGPENG arrives at the hospital. Er….. There are so many students, and the number is increasing!
There are many examination subjects to do, and there is a queue for every subject. The queues are getting longer as time goes by. Choosing the queue to stand is always a problem. Please help WANGPENG to determine an exam sequence, so that he can finish all the physical examination subjects as early as possible.
Now WANGPENG arrives at the hospital. Er….. There are so many students, and the number is increasing!
There are many examination subjects to do, and there is a queue for every subject. The queues are getting longer as time goes by. Choosing the queue to stand is always a problem. Please help WANGPENG to determine an exam sequence, so that he can finish all the physical examination subjects as early as possible.
Input
There are several test cases. Each test case starts with a positive integer n in a line, meaning the number of subjects(queues).
Then n lines follow. The i-th line has a pair of integers (ai, bi) to describe the i-th queue:
1. If WANGPENG follows this queue at time 0, WANGPENG has to wait for ai seconds to finish this subject.
2. As the queue is getting longer, the waiting time will increase bi seconds every second while WANGPENG is not in the queue.
The input ends with n = 0.
For all test cases, 0<n≤100000, 0≤ai,bi<231.
Then n lines follow. The i-th line has a pair of integers (ai, bi) to describe the i-th queue:
1. If WANGPENG follows this queue at time 0, WANGPENG has to wait for ai seconds to finish this subject.
2. As the queue is getting longer, the waiting time will increase bi seconds every second while WANGPENG is not in the queue.
The input ends with n = 0.
For all test cases, 0<n≤100000, 0≤ai,bi<231.
Output
For each test case, output one line with an integer: the earliest time (counted by seconds) that WANGPENG can finish all exam subjects. Since WANGPENG is always confused by years, just print the seconds mod 365×24×60×60.
Sample Input
51 22 33 44 55 60
Sample Output
1419HintIn the Sample Input, WANGPENG just follow the given order. He spends 1 second in the first queue, 5 seconds in the 2th queue, 27 seconds in the 3th queue, 169 seconds in the 4th queue, and 1217 seconds in the 5th queue. So the total time is 1419s. WANGPENG has computed all possible orders in his 120-core-parallel head, and decided that this is the optimal choice.
Source
2012 Asia JinHua Regional Contest
//对于(a1,b1)和(a2,b2),先做1时,时间是a1*b2+a1+a2,先做2时,时间是a2*b1+a1+a2,1<=2时,a1*b2<=a2*b1,交换排序。#include<stdio.h>#include<algorithm>#define N 100005typedef __int64 ll;#define mod (ll)31536000using namespace std;struct node{ ll x,y;}a[N];bool cmp(node a,node b){ return a.x*b.y<a.y*b.x;}int main(){ ll i,n,qian,sum,now; while(scanf("%I64d",&n),n!=0) { for(i=0;i<n;i++) scanf("%I64d%I64d",&a[i].x,&a[i].y); sort(a,a+n,cmp); qian=0; sum=0; for(i=0;i<n;i++) { now=(a[i].y*qian+a[i].x)%mod; sum+=now; sum%=mod; qian+=now; qian%=mod; //printf("sum=%lld now=%lld\n",sum,now); } printf("%I64d\n",sum%mod); } return 0;}
0 0
- hdu 4442 贪心(交换排序)
- hdu 2491 (贪心+排序)
- Saving HDU+排序+贪心
- HDU 3661 Assignments 贪心排序
- HDU 1871 无题 贪心排序
- hdu 5195 拓扑排序+贪心
- HDU 5695 拓扑排序+贪心
- 贪心算法(hdu 4442 hdu 3183)
- hdu 1009 肥胖鼠 贪心(一) sort 排序函数
- hdu 3177 Crixalis's Equipment (贪心- - 排序)
- hdu 2037 贪心+结构体排序(备战LQB)
- HDU 1009 FatMouse' Trade (贪心、结构体排序)
- HDU 5098 Smart Software Installer(拓扑排序+贪心)
- HDU 5638 Toposort(贪心+优先队列+拓扑排序)
- HDU 2146 结构体排序(类贪心)
- algorithm_of_sort(交换排序)
- 交换排序(Java)
- 数据结构(交换排序)
- JS 获取当前日期、时间、星期 js时间 1410202
- 注意不要将函数命名与系统函数相同
- rthfthjgk
- Sicily 1001. Alphacode
- H3C S3600 Series配置实例
- hdu 4442 贪心(交换排序)
- 苹果开发之路--swift之UIAlertView
- 查看mysql版本号
- 页面下拉加载数据
- redistribute 【routing-process】 【process-id】 subnets的作用
- SGE作业的提交
- Python小试
- 1.MIL 编程环境设置
- 苏州供应直流稳压电源RD-1005 100V5A