Cleaning Shifts
来源:互联网 发布:数控车床编程自学视频 编辑:程序博客网 时间:2024/06/05 15:55
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.
* 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.
* 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.
3 101 73 66 10
2
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<stdio.h>#include<algorithm> int an[1000005];int main(){int n,t,judge1,judge2;scanf("%d%d",&n,&t); judge1=0,judge2=0;for(int i=0;i<n;i++){int begin,end;scanf("%d%d",&begin,&end);if(end>an[begin])an[begin]=end;if(begin==1)judge1=1;if(end==t)judge2=1;}if(judge1&&judge2){int last,_max,cnt,flag;_max=an[1],cnt=1,flag=1;last=an[1];for(int i=2;i<=t;i++){if(i>last+1){flag=0;break;}if(i<=last+1){if(an[i]>_max)_max=an[i];}if(i==last+1){last=_max;cnt++;if(last==t)break;}}if(flag)printf("%d",cnt);elseprintf("-1");}elseprintf("-1");return 0;}
阅读全文
0 0
- Cleaning Shifts
- Cleaning Shifts
- Cleaning Shifts
- - Cleaning Shifts
- Cleaning Shifts
- Cleaning Shifts
- PKU 2376 Cleaning Shifts
- POJ 2376 Cleaning Shifts
- Cleaning Shifts(p2376)
- POJ3171 Cleaning Shifts 数据结构
- POJ 2376 Cleaning Shifts
- Pku2376 Cleaning Shifts
- poj2376 Cleaning Shifts
- poj 2376 Cleaning Shifts
- POJ-2376-Cleaning Shifts
- poj 2376 Cleaning Shifts
- POJ 2376 Cleaning Shifts
- POJ2376 Cleaning Shifts 贪心
- 【RabbitMQ】——环境搭建
- 单例模式下的双重检验锁Double Checked Locking
- 【linux相识相知】磁盘分区及文件系统管理详解
- 内存泄漏以及各种不同的优化方法
- Ubuntu
- Cleaning Shifts
- 洛谷P3375 【模板】KMP字符串匹配
- 如何连接阿里云Linux实例
- Linux环境下安装JDk
- HDU5137-最短路最大化-How Many Maos Does the Guanxi Worth
- java杂记1
- angular2——前后端交互
- Jsoup学习
- KMP题目分析与总结