[BZOJ1634] [Usaco2007 Jan]Protecting the Flowers 护花
2015-07-29 06:40
489 查看
[Usaco2007 Jan]Protecting the Flowers 护花
Description
Farmer John went to cut some wood and left N (2 <= N <= 100,000) cows eating the grass, as usual. When he returned, he found to his horror that the cows were in his garden eating his beautiful flowers. Wanting to minimize the subsequent damage, FJ decided to take immediate action and transport the cows back to their barn. Each cow i is at a location that is Ti minutes (1 <= Ti <= 2,000,000) away from the barn. Furthermore, while waiting for transport, she destroys Di (1 <= Di <= 100) flowers per minute. No matter how hard he tries,FJ can only transport one cow at a time back to the barn. Moving cow i to the barn requires 2*Ti minutes (Ti to get there and Ti to return). Write a program to determine the order in which FJ should pick up the cows so that the total number of flowers destroyed is minimized.约翰留下他的N只奶牛上山采木.他离开的时候,她们像往常一样悠闲地在草场里吃草.可是,当他回来的时候,他看到了一幕惨剧:牛们正躲在他的花园里,啃食着他心爱的美丽花朵!为了使接下来花朵的损失最小,约翰赶紧采取行动,把牛们送回牛棚. 牛们从1到N编号.第i只牛所在的位置距离牛棚Ti(1≤Ti《2000000)分钟的路程,而在约翰开始送她回牛棚之前,她每分钟会啃食Di(1≤Di≤100)朵鲜花.无论多么努力,约翰一次只能送一只牛回棚.而运送第第i只牛事实上需要2Ti分钟,因为来回都需要时间. 写一个程序来决定约翰运送奶牛的顺序,使最终被吞食的花朵数量最小.
Input
Line 1: A single integerN * Lines 2..N+1: Each line contains two space-separated integers, Ti and Di, that describe a single cow’s characteristics
第1行输入N,之后N行每行输入两个整数Ti和Di.
Output
Line 1: A single integer that is the minimum number of destroyed flowers一个整数,表示最小数量的花朵被吞食.
Sample Input
63 1
2 5
2 3
3 2
4 1
1 6
Sample Output
86HINT
约翰用6,2,3,4,1,5的顺序来运送他的奶牛.Source
Silver题解
贪心我们认为两头牛a,b谁先送回对于其他牛是不影响的
我们假设一个性价比值p=送回消耗时间不送回吃草速度,显然p越小越应先送回p=\frac{送回消耗时间}{不送回吃草速度},显然p越小越应先送回
var a:array[0..100000,1..2]of longint; b:array[0..100000]of real; i,j,k:longint; n:longint; ans,sum:int64; procedure sort(l,r: longint); var i,j,y: longint; x,t:real; begin i:=l; j:=r; x:=b[(l+r) div 2]; repeat while b[i]<x do inc(i); while b[j]>x do dec(j); if not(i>j) then begin t:=b[i]; b[i]:=b[j]; b[j]:=t; y:=a[i,1]; a[i,1]:=a[j,1]; a[j,1]:=y; y:=a[i,2]; a[i,2]:=a[j,2]; a[j,2]:=y; inc(i); dec(j); end; until i>j; if l<j then sort(l,j); if i<r then sort(i,r); end; begin readln(n); sum:=0; for i:=1 to n do begin readln(a[i,1],a[i,2]); b[i]:=a[i,1]/a[i,2]; inc(sum,a[i,2]); end; sort(1,n); ans:=0; for i:=1 to n do begin inc(ans,(sum-a[i,2])*2*a[i,1]); dec(sum,a[i,2]); end; writeln(ans); end.
相关文章推荐
- VS2015 卡在 LocalESPCui for zh-cn Dev12
- 建造者设计模式举例
- 字符串匹配算法研究
- Scala界面开发:Panel、Layout
- 《草根自媒体达人运营实战》读后感
- Could not retrieve mirrorlist http://mirrorlist.centos.org/?release=7&arch=x86_64&repo=os&infra=stoc
- zz 关于推荐系统中的特征工程
- 向图片中添加磁力链接与提取
- 费城考驾照
- 史上最浅显易懂的Git学习指南
- ZOJ 3469 Food Delivery DP
- cf 442C. Artem and Array
- ZOJ 1425 Crossed Matchings DP LCS
- Sublime Text 3 使用总结
- ZOJ 3703 Happy Programming Contest 0-1背包 DP
- maven 上传项目或者jar到私服
- ISLR 4.6 Lab: Logistic Regression, LDA, QDA, and KNN
- 基于C#解决OJ刷题之输入输出问题的总结(AKOJ1064-1071A+B问题汇总)
- 手机的web页面调用相机拍照上传
- VBS_动态数组详解