Cleaning Shifts(区域覆盖)
来源:互联网 发布:卓智网络 锐捷 拉萨 编辑:程序博客网 时间:2024/09/21 09:29
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.
题意:N个牛分配清洁工作,给出N个牛的工作时间区间,求最少需要多少个牛就能完成从1到T时间段的清洁工作;
贪心(区间覆盖),把各区间的x从小到大排序,从区间1开始,选择区间起点为1的最长区间[xi,yi],则新的起点从yi开始;
#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>#include<cmath>#include<queue>#include<stack>#include<map>using namespace std;const int MAXN=25005;int n,m;struct node{ int x,y;} z[MAXN];int cmp(node a,node b){ return a.x<b.x;}int main(){ while(~scanf("%d%d",&n,&m)) { for(int i=0; i<n; i++) { scanf("%d%d",&z[i].x,&z[i].y); } sort(z,z+n,cmp); int left=1,right,ans,i=0; ans=right=0; while(left<=m) { for(; i<n&&z[i].x<=left; i++) if(z[i].y>right) right=z[i].y; if(right>=left) left=right+1,ans++; else break; } if(left<=m) ans=-1; printf("%d\n",ans); } return 0;}
阅读全文
0 0
- Cleaning Shifts(区域覆盖)
- Cleaning Shifts(贪心 区间覆盖)
- poj 3171 Cleaning Shifts(区间的最小覆盖价值)
- POJ 题目2376 Cleaning Shifts(区间覆盖)
- POJ 2376 Cleaning Shifts(区间覆盖问题)
- Cleaning Shifts POJ - 2376(区间覆盖,排序+贪心)
- POJ 2376 Cleaning Shifts (贪心区间最少覆盖)
- POJ 2376 - Cleaning Shifts(最小区间覆盖)
- #POJ2376#Cleaning Shifts(贪心 -> 最小区间覆盖)
- Cleaning Shifts (贪心)
- POJ 2376 Cleaning Shifts 区间覆盖问题
- poj 3171Cleaning Shifts 区间覆盖
- POJ 2376 Cleaning Shifts (区间覆盖)
- POJ 2376 Cleaning Shifts 区间覆盖
- poj 2376 Cleaning Shifts 区间覆盖
- poj 2376 Cleaning Shifts 区间覆盖
- POJ2376--Cleaning Shifts(贪心)
- POJ2376 Cleaning Shifts (贪心)
- 蓝牙L2CAP【CID分配】【L2CAP层图解】
- 每日英语阅读(二)
- xUtils3 Https请求报错:javax.net.ssl.SSLPeerUnverifiedException: Hostname ***.****.**not verified,跳过证书检测
- 深入探索构造函数
- 前缀树Trie
- Cleaning Shifts(区域覆盖)
- 正则匹配
- JAVAWEB开发之redis学习(二)——string相关的操作命令
- bzoj2654 二分+最小生成树
- unity射线检测
- Java 之伪泛型
- 斗地主之用蚁群算法整理牌型-几个关键点的处理
- 利用微软的平台进行Office文档的在线查看
- 燃尽图,甘特图,鱼骨图