【BZOJ】1680: [Usaco2005 Mar]Yogurt factory(贪心)
2014-09-14 15:55
429 查看
http://www.lydsy.com/JudgeOnline/problem.php?id=1680
看不懂英文。。
题意是有n天,第i天生产的费用是c[i],要生产y[i]个产品,可以用当天的也可以用以前的(多生产的)。每单位产品保存一天的费用是s。求最小费用
显然贪心,每次查找之前有没有哪一天保存到现在的价值最小,然后比较更新。。
88 200
89 400
97 300
91 500
OUTPUT DETAILS:
In week 1, produce 200 units of yogurt and deliver all of it. In
week 2, produce 700 units: deliver 400 units while storing 300
units. In week 3, deliver the 300 units that were stored. In week
4, produce and deliver 500 units.
看不懂英文。。
题意是有n天,第i天生产的费用是c[i],要生产y[i]个产品,可以用当天的也可以用以前的(多生产的)。每单位产品保存一天的费用是s。求最小费用
显然贪心,每次查找之前有没有哪一天保存到现在的价值最小,然后比较更新。。
#include <cstdio> #include <cstring> #include <cmath> #include <string> #include <iostream> #include <algorithm> #include <queue> using namespace std; #define rep(i, n) for(int i=0; i<(n); ++i) #define for1(i,a,n) for(int i=(a);i<=(n);++i) #define for2(i,a,n) for(int i=(a);i<(n);++i) #define for3(i,a,n) for(int i=(a);i>=(n);--i) #define for4(i,a,n) for(int i=(a);i>(n);--i) #define CC(i,a) memset(i,a,sizeof(i)) #define read(a) a=getint() #define print(a) printf("%lld", a) #define dbg(x) cout << #x << " = " << x << endl #define printarr(a, n, m) rep(aaa, n) { rep(bbb, m) cout << a[aaa][bbb]; cout << endl; } inline const int getint() { int r=0, k=1; char c=getchar(); for(; c<'0'||c>'9'; c=getchar()) if(c=='-') k=-1; for(; c>='0'&&c<='9'; c=getchar()) r=r*10+c-'0'; return k*r; } inline const int max(const int &a, const int &b) { return a>b?a:b; } inline const int min(const int &a, const int &b) { return a<b?a:b; } long long n, ans, s, sum=~0u>>2; int main() { read(n); read(s); for1(i, 1, n) { long long a=getint(), b=getint(); sum+=s; if(sum>a) sum=a; ans+=sum*b; } print(ans); return 0; }
Description
The cows have purchased a yogurt factory that makes world-famous Yucky Yogurt. Over the next N (1 <= N <= 10,000) weeks, the price of milk and labor will fluctuate weekly such that it will cost the company C_i (1 <= C_i <= 5,000) cents to produce one unit of yogurt in week i. Yucky's factory, being well-designed, can produce arbitrarily many units of yogurt each week. Yucky Yogurt owns a warehouse that can store unused yogurt at a constant fee of S (1 <= S <= 100) cents per unit of yogurt per week. Fortuitously, yogurt does not spoil. Yucky Yogurt's warehouse is enormous, so it can hold arbitrarily many units of yogurt. Yucky wants to find a way to make weekly deliveries of Y_i (0 <= Y_i <= 10,000) units of yogurt to its clientele (Y_i is the delivery quantity in week i). Help Yucky minimize its costs over the entire N-week period. Yogurt produced in week i, as well as any yogurt already in storage, can be used to meet Yucky's demand for that week.Input
* Line 1: Two space-separated integers, N and S. * Lines 2..N+1: Line i+1 contains two space-separated integers: C_i and Y_i.Output
* Line 1: Line 1 contains a single integer: the minimum total cost to satisfy the yogurt schedule. Note that the total might be too large for a 32-bit integer.Sample Input
4 588 200
89 400
97 300
91 500
Sample Output
126900OUTPUT DETAILS:
In week 1, produce 200 units of yogurt and deliver all of it. In
week 2, produce 700 units: deliver 400 units while storing 300
units. In week 3, deliver the 300 units that were stored. In week
4, produce and deliver 500 units.
HINT
Source
Silver相关文章推荐
- bzoj 1680: [Usaco2005 Mar]Yogurt factory【贪心】
- poj 2393 && bzoj 1680: [Usaco2005 Mar]Yogurt factory(贪心)
- BZOJ 1740: [Usaco2005 mar]Yogurt factory 奶酪工厂
- BZOJ1740: [Usaco2005 mar]Yogurt factory 奶酪工厂
- 1740: [Usaco2005 mar]Yogurt factory 奶酪工厂
- 1740: [Usaco2005 mar]Yogurt factory 奶酪工厂
- bzoj1680[Usaco2005 Mar]Yogurt factory
- bzoj1680[Usaco2005 Mar]Yogurt factory
- BZOJ1680: [Usaco2005 Mar]Yogurt factory
- 【bzoj1704】[Usaco2007 Mar]Face The Right Way 自动转身机 贪心
- bzoj 1734: [Usaco2005 feb]Aggressive cows 愤怒的牛【二分+贪心】
- bzoj 1704: [Usaco2007 Mar]Face The Right Way 自动转身机 -- 贪心
- bzoj 1689: [Usaco2005 Open] Muddy roads 泥泞的路【贪心】
- bzoj 1682: [Usaco2005 Mar]Out of Hay 干草危机(最小生成树)
- bzoj 1682: [Usaco2005 Mar]Out of Hay 干草危机【并查集+二分】
- BZOJ1739: [Usaco2005 mar]Space Elevator 太空电梯
- BZOJ 1828 [Usaco2010 Mar]balloc 农场分配(贪心+线段树)
- bzoj1682 [Usaco2005 Mar]Out of Hay 干草危机(kruskal裸题)
- 【BZOJ】1685: [Usaco2005 Oct]Allowance 津贴(贪心)
- BZOJ 1738: [Usaco2005 mar]Ombrophobic Bovines 发抖的牛 二分 网络流