poj 2376 Cleaning Shifts 贪心 区间问题
2015-12-04 15:52
225 查看
<pre name="code" class="html">
Cleaning Shifts
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 14425 | Accepted: 3700 |
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.
区间问题,,典型的贪心 63ms
<span style="font-size:18px;color:#3366ff;">#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> using namespace std; typedef long long ll; struct Node{ int s; int e; }node[25005]; int cmp(Node a,Node b) { if(a.s!=b.s) return a.s<b.s; else return a.e>b.e; } int main() { int n,q; while(~scanf("%d %d",&n,&q)) { for(int i=1;i<=n;i++) scanf("%d %d",&node[i].s,&node[i].e); sort(node+1,node+n+1,cmp); if(node[1].s!=1) { printf("-1\n"); continue; } int cnt=1,i=1,r=node[1].e,temp=0; while(r<q) { temp=0; for(int j=i+1;node[j].s<=node[i].e+1&&j<=n;j++) if(node[j].e>r) { temp=j; r=node[j].e; } if(temp==0) break; else { cnt++; r=node[temp].e; i=temp; } } if(r<q) printf("-1\n"); else printf("%d\n",cnt); } return 0; } </span><span style="font-size: 14px;"> </span>
相关文章推荐
- LeetCode 171 Excel Sheet Column Number
- 图片轮播器
- gnuradio模块的数据输出
- 启动 asmca 时出现 No protocol specified 错误的解决办法
- android button设计模拟器
- python入门常见错误
- Bean的初始化和销毁
- IOS与ReactNative
- IOS 启动画面设置
- H5页面audio多声音解决方法
- 忘记MySQL root密码如何重置。
- iOS 开发中一些不常用技巧
- 10008---jQuery效果--淡入淡出
- XCode 7上传遇到ERROR ITMS-90535 Unexpected
- iOS之 随笔-静态库创建Xcode7
- iOS开发之XCode模拟器不能连接网络
- JQuery学习笔记
- Eclipse开发工具组合键介绍
- 给用户添加sudo权限
- python批量修改文件