zoukankan      html  css  js  c++  java
  • POJ 2376 Cleaning Shifts(贪心)

    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

    3 10
    1 7
    3 6
    6 10

    Sample Output

    2

    最小代价的区间覆盖。

    #include<iostream>
    #include<cstdio>
    #include<cstring>
    #include<algorithm>
    #include<cstdlib>
    #include<map>
    using namespace std;
    typedef long long LL;
    const int maxn=25000+100;
    struct node{
        int st,ed;
    }e[maxn];
    int n,m;
    int cmp(node l1,node l2)
    {
        if(l1.st==l2.st)
            return  l1.ed>l2.ed;
        return l1.st<l2.st;
    }
    int main()
    {
        int ed,temp;
        while(~scanf("%d%d",&n,&m))
        {
            for(int i=0;i<n;i++)
                scanf("%d%d",&e[i].st,&e[i].ed);
            sort(e,e+n,cmp);
            if(e[0].st!=1)
            {
                printf("-1
    ");
                continue;
            }
            int ans=1;
            ed=e[0].ed;
            temp=0;
            for(int i=1;i<n;i++)
            {
                if(e[i].st>ed+1)
                {
                    ed=temp;
                    ans++;
                }
                if(e[i].st<=ed+1)
                {
                    if(e[i].ed>temp)
                        temp=e[i].ed;
                    if(e[i].ed==m)
                    {
                        ans++;
                        ed=m;
                        break;
                    }
                }
            }
            if(ed==m)   printf("%d
    ",ans);
            else   printf("-1
    ");
        }
        return 0;
    }


  • 相关阅读:
    HTTP 错误 404.2
    SQL Server 2008 R2如何开启数据库的远程连接(转)
    CSS中font-family:中文字体对应的英文名称
    15/18位身份证号码正则表达式(详细版)
    C#获取系统时间及时间格式
    C#正则表达式判断输入日期格式是否正确
    Linux查看机器负载
    模拟HTTP请求超时时间设置
    MySQL show命令的用法
    innodb事务隔离级别
  • 原文地址:https://www.cnblogs.com/jhcelue/p/7224924.html
Copyright © 2011-2022 走看看