poj3190 （mulitset贪心）

最新推荐文章于 2021-10-22 19:09:06 发布

A_Happyer

最新推荐文章于 2021-10-22 19:09:06 发布

阅读量532

点赞数

分类专栏：贪心基本数据结构

本文链接：https://blog.csdn.net/u014569598/article/details/38292213

版权

基本数据结构同时被 2 个专栏收录

13 篇文章 0 订阅

订阅专栏

贪心

12 篇文章 0 订阅

订阅专栏

J - Problem J

Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u

Submit Status

Description

Oh those picky N (1 <= N <= 50,000) cows! They are so picky that each one will only be milked over some precise time interval A..B (1 <= A <= B <= 1,000,000), which includes both times A and B. Obviously, FJ must create a reservation system to determine which stall each cow can be assigned for her milking time. Of course, no cow will share such a private moment with other cows.

Help FJ by determining:

The minimum number of stalls required in the barn so that each cow can have her private milking period
An assignment of cows to these stalls over time

Many answers are correct for each test dataset; a program will grade your answer.

Input

Line 1: A single integer, N

Lines 2..N+1: Line i+1 describes cow i's milking interval with two space-separated integers.

Output

Line 1: The minimum number of stalls the barn must have.

Lines 2..N+1: Line i+1 describes the stall to which cow i will be assigned for her milking period.

Sample Input

Sample Output

Hint

Explanation of the sample:

Here's a graphical schedule for this output:

Time     1  2  3  4  5  6  7  8  9 10

Stall 1 c1>>>>>>>>>>>>>>>>>>>>>>>>>>>

Stall 2 .. c2>>>>>> c4>>>>>>>>> .. ..

Stall 3 .. .. c3>>>>>>>>> .. .. .. ..

Stall 4 .. .. .. c5>>>>>>>>> .. .. ..

Other outputs using the same number of stalls are possible.

题意：求最小空位数，使每头牛在指定时间独占一空位（一空位可两头牛轮换）

分析：贪心，以开始时间排序，在可衔接使用该空位的牛中寻找一个浪费时间最小的牛，需要用set，mutliset

代码：

#include<iostream>
#include<cstdio>
#include<cmath>
#include<set>
#include<cstring>
#include<algorithm>
using namespace std;
const int MAXN=50005;
struct node
{
	int x,y,id;
	node(int xx=0,int yy=0,int i=0)
	{
		x=xx,y=yy;id=i;
	}
	bool operator <(node a)const
	{
		return x<a.x;
	}
};
multiset<node>mut;
node p;
int num[MAXN];
int main()
{
	int n,m,i,j;
	while(~scanf("%d",&n))
	{
		memset(num,-1,sizeof num);
		for(i=0;i<n;i++)
		{
			scanf("%d%d",&p.x,&p.y);
			p.id=i;
			mut.insert(p);
		}
		
		i=1;multiset<node>::iterator cur;
		while(!mut.empty())
		{
			
			cur=mut.upper_bound(node(mut.begin()->y));
			while(cur!=mut.end())
			{
				int tmp=cur->y;
				num[cur->id]=i;
				mut.erase(cur);
				cur=mut.upper_bound(node(tmp));
			}
			num[mut.begin()->id]=i++;
			mut.erase(mut.begin());
		}
		printf("%d\n",i-1);
		for(i=0;i<n;i++)
			printf("%d\n",num[i]);
	}
	return 0;
}