NYOJ 248 BUYING FEED

原创 2016年05月30日 15:01:20

BUYING FEED

时间限制:3000 ms  |  内存限制:65535 KB
难度:4
描述

Farmer John needs to travel to town to pick up K (1 <= K <= 100)pounds of feed. Driving D miles with K pounds of feed in his truck costs D*K cents.

The county feed lot has N (1 <= N<= 100) stores (conveniently numbered 1..N) that sell feed. Each store is located on a segment of the X axis whose length is E (1 <= E <= 350). Store i is at location X_i (0 < X_i < E) on the number line and can sell John as much as F_i (1 <= F_i <= 100) pounds of feed at a cost of C_i (1 <= C_i <= 1,000,000) cents per pound.
Amazingly, a given point on  the X axis might have more than one store.

Farmer John  starts  at location 0 on this number line and can drive only in the positive direction, ultimately arriving at location E, with at least K pounds of feed. He can stop at any of the feed stores along the way and buy any amount of feed up to the the store's limit.  What is the minimum amount Farmer John has to pay to buy and transport the K pounds of feed? Farmer John
knows there is a solution.
 Consider a sample where Farmer John  needs two pounds of feed from three stores (locations: 1, 3, and 4) on a number line whose range is 0..5:     
0   1   2  3   4   5
    
---------------------------------
         
1       1   1                Available pounds of feed
         
1       2   2               Cents per pound

It is best for John to buy one pound of feed from both the second and third stores. He must pay two cents to buy each pound of feed for a total cost of 4. When John travels from 3 to 4 he is moving 1 unit of length and he has 1 pound of feed so he must pay1*1 = 1 cents.

When John travels from 4 to 5 heis moving one unit and he has 2 pounds of feed so he must pay 1*2 = 2 cents. The total cost is 4+1+2 = 7 cents.

输入
The first line of input contains a number c giving the number of cases that follow
There are multi test cases ending with EOF.
Each case starts with a line containing three space-separated integers: K, E, and N
Then N lines follow :every line contains three space-separated integers: Xi Fi Ci
输出
For each case,Output A single integer that is the minimum cost for FJ to buy and transport the feed
样例输入
1
2 5 3                 
3 1 2
4 1 2
1 1 1
样例输出
7

题意:John 需要买饲料,有一条X轴,在X轴的某些点上面有店出售饲料。题目给出了有饲料的商店的编号跟每磅饲料需要付出的价钱。各个商店的饲料价钱可能不想同,还要最多能出售的饲料的数目。最主要的是饲料有质量,题目说是从0为起始点,假设在1点买了一磅食物,这一磅食物运到终点假设坐标为5,需要花费(5-1)=4个单位的运费。

分析:求出每个商店(每一点)每买一磅食物需要的价钱,价钱中包括从这点运到终点需要的运费。

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;

struct P
{
    int pay;      //单位物品支付价钱
    int get;
}p[1010];

int t;
int need, total, n;
int num, prize, sum;

//  按照各点的单位物品支付价钱从小到大排序,为贪心做准备
int cmp(P a, P b)     
{
    return a.pay < b.pay;
}

int main()
{
    scanf("%d", &t);
    while (t--){
        sum = 0;
        scanf("%d%d%d", &need, &total, &n);    //need代表需要的总质量,total代表有在轴上有多少个点
        for (int i = 0; i < n; i++){
            scanf("%d%d%d", &num, &p[i].get, &prize);    //num代表点的编号,prize表示每买单位质量花的价钱
            p[i].pay = (total - num) + prize;    //计算每点每买单位质量需要花的钱
        }
        sort(p, p + n, cmp);      //贪心,每次都取花费最少的
        for (int i = 0; i < n; i++){
            if (p[i].get >= need){
                sum += p[i].pay * need;
                break;
            }
            else{
                sum += p[i].get * p[i].pay;
                need -= p[i].get;
            }
        }
        printf("%d\n", sum);
    }
    return 0;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

nyoj 248 BUYING FEED 第三届河南省赛

Farmer John needs to travel to town to pick up K (1
  • qqchanmingdexiaji
  • qqchanmingdexiaji
  • 2016年11月03日 21:14
  • 150

nyoj 题目 BUYING FEED 贪心算法

BUYING FEED 时间限制:3000 ms  |  内存限制:65535 KB 难度:4 描述 Farmer John needs to travel to town to pick...
  • BBHHTT
  • BBHHTT
  • 2017年08月01日 16:26
  • 108

第三届河南省acm省赛 BUYING FEED

BUYING FEED 时间限制:3000 ms  |  内存限制:65535 KB 难度:4 描述 Farmer John needs to travel to town to pick...
  • zs520ct
  • zs520ct
  • 2016年05月05日 10:22
  • 210

BUYING FEED(贪心+树状动态规划)

BUYING FEED 时间限制:3000 ms  |  内存限制:65535 KB 难度:4 描述 Farmer John needs to travel to town to pic...
  • u013455430
  • u013455430
  • 2014年05月15日 12:05
  • 244

第三届省赛题 BUYING FEED

BUYING FEED 时间限制:3000 ms  |  内存限制:65535 KB 难度:4 描述 Farmer John needs to travel to town to pick...
  • SecienceJohn
  • SecienceJohn
  • 2017年04月19日 10:26
  • 129

什么是Feed流

作者:胡点Vivian 链接:https://www.zhihu.com/question/20825185/answer/107671816 来源:知乎 著作权归作者所有。商业转载请联系作者获...
  • cn_wk
  • cn_wk
  • 2017年03月16日 19:21
  • 1520

订阅基础:RSS、ATOM、FEED、聚合、供稿、合烧与订阅

http://www.metsky.com/archives/361.html 很多网友对这类名词概念非常陌生,如果没用过FEED订阅,肯定还会对诸多网站显示的FEED聚合、订阅、ATOM等...
  • hshl1214
  • hshl1214
  • 2016年01月25日 14:49
  • 891

为Jekyll博客添加RSS feed订阅功能

我们都知道,很多人经常会在博客里面分享很多有价值的东西。我们通过别人的博客,获取知识,找到问题的解决办法,寻求真理。但是,如果别人的博客有了更新的时候,我们如何第一时间获取到更新的消息呢?RSS订阅是...
  • itmyhome
  • itmyhome
  • 2015年01月25日 22:01
  • 3954

Feed设计与实现

Feed,在社交和信息推荐的App与网站中,基本都会用到的。例如常用的新浪微博,用户登录进入后,展现给我们的就是feed信息流。新浪微博的信息,来自于你关注人所发布的内容。还有微信的朋友圈,今日头条的...
  • gglinux
  • gglinux
  • 2017年03月07日 14:13
  • 1056

Scrapy爬虫入门教程十 Feed exports(导出文件)

Scrapy爬虫入门教程十 Feed exports(导出文件)
  • Inke88
  • Inke88
  • 2017年03月07日 16:48
  • 1904
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:NYOJ 248 BUYING FEED
举报原因:
原因补充:

(最多只允许输入30个字)