Stall Reservations POJ - 3190（优先队列）

最新推荐文章于 2023-02-15 17:06:46 发布

Learning_is_endless

最新推荐文章于 2023-02-15 17:06:46 发布

阅读量164

点赞数 1

分类专栏： # 数据结构-STL

本文链接：https://blog.csdn.net/zhangxiaoduoduo/article/details/81544444

版权

数据结构-STL 专栏收录该内容

10 篇文章 0 订阅

订阅专栏

Stall Reservations

POJ - 3190

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.

题意：有N头奶牛，每头奶牛都会在[1,1000000]的时间区间内的子区间进行挤奶。挤奶的时候奶牛一定要单独放在一个牛棚中。一头奶牛的结束时间与另一头奶牛的开始时间重合的时候2头奶牛不能放在同一个牛棚中，例A牛时间[5,10]，B牛时间[10,12]，那么需要用2个牛棚放这2头牛。输入N头牛的所有的挤奶时间区间，要求输出最少要建几个牛棚，以及每头牛挤奶的时候在第几号牛棚。

思路：根据区间进行排序，先将第一个区间放入优先队列，而后按顺序依次与队列的top进行比较（此优先队列的top是右区间最小的区间），发现当前的l大于top中的r时，说明可以共用一个棚，否则需要一个新的棚，这个题有贪心的感觉

AC代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<cmath>
#include<utility>
#include<set>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#define maxn 50005
#define INF 0x3f3f3f3f
#define LL long long
#define ULL unsigned long long
#define E 1e-8
#define mod 1000000007
#define P pair<int,int>
using namespace std;

int id[maxn];

struct Node
{
    int l,r,id;
    bool operator <(const Node a)const
    {
         return r > a.r;
    }
}a[maxn],nows;
bool cmp(Node a,Node b)
{
    if(a.l==b.l) return a.r<b.r;
    return a.l<b.l;
}

int main()
{
    int n;
    while(scanf("%d",&n)!=EOF){
        for(int i=1;i<=n;++i){
            scanf("%d %d",&a[i].l,&a[i].r);
            a[i].id = i;
        }
        sort(a+1,a+1+n,cmp);
        priority_queue<Node> q;
        q.push(a[1]);
        int num = 1;
        id[a[1].id] = num;
        for(int i=2;i<=n;++i){
            nows = q.top();
            if(a[i].l>nows.r){
                q.pop();
                q.push(a[i]);
                id[a[i].id] = id[nows.id];
            }
            else{
                q.push(a[i]);
                id[a[i].id] = ++num;
            }
        }
        printf("%d\n",num);
        for(int i=1;i<=n;++i){
            printf("%d\n",id[i]);
        }
    }
    return 0;
}