POJ2376
2015-06-07 17:15
225 查看
Cleaning Shifts
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 12969 Accepted: 3348
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.
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.
//题目的意思就是给定一个区间,求最少用几个区间可以把整个区间覆盖掉
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<iomanip>
#include<algorithm>
#include<cctype>
#include<stack>
#include<queue>
#include<string>
#include<cstring>
#include<iomanip>
#include<set>
#include<vector>
#include<cstdio>
#include<cstring>
using namespace std;
const int MAX=25005;
struct ARR{
int st,ed;
}arr[MAX];
int comp(ARR a,ARR b)
{
return a.st==b.st?a.ed<b.ed:a.st<b.st;
}
int main()
{
int n,t,res=0;
scanf("%d%d",&n,&t);
for(int i=0;i<n;++i)
{
scanf("%d%d",&arr[i].st,&arr[i].ed);
}
sort(arr,arr+n,comp);
int _time_ed=0,_time_st=0;
int i=0;
while(i<n&&_time_ed<t)
{
res++;
if(arr[i].st>_time_st+1)
break;
while(i<n&&arr[i].st<=_time_st+1)
{
if(arr[i].ed>_time_ed)
_time_ed=arr[i].ed;
i++;
}
_time_st=_time_ed;
}
printf(_time_ed<t?"-1\n":"%d\n",res);
return 0;
}
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 12969 Accepted: 3348
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.
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.
//题目的意思就是给定一个区间,求最少用几个区间可以把整个区间覆盖掉
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<iomanip>
#include<algorithm>
#include<cctype>
#include<stack>
#include<queue>
#include<string>
#include<cstring>
#include<iomanip>
#include<set>
#include<vector>
#include<cstdio>
#include<cstring>
using namespace std;
const int MAX=25005;
struct ARR{
int st,ed;
}arr[MAX];
int comp(ARR a,ARR b)
{
return a.st==b.st?a.ed<b.ed:a.st<b.st;
}
int main()
{
int n,t,res=0;
scanf("%d%d",&n,&t);
for(int i=0;i<n;++i)
{
scanf("%d%d",&arr[i].st,&arr[i].ed);
}
sort(arr,arr+n,comp);
int _time_ed=0,_time_st=0;
int i=0;
while(i<n&&_time_ed<t)
{
res++;
if(arr[i].st>_time_st+1)
break;
while(i<n&&arr[i].st<=_time_st+1)
{
if(arr[i].ed>_time_ed)
_time_ed=arr[i].ed;
i++;
}
_time_st=_time_ed;
}
printf(_time_ed<t?"-1\n":"%d\n",res);
return 0;
}
相关文章推荐
- 动易2006序列号破解算法公布
- Ruby实现的矩阵连乘算法
- C#插入法排序算法实例分析
- C#数据结构与算法揭秘二
- 算法练习之从String.indexOf的模拟实现开始
- C#算法之关于大牛生小牛的问题
- C#实现的算24点游戏算法实例分析
- c语言实现的带通配符匹配算法
- 浅析STL中的常用算法
- 算法之排列算法与组合算法详解
- C++实现一维向量旋转算法
- Ruby实现的合并排序算法
- C#折半插入排序算法实现方法
- 基于C++实现的各种内部排序算法汇总
- C++线性时间的排序算法分析
- C++实现汉诺塔算法经典实例
- PHP实现克鲁斯卡尔算法实例解析
- C#常见算法面试题小结
- JavaScript 组件之旅(二)编码实现和算法
- JavaScript数据结构和算法之图和图算法