zoukankan      html  css  js  c++  java
  • POJ2376 Cleaning Shifts 【贪心】

    Cleaning Shifts
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 11542   Accepted: 3004

    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.

    Source


    用最少的线段覆盖全部的点

    #include <stdio.h>
    #include <string.h>
    #include <algorithm>
    
    #define maxn 25005
    
    struct Node {
    	int u, v;
    } E[maxn];
    
    bool cmp(Node a, Node b) {
    	return a.u < b.u;
    }
    
    int main() {
    	int N, T, flag, ans, right, i;
    	while(scanf("%d%d", &N, &T) == 2) {
    		for(i = 0; i < N; ++i)
    			scanf("%d%d", &E[i].u, &E[i].v);
    		std::sort(E, E + N, cmp);
    		ans = right = 0;
    		flag = 1;
    		i = 0;
    		while(flag <= T) {
    			for( ; i < N && E[i].u <= flag; ++i)
    				if(E[i].u <= flag && E[i].v > right)
    					right = E[i].v;
    			if(right >= flag) flag = right + 1, ++ans;
    			else break;
    		}
    		if(flag <= T) ans = -1;
    		printf("%d
    ", ans);
    	}
    	return 0;
    }


  • 相关阅读:
    14 用DFT计算线性卷积
    13 DFT变换的性质
    12 有限长序列的分类
    前端常见跨域解决方案
    JS基础-构造函数、原型、原型链、继承
    浏览器中的 JavaScript 执行机制
    再也不怕面试官问我 Promise 相关问题了
    前端面试---手写代码常考题
    从输入 URL 到页面展示,这中间发生了什么?
    学习笔记-CSS-圣杯布局和双飞翼布局
  • 原文地址:https://www.cnblogs.com/gcczhongduan/p/5273334.html
Copyright © 2011-2022 走看看