POJ 2376 Cleaning Shifts
来源:互联网 发布:侠客风云传有mac版吗 编辑:程序博客网 时间:2024/05/22 06:34
Cleaning Shifts
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 25411 Accepted: 6303
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.
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.
* 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 101 73 66 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.
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.
代码:
#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>using namespace std;const int maxn=100006;struct Node{ int l; int r;}a[maxn];bool cmp(Node a,Node b){ if(a.r==b.r) return a.l>b.l; return a.r<b.r;}int main(){ int i,n,m,j,t,s,sum,mm; while(scanf("%d %d",&n,&m)!=EOF) { s=1;sum=1; for(int i=0;i<n;i++) { scanf("%d %d",&a[i].r,&a[i].l); } sort(a,a+n,cmp); t=a[0].l; mm=t; if(a[0].r!=1)s=0; for(i=0;i<n;i++) { if(a[i].r-1<=t){ if(a[i].l>mm) mm=a[i].l; }else{ t=mm; sum++; if(a[i].l>mm) mm=a[i].l; if(a[i].r-1>t) s=0; } if(!s) break; } if(mm<m) s=0; if(t<m) sum++; if(s) printf("%d\n",sum); else printf("-1\n"); } return 0;}
如果最开始工作的牛最多工作到第七段时间,寻找可以进行到第八段时间。阅读全文
0 0
- POJ 2376 Cleaning Shifts
- POJ 2376 Cleaning Shifts
- poj 2376 Cleaning Shifts
- POJ-2376-Cleaning Shifts
- poj 2376 Cleaning Shifts
- POJ 2376 Cleaning Shifts
- POJ 2376 Cleaning Shifts
- poj 2376 Cleaning Shifts
- POJ 2376 Cleaning Shifts
- poj 2376 Cleaning Shifts
- POJ-2376 Cleaning Shifts
- POJ 2376Cleaning Shifts
- POJ 2376 Cleaning Shifts
- poj 2376 Cleaning Shifts
- POJ - 2376 Cleaning Shifts
- POJ 2376 Cleaning Shifts
- POJ 2376 Cleaning Shifts
- poj 2376 Cleaning Shifts
- android项目从零开始 RecycleView 设置滚动到某item时间
- lwj_C#_排序
- 苹果CEO库克乌镇演讲:看好AI结合AR的产品在教育、医疗领域的应用
- 语音识别技术之声学模型
- bzoj3551 [ONTAK2010]Peaks加强版(kruskal重构树+dfs序+主席树+树上倍增)
- POJ 2376 Cleaning Shifts
- 2.appium-通过appium启动我的第一个手机app
- 关于android的view触摸事件
- 3.vector / 迭代器
- 一文看懂常用的梯度下降算法
- C语言线性表之顺序表
- pageContext--四大作用域对象
- python 读取文件时报错UnicodeDecodeError: 'gbk' codec can't decode byte 0x80 in position 205: illegal multib
- 【反射】java绝对路径获取文件