zoukankan      html  css  js  c++  java
  • ACM学习历程——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

    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.
     
     
    这个题目就是贪心,在开始时间能满足条件的情况下,让结束时间越晚就可以了。这样就需要对结构体进行排序,这里使用sort函数进行了排序。
     
     
    代码:
    #include <iostream>
    #include <cstdio>
    #include <cstdlib>
    #include <cstring>
    #include <cmath>
    #include <algorithm>
    #include <set>
    #include <map>
    #include <vector>
    #include <queue>
    #include <string>
    #define inf 0x3fffffff
    #define eps 1e-10
    
    using namespace std;
    
    struct node
    {
        int Begin, End;
    }a[25005];
    
    bool cmp(node x, node y)
    {
        if (x.Begin != y.Begin)
            return x.Begin < y.Begin;
        else
            return x.End > y.End;
    }
    
    int t, n;
    
    int qt()
    {
        int ans = 0;
        int now, p, k = 0, Max;
        now = 1;
        while (now <= t)
        {
            if (k == n)
                return -1;
            if (a[k].Begin > now)
                return -1;
            Max = a[k].End;
            while (a[k].Begin <= now && k < n)
            {
                Max = max(Max, a[k].End);
                k++;
            }
            now = Max + 1;
            ans++;
        }
        return ans;
    }
    
    int main()
    {
        //freopen("test.txt", "r", stdin);
        while (scanf("%d%d", &n, &t) != EOF)
        {
            for (int i = 0; i < n; ++i)
                scanf("%d%d", &a[i].Begin, &a[i].End);
            sort(a, a+n, cmp);
            printf("%d
    ", qt());
        }
        return 0;
    }
    
  • 相关阅读:
    微服务技术选型
    分布式事务
    微服务架构下的身份认证
    java core
    java web基础知识
    java基础知识学习 内存相关
    java基础知识学习 java异常
    java 基础知识学习 JVM虚拟机参数配置
    java 基础知识学习 内存泄露(memory leak) VS 内存溢出(out of memory)以及内存管理
    【F12】chrome浏览器中 F12 功能的简单介绍
  • 原文地址:https://www.cnblogs.com/andyqsmart/p/4116332.html
Copyright © 2011-2022 走看看