POJ 1456 Supermarket （贪心or并查集）

Description

A supermarket has a set Prod of products on sale. It earns a profit px for each product x∈Prod sold by a deadline dx that is measured as an integral number of time units starting from the moment the sale begins. Each product takes precisely one unit of time for being sold. A selling schedule is an ordered subset of products Sell ≤ Prod such that the selling of each product x∈Sell, according to the ordering of Sell, completes before the deadline dx or just when dx expires. The profit of the selling schedule is Profit(Sell)=Σx∈Sellpx. An optimal selling schedule is a schedule with a maximum profit.
For example, consider the products Prod={a,b,c,d} with (pa,da)=(50,2), (pb,db)=(10,1), (pc,dc)=(20,2), and (pd,dd)=(30,1). The possible selling schedules are listed in table 1. For instance, the schedule Sell={d,a} shows that the selling of product d starts at time 0 and ends at time 1, while the selling of product a starts at time 1 and ends at time 2. Each of these products is sold by its deadline. Sell is the optimal schedule and its profit is 80.

Write a program that reads sets of products from an input text file and computes the profit of an optimal selling schedule for each set of products.

Input

A set of products starts with an integer 0 <= n <= 10000, which is the number of products in the set, and continues with n pairs pi di of integers, 1 <= pi <= 10000 and 1 <= di <= 10000, that designate the profit and the selling deadline of the i-th product. White spaces can occur freely in input. Input data terminate with an end of file and are guaranteed correct.

Output

For each set of products, the program prints on the standard output the profit of an optimal selling schedule for the set. Each result is printed from the beginning of a separate line.

Sample Input

4  50 2  10 1   20 2   30 1

7  20 1   2 1   10 3  100 2   8 2
   5 20  50 10

Sample Output

80
185

Hint

The sample input contains two product sets. The first set encodes the products from table 1. The second set is for 7 products. The profit of an optimal schedule for these products is 185.

给你 N 件不同的商品，每件商品最多可以买一次。每件物品对应两个值 pi   di pi 表示物品的价值，di 表示可以买的最迟时间（也就是第一天到第 di 天都可以买这件物品）

规定：每天最多可以买一件物品，问你可以得到的最大价值。

这道题我以前是用贪心做的，今天发现使用并查集的话复杂度更低而且更简单。

贪心代码：

将物品按照价值从大到小排序   依次枚举每件物品 从可以买的最后一天枚举，看是否可以买注意：标记天数。

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<vector>
#include<stdlib.h>
#include<queue>
#include<map>
#include<vector>
#include<math.h>
const int INF = 0x3f3f3f3f;
using namespace std;
typedef long long ll;
typedef double ld;
int i,j,k,l;
int n,m;
ll sum;
bool vis[10010];
struct goods
{
    int f,d;
} g[10010];

bool cmp(goods a,goods b)
{
    return a.f>b.f;
}

int main()
{
    while(~scanf("%d",&n))
    {
        memset(vis,0,sizeof vis );
        for (i=0; i<n; i++)
        {
            scanf("%d %d",&g[i].f,&g[i].d);
        }
        sort(g,g+n,cmp);
        sum=0;
        for(i=0; i<n; i++)
        {
            int temp=g[i].d;
            while(temp>0)
            {
                if(!vis[temp])
                {
                    sum+=g[i].f;
                    vis[temp]=1;
                        break;
                }
                else
                    temp--;
            }

        }
        printf("%lld\n",sum);
    }
    return 0;
}

并查集代码：

将物品按照价值从大到小排序 处理的时候选择最后的一个不冲突点。用并查集实现链表的作用，快速找到不冲突点。

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<cstring>
#include<cmath>
#include<ctime>
#include<algorithm>
#include<utility>
#include<stack>
#include<queue>
#include<vector>
#include<set>
#include<map>
using namespace std;
typedef long long ll;
typedef double ld;
const int INF=0x3f3f3f3f;
const int MAXN=10010;
int F[MAXN];
struct Node
{
    int p,d;
} node[MAXN];
bool cmp(Node a,Node b)//按p从大到小排序。d没有关系
{
    return a.p>b.p;
}
int find(int x)
{
    if(F[x]==-1)return x;
    return F[x]=find(F[x]);
}
int main()
{
    int n;
    while(scanf("%d",&n)==1)
    {
        memset(F,-1,sizeof(F));
        for(int i=0; i<n; i++)
            scanf("%d%d",&node[i].p,&node[i].d);
        sort(node,node+n,cmp);
        int ans=0;
        for(int i=0; i<n; i++)
        {
            int t=find(node[i].d);
            if(t>0)
            {
                ans+=node[i].p;
                F[t]=t-1;
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}