Supermarket
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 14517 | Accepted: 6595 |
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.
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.
题意:超市 的商品有两个值,一个是利润,一个是死线,必须在死线之前卖出才有利润,一天卖一件,求最大利润。
题解:按照利润排序,依次按死线卖,开一个数组当成日历,如果死线被占用,就往前找日子,找不到就不卖这件。这种贪心保证了在取舍中一定是选择了利润大的商品卖出,所以总体肯定是最优解。
#include <iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
using namespace std;
struct node{
int p,d;
}s[10005];
int cmp(node a,node b){
return a.p>b.p;
}
int rili[10005];
int main()
{
int n,i,day;
long long sum;
while(~scanf("%d",&n)){
sum=0;
memset(rili,0,sizeof(rili));
for(i=0;i<n;i++)scanf("%d%d",&s[i].p,&s[i].d);
sort(s,s+n,cmp);
for(i=0;i<n;i++){
day=s[i].d;
while(rili[day])day--;
if(day>0){
rili[day]=1;
sum+=s[i].p;
}
}
printf("%lld\n",sum);
}
return 0;
}
百度了一下,发现这题可以用并查集优化。
我这里遇到冲突就一天天往前找是很低效的可以用并查集压缩路径一步到位。
#include <iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
struct node{
int p,d;
}a[10005];
int cmp(node a,node b){
return a.p>b.p;
}
int p[10005];
int finde(int x){
if(p[x]==x)return x;
return p[x]=finde(p[x]);
}
int main()
{
int n,i;
while(~scanf("%d",&n)){
for(i=0;i<n;i++)scanf("%d%d",&a[i].p,&a[i].d);
for(i=0;i<=10000;i++)p[i]=i;
sort(a,a+n,cmp);
int sum=0;
for(i=0;i<n;i++){
if(finde(a[i].d)==0)continue;
p[finde(a[i].d)]=finde(a[i].d)-1;
sum+=a[i].p;
}
printf("%d\n",sum);
}
return 0;
}