POJ 2376 Cleaning Shifts(轮班打扫)

Time Limit: 1000MS   Memory Limit: 65536K

【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.

农夫约翰派他的N(1 <= N <= 25,000)头牛去打扫畜棚。他希望总是有一头牛在打扫,并且把一天划分为T班倒(1 <= T <= 1,000,000),从第1班到第N班。

每头奶牛每天只在一定的班次内干活。每头被选取打扫的奶牛会在它们的班次内一直工作。

你要做的就是帮助农夫约翰安排一些奶牛轮班,使得(i)每个班次至少有一头牛被安排,并且(ii)使尽可能少的奶牛参与打扫。如果无法为每个班次安排奶牛,则输出-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.

* 第1行:两个用空格分隔的整数N与T

* 第2..N+1行:每行包含一头可工作奶牛的上班与下班时间。奶牛在上班时间开始工作,并且在下班时间达到后结束工作。

【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.

* 第一行:约翰最少需要指派的奶牛数量,如果不能为每个班次都分配一头牛则输出-1。

【Sample Input - 输入样例】

【Sample Output - 输出样例】

3 10

1 7

3 6

6 10

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.

这个问题的输入数据比较大,使用scanf()读取比cin的速度更稳妥。

输入详解:

有3头牛与10班倒。奶牛#1可以工作在班次1..7,奶牛#2可以工作在班次3..6,并且奶牛#3可以工作在班次6..10。

输出详解:

通过安排奶牛#1和奶牛#3,所有班次可以被覆盖。无法使用2头以下的奶牛覆盖所有的班次。

【题解】

主要思想是贪心,不过有两种实现的方法

第一种,sort + priority_queue

按照开始班次从小到大排序,每次在当前可覆盖的班次中选取可在区间里工作的奶牛。

找出可到达的最大班次,加入到当前班次中。

重复执行即可得出答案。

第二种,非sort

开辟长度为最大班次的数组shift[T],读取每个数据时以shift[st] = ed的形式记录。

剩下的步骤与第一种如出一辙。

选择最大班次的时候需要注意一点,每次读取的st与ed组成的区间为闭区间,即[st, ed]。

也就是说[1, 2] + [3, 4] = [1, 4]

【代码 C++】

 #include<cstdio>
#include <algorithm>
#include <queue>
struct cow{
int st, ed;
}data[];
bool cmp(cow A, cow B){
return A.st < B.st;
}
std::priority_queue<int, std::vector<int> > edShift;
int main(){
int n, t, i, nowShift, opt;
scanf("%d%d", &n, &t);
for (i = ; i < n; ++i) scanf("%d%d", &data[i].st, &data[i].ed);
std::sort(data, data + n, cmp);
for (i = opt = nowShift = ; nowShift < t; edShift.pop()){
while (data[i].st <= nowShift + && i < n) edShift.push(data[i++].ed);
if (edShift.empty()) break;
nowShift = edShift.top(), ++opt;
}
if (nowShift < t) puts("-1");
else printf("%d", opt);
return ;
}

sort + priority_queue

 #include<cstdio>
#include <algorithm>
int shift[];
int main(){
int n, t, i, st, ed, nowShift, nextShift, opt;
scanf("%d%d", &n, &t);
for (i = opt = nextShift = nowShift = ; i < n; ++i){
scanf("%d%d", &st, &ed);
shift[st] = std::max(shift[st], ed);
}
for (i = ; i <= nowShift + && nowShift < t; ++opt, nowShift = nextShift){
while (i <= nowShift + ) nextShift = std::max(nextShift, shift[i++]);
}
if (nowShift < t) puts("-1");
else printf("%d", opt);
return ;
}

非sort

POJ 2376 Cleaning Shifts(轮班打扫)的更多相关文章

  1. poj 2376 Cleaning Shifts

    http://poj.org/problem?id=2376 Cleaning Shifts Time Limit: 1000MS   Memory Limit: 65536K Total Submi ...

  2. POJ 2376 Cleaning Shifts 贪心

    Cleaning Shifts 题目连接: http://poj.org/problem?id=2376 Description Farmer John is assigning some of hi ...

  3. 【原创】poj ----- 2376 Cleaning Shifts 解题报告

    题目地址: http://poj.org/problem?id=2376 题目内容: Cleaning Shifts Time Limit: 1000MS   Memory Limit: 65536K ...

  4. POJ - 2376 Cleaning Shifts 贪心(最小区间覆盖)

    Cleaning Shifts Farmer John is assigning some of his N (1 <= N <= 25,000) cows to do some clea ...

  5. POJ 2376 Cleaning Shifts【贪心】

    POJ 2376 题意: 给出一给大区间和n各小区间,问最少可以用多少小区间覆盖整个大区间. 分析: 贪心法.设t为当前所有已确定区间的最右端,那我们可以每次都取所有可选的小区间(左端点<=t+ ...

  6. poj 2376 Cleaning Shifts 贪心 区间问题

    <pre name="code" class="html"> Cleaning Shifts Time Limit: 1000MS   Memory ...

  7. poj 2376 Cleaning Shifts 最小区间覆盖

    Cleaning Shifts Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 40751   Accepted: 9871 ...

  8. poj 2376 Cleaning Shifts(贪心)

    Description Farmer John <= N <= ,) cows to <= T <= ,,), the first being shift and the la ...

  9. ACM学习历程——POJ 2376 Cleaning Shifts(贪心)

    Description Farmer John is assigning some of his N (1 <= N <= 25,000) cows to do some cleaning ...

随机推荐

  1. 记一个由MemCached引发的性能问题

    最近有个项目用loadrunner做了压力测试,发现并发量还不到200服务器就支撑不住了.boss那边紧急开会,说此项目最近3个月内将有100家中大型公司用于校园招聘工作,如果这个问题不解决公司有可能 ...

  2. JSP页面跳转方式

    JSP页面跳转方式 1.利用按钮+javascript进行跳转 <input type="button" name="button2" value=&qu ...

  3. 严重: IOException while loading persisted sessions: java.io.EOFException

    tomcat在启动时出现如下异常问题: 严重: IOException while loading persisted sessions: java.io.EOFException 严重: Excep ...

  4. Linux自动删除n天前备份

    Linux是一个很能自动产生文件的系统,日志.邮件.备份等.因此需要设置让系统定时清理一些不需要的文件. 语句写法: find 对应目录 -mtime +天数 -name "文件名" ...

  5. PHP处理CSV表格文件的常用操作方法是怎么样呢

    php来说,fgetcsv读入csv表格,返回一个数组,然后foreach输出成HTML的<table>,这步操作几行代码就能实现,非常简单.工作量主要还在于浏览器前端,建议你用jQuer ...

  6. java 面试每日一题4

    题目:有1.2.3.4个数字,能组成多少个互不相同且无重复数字的三位数?都是多少?  1.程序分析:可填在百位.十位.个位的数字都是1.2.3.4.组成所有的排列后再去 掉不满足条件的排列. publ ...

  7. [HTML]HTML5实现可编辑表格

    HTML5实现的简单的可编辑表格 [HTML]代码 <!DOCTYPE html > <html > <head> <meta charset="u ...

  8. 如何调动员工的积极性 -引用LTP.Net知识库

    也许是老板的意识不强,也许员工的意识薄弱,关于老板的意识强不强,我们只能看他是只顾眼前的利益,还是放眼于未来呢. 1:有一个领导的样子现在,在我国,聊天是非常时髦的,也非常受我们这个年龄段的人欢迎.如 ...

  9. (翻译)理解Java当中的回调机制

    原文地址:http://cleancodedevelopment-qualityseal.blogspot.com/2012/10/understanding-callbacks-with-java. ...

  10. poj3342 Party at Hali-Bula

    树形dp题,状态转移方程应该很好推,但一定要细心. http://poj.org/problem?id=3342 #include <cstdio> #include <cstrin ...