Supermarket
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 15115 | Accepted: 6821 |
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.
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.
![](https://i-blog.csdnimg.cn/blog_migrate/f9d071d9c472cbda044241e92bee7393.jpeg)
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.
贪心题,将最大的往最后一刻放尽量,用并查集来维护向前找可用时间的过程,加速,第一次用bcj来直接记录非根节点,而是可用的节点,很好的题,自己的代码写的过于繁琐,而且还是旧的模板套路,不知道哪里wa了,这里借鉴别人的代码加以改进。
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
int bcj[10010];
struct node
{
int val, end;
}Node[10010];
int find(int x)
{
if(bcj[x] == -1) //找到可以使用的时间,一开始都为-1,每次合并就讲该点的值也就是bcj[i]--,前移一位,意味着该点的可用节点需要前移
return x;
else
return bcj[x] = find(bcj[x]);//发现此节点不可用,多次向前寻找,路径压缩
}
bool cmp(node n1, node n2)
{
return n1.val > n2.val;
}
int main()
{
int n;
while(cin >>n)
{
memset(bcj, -1, sizeof(bcj));
for(int i=0;i<n;i++)
{
cin >> Node[i].val >> Node[i].end;
}
int ans = 0;
sort(Node, Node+n,cmp);
for(int i=0;i<n;i++)
{
int root = find(Node[i].end);
if(root > 0)
{
ans += Node[i].val;
bcj[root] = root-1; //合并节点,将bcj[i]前移
}
}
cout << ans << endl;
}
return 0;
}