POJ 2376 - Cleaning Shifts（贪心）

最新推荐文章于 2021-07-24 11:28:03 发布

原创最新推荐文章于 2021-07-24 11:28:03 发布 · 787 阅读

0 ·

CC 4.0 BY-SA版权

POJ 同时被 2 个专栏收录

23 篇文章

订阅专栏

贪心

8 篇文章

订阅专栏

本文介绍了一种基于贪心算法的清洁任务调度方案，旨在通过最少数量的牛来覆盖所有的工作时段，确保每个时段都有牛在工作。文章通过具体实例演示了算法的实现过程。

Cleaning Shifts

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 9242		Accepted: 2461

Description

Farmer John is assigning some of his N (1 <= N <= 25,000) cows to do some cleaning chores around the barn. He always wants to have one cow working on cleaning things up and has divided the day into T shifts (1 <= T <= 1,000,000), the first being shift 1 and the last being shift T.

Each cow is only available at some interval of times during the day for work on cleaning. Any cow that is selected for cleaning duty will work for the entirety of her interval.

Your job is to help Farmer John assign some cows to shifts so that (i) every shift has at least one cow assigned to it, and (ii) as few cows as possible are involved in cleaning. If it is not possible to assign a cow to each shift, print -1.

Input

* Line 1: Two space-separated integers: N and T

* Lines 2..N+1: Each line contains the start and end times of the interval during which a cow can work. A cow starts work at the start time and finishes after the end time.

Output

* Line 1: The minimum number of cows Farmer John needs to hire or -1 if it is not possible to assign a cow to each shift.

Sample Input

Sample Output

Hint

This problem has huge input data,use scanf() instead of cin to read data to avoid time limit exceed.

INPUT DETAILS:

There are 3 cows and 10 shifts. Cow #1 can work shifts 1..7, cow #2 can work shifts 3..6, and cow #3 can work shifts 6..10.

OUTPUT DETAILS:

By selecting cows #1 and #3, all shifts are covered. There is no way to cover all the shifts using fewer than 2 cows.

=============================

题意：一天分为T段，即1-T，有N头牛，从中选出一头或几头牛使至少每段都有一头牛工作，求所需牛数的最小值，不能做到输出-1

简单贪心。以开始时间为关键字进行排序，每次选择可以和上个结束时间相连接的、结束时间最晚的牛，若不能连接直接输出-1

给出几组数据：

3 10

2 4

3 6

7 10

输出-1

----------

3 10

1 4

4 7

7 9

输出-1

----------

3 10

1 10

2 3

4 5

输出1

---------

3 10

1 3

4 6

7 10

输出3

#include <iostream>
#include <cstdio>
#include <algorithm>

using namespace std;

struct cow
{
    int st;
    int ed;
}a[25555];

bool cmp(cow a,cow b)
{
    return a.st<b.st;
}

int main()
{
    int n,t,et=0,MAX=-1,p,ans=0;
    scanf("%d%d",&n,&t);
    for(int i=0;i<n;i++)
        scanf("%d%d",&a[i].st,&a[i].ed);
    sort(a,a+n,cmp);
    for(int i=0;i<n;i++)
    {
        if(a[i].st>et+1)
        {
            printf("-1\n");
            return 0;
        }
        while(a[i].st<=et+1&&i<n)
        {
            if(a[i].ed>MAX)
            {
                MAX=a[i].ed;
                p=i;
            }
            i++;
        }
        i--;
        et=a[p].ed;
        ans++;
        if(et>=t) break;
    }
    if(et<t) printf("-1\n");
    else printf("%d\n",ans);

    return 0;
}