poj 3262 Protecting the Flowers

最新推荐文章于 2022-04-11 09:26:15 发布

阿.荣.

最新推荐文章于 2022-04-11 09:26:15 发布

阅读量281

点赞数

分类专栏：贪心散记

本文链接：https://blog.csdn.net/bmicnj/article/details/52014593

版权

贪心同时被 2 个专栏收录

35 篇文章 0 订阅

订阅专栏

散记

24 篇文章 0 订阅

订阅专栏

Protecting the Flowers

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 6412		Accepted: 2566

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 cluster of cows was in his garden eating his beautiful flowers. Wanting to minimize the subsequent damage, FJ decided to take immediate action and transport each cow back to its own barn.

Each cow i is at a location that is T_i minutes (1 ≤ T_i ≤ 2,000,000) away from its own barn. Furthermore, while waiting for transport, she destroys D_i (1 ≤ D_i ≤ 100) flowers per minute. No matter how hard he tries, FJ can only transport one cow at a time back to her barn. Moving cow i to its barn requires 2 × T_i minutes (T_i to get there and T_i to return). FJ starts at the flower patch, transports the cow to its barn, and then walks back to the flowers, taking no extra time to get to the next cow that needs transport.

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.

Input

Line 1: A single integer N
Lines 2.. N+1: Each line contains two space-separated integers, T_i and D_i, that describe a single cow's characteristics

Output

Line 1: A single integer that is the minimum number of destroyed flowers

Sample Input

Sample Output

Hint

FJ returns the cows in the following order: 6, 2, 3, 4, 1, 5. While he is transporting cow 6 to the barn, the others destroy 24 flowers; next he will take cow 2, losing 28 more of his beautiful flora. For the cows 3, 4, 1 he loses 16, 12, and 6 flowers respectively. When he picks cow 5 there are no more cows damaging the flowers, so the loss for that cow is zero. The total flowers lost this way is 24 + 28 + 16 + 12 + 6 = 86.

推一下，既要破坏程度小，又要运输时间短，那就试试按破坏力 / 运输时间排序

开始思路有错了，只想成按时间或破坏力的情况了

贪心还是多多假设证明吧！

大神的证明：

假设牛a、b，距离为a，b，单位时间吃掉的花为da，db。

则先将a运回牛房，a、b共同吃掉的花是ya = a * da + (2 * a + b) * db
先将b运回牛房，a、b共同吃掉的花yb = b * db + (2 * b + a) * da
yb - ya = 2 * (b * da - a * db)
      当yb > ya, 即(b * da)/(a * db) > 1，即(b/db)>(a/da)时，先先将a运回牛房时间较短。
      同理，当yb < ya， 即(b/db)<(a/da)时，现将b运回去时间较短。
      当ya == yb时，运哪个都一样。
所以，可以将(x/dx)作为决策变量，这个值较小的先运回去。

代码：

#include<cstdio>
#include<algorithm>
using namespace std;
struct Node{
	__int64 t,d;
}niu[100000+10];
bool cmp(Node x,Node y)
{
	return x.d*y.t>x.t*y.d;
}                  
int main()
{
	int n;
	__int64 sum,ans;
	while(~scanf("%d",&n))
	{
		sum=0;ans=0;
		for(int i=0;i<n;i++)
		{
			scanf("%I64%I64",&niu[i].t,&niu[i].d);
			sum+=niu[i].d;
		}
		sort(niu,niu+n,cmp);
		for(int i=0;i<n-1;i++)
		{
			sum-=niu[i].d;
			ans+=sum*niu[i].t*2;
		}
		printf("%I64\n",ans);
	}	
	return 0;
}