关闭

CodeForces 3B Lorry 贪心

657人阅读 评论(0) 收藏 举报
分类:

题目大意是有体积为v的背包,有体积为1和2的两种物品若干,这些物品都有各自的价值。求如何取这些物品可使背包中物品的价值最大。

开始一看到是背包就傻眼了==因为数据量太大1 ≤ n ≤ 1051 ≤ v ≤ 10

搜题解有说用优先队列做的,好麻烦==有一种思路我很喜欢:既然涉及到背包或者贪心这类DP问题,一定是取最优的解。即如果把两种船只分别存到两个数组里,再由大到小排序,最终的结果一定是两个数组各自的前1~M个,且无跳跃,分别都是连续的。那么假设我遍历大船的情况从0到船只数,意味着分别是有0个大船、1个大船、、、所有大船,剩余的费用给小船。在循环中记录每次的最大值及大船、小船的个数。

还有就是最后输出结果中第二行表示船的序号,另:G++ WA了 VC++ AC了

Description

A group of tourists is going to kayak and catamaran tour. A rented lorry has arrived to the boat depot to take kayaks and catamarans to the point of departure. It's known that all kayaks are of the same size (and each of them occupies the space of 1 cubic metre), and all catamarans are of the same size, but two times bigger than kayaks (and occupy the space of 2 cubic metres).

Each waterborne vehicle has a particular carrying capacity, and it should be noted that waterborne vehicles that look the same can have different carrying capacities. Knowing the truck body volume and the list of waterborne vehicles in the boat depot (for each one its type and carrying capacity are known), find out such set of vehicles that can be taken in the lorry, and that has the maximum total carrying capacity. The truck body volume of the lorry can be used effectively, that is to say you can always put into the lorry a waterborne vehicle that occupies the space not exceeding the free space left in the truck body.

Input

The first line contains a pair of integer numbers n and v (1 ≤ n ≤ 1051 ≤ v ≤ 109), where n is the number of waterborne vehicles in the boat depot, and v is the truck body volume of the lorry in cubic metres. The following n lines contain the information about the waterborne vehicles, that is a pair of numbers ti, pi (1 ≤ ti ≤ 21 ≤ pi ≤ 104), where ti is the vehicle type (1 – a kayak, 2 – a catamaran), and pi is its carrying capacity. The waterborne vehicles are enumerated in order of their appearance in the input file.

Output

In the first line print the maximum possible carrying capacity of the set. In the second line print a string consisting of the numbers of the vehicles that make the optimal set. If the answer is not unique, print any of them.

Sample Input

Input
3 2
1 2
2 7
1 3
Output
7
2
#include <iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
struct ship
{
    int id,cost;
}ka[100000],ca[100000];
bool cmp(ship a,ship b)
{
    return a.cost>b.cost;
}
int total1[100000],total2[100000];
int n,v,sum[100000],t;
int main()
{
  // freopen("cin.txt","r",stdin);
    //freopen("cout.txt","w",stdout);
    while(~scanf("%d%d",&n,&v))
    {
        int num1=0,num2=0;
        for(int i=1;i<=n;i++) {
            scanf("%d",&t);
            if(t==1) {scanf("%d",&ka[num1].cost);ka[num1++].id=i;}
            else {scanf("%d",&ca[num2].cost);ca[num2++].id=i;}
        }
        sort(ka,ka+num1,cmp);
        //for(int i=0;i<num1;i++) printf("i=%d %d  ",ka[i].id,ka[i].cost);printf("\n");
        sort(ca,ca+num2,cmp);
        //for(int i=0;i<num2;i++) printf("i=%d %d  ",ca[i].id,ca[i].cost);printf("\n");
        int p1=0,p2=0,ans=0;
        total1[0]=0,total2[0]=0,total1[1]=ka[0].cost,total2[1]=ca[0].cost;
        for(int i=1;i<num1;i++) total1[i+1]=total1[i]+ka[i].cost;
        for(int i=1;i<num2;i++) total2[i+1]=total2[i]+ca[i].cost;
        int cnt=0,t,tmp,max0=-1,max1=-1,max2=-1;
        for(int i=0;i<=num2;i++)
        {
            if(i*2>v) break;
            t=v-i*2;
            if(t>num1) t=num1;
            if(total2[i]+total1[t]>max0)
            {
                max0=total2[i]+total1[t];
                max1=t;
                max2=i;
            }
        }
        printf("%d\n",max0);
        for(int i=0;i<max1;i++) printf("%d ",ka[i].id);
        for(int i=0;i<max2;i++) printf("%d ",ca[i].id);
        printf("\n");
    }
    return 0;
}


0
0
查看评论

codeforces 3B (贪心)

两种船,大小分别为1、2。现有一辆容量为v的卡车,给出n艘船类型,以及相应的价值,求最大装载价值以及所选的船只编号。   贪心策略:将大小为1、2的船分开来,按照价值从大到小排序。然后按价值由大到小,先装入大小为2的船直到装不下,再装大小为1的船。记录下此时大小为1、2的船个数n1,n...
  • u014679804
  • u014679804
  • 2015-03-30 22:25
  • 435

codeforces 3B Lorry

B. Lorry time limit per test 2 seconds memory limit per test 64 megabytes input standard input output standard output A group of tourists i...
  • ahoLic
  • ahoLic
  • 2014-03-28 12:29
  • 2186

-----CodeForces 3B Lorry-----贪心-------

B - Lorry Time Limit:2000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u Su...
  • yu_ming_cong
  • yu_ming_cong
  • 2015-07-10 09:58
  • 468

codeforces 3B Lorry 贪心

背包问题的贪心,因为每个物品的重量是1或是2,最优组合也是1和2物品的组合,所以枚举重量是1的物品的组合和重量是2的物品的组合的组合,选最优的组合即可 #include #include #include #define size 5; struct node{ int p; in...
  • yan_____
  • yan_____
  • 2012-12-07 15:47
  • 637

Codeforces 3B Lorry 贪心

分开处理,把1和2分开存放到不同的容器中,然后分别排序。 先处理1,再处理2,再处理跨1和2的。 #include #include #include #include #include using namespace std; class node{ public:...
  • llkpersonal
  • llkpersonal
  • 2013-08-20 14:13
  • 437

Codeforces Beta Round #3——B. Lorry

题意: 现在告诉你有n个物品,背包的体积为V。 然后n行,有两种类型的物品,如果是1类型的物品,那么它的体积为1,如果是2类型的物品,那么它的体积为2。并同时告诉了我们每种物品的价值。 问你在不超过背包的容量的情况下,所能获得的背包的最大价值。并同时输出被选在背包中的物品的序号。 思路: 因为V十分...
  • ACMer_hades
  • ACMer_hades
  • 2015-09-25 20:09
  • 413

CodeForce 3B Lorry(贪心)

B. Lorry time limit per test 2 seconds memory limit per test 64 megabytes input standard input output standard output A...
  • LYHVOYAGE
  • LYHVOYAGE
  • 2014-10-16 20:16
  • 1604

CodeForces 3B Lorry

题目链接:http://codeforces.com/problemset/problem/3/B 问题的意思很是简单,
  • u011394362
  • u011394362
  • 2014-10-16 20:16
  • 628

Codeforces 3B Lorry

EnglishDescA group of tourists is going to kayak and catamaran tour. A rented lorry has arrived to the boat depot to take kayaks and catamarans to the...
  • linglian0522
  • linglian0522
  • 2017-05-06 22:16
  • 270

Codeforces 3 B. Lorry 暴力 排序 枚举 贪心

B. Lorry time limit per test 2 seconds memory limit per test 64 megabytes input standard input output standard output A...
  • cokomowang
  • cokomowang
  • 2014-10-18 09:03
  • 506
    碎碎念
    周小姐,你还想毕业找不到工作吗????
    个人资料
    • 访问:282381次
    • 积分:8844
    • 等级:
    • 排名:第2585名
    • 原创:609篇
    • 转载:25篇
    • 译文:0篇
    • 评论:38条
    友情链接