Stall Reservations - POJ3190 贪心
来源:互联网 发布:sql 数据库链接 编辑:程序博客网 时间:2024/05/02 02:57
Stall Reservations
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3541 Accepted: 1266 Special Judge
Description
Oh those picky N (1 <= N <= 50,000) cows! They are so picky that each one will only be milked over some precise time interval A..B (1 <= A <= B <= 1,000,000), which includes both times A and B. Obviously, FJ must create a reservation system to determine which stall each cow can be assigned for her milking time. Of course, no cow will share such a private moment with other cows.
Help FJ by determining:
Help FJ by determining:
- The minimum number of stalls required in the barn so that each cow can have her private milking period
- An assignment of cows to these stalls over time
Input
Line 1: A single integer, N
Lines 2..N+1: Line i+1 describes cow i's milking interval with two space-separated integers.
Lines 2..N+1: Line i+1 describes cow i's milking interval with two space-separated integers.
Output
Line 1: The minimum number of stalls the barn must have.
Lines 2..N+1: Line i+1 describes the stall to which cow i will be assigned for her milking period.
Lines 2..N+1: Line i+1 describes the stall to which cow i will be assigned for her milking period.
Sample Input
51 102 43 65 84 7
Sample Output
412324
Hint
Explanation of the sample:
Here's a graphical schedule for this output:
Here's a graphical schedule for this output:
Time 1 2 3 4 5 6 7 8 9 10Stall 1 c1>>>>>>>>>>>>>>>>>>>>>>>>>>>Stall 2 .. c2>>>>>> c4>>>>>>>>> .. ..Stall 3 .. .. c3>>>>>>>>> .. .. .. ..Stall 4 .. .. .. c5>>>>>>>>> .. .. ..Other outputs using the same number of stalls are possible.
题意:每个牛有一个特定的产奶时间,如果两个牛的产奶时间冲突的话就要新加一个牛棚,问最少需要多少个牛棚让每头牛都能产奶并且不互相冲突,输出最小数目及每头牛所在的牛棚编号
思路:由于每头牛的产奶时间是固定的,所以对其排序后再遍历时只需看结束时间最早的那个牛棚能否允许当前的牛前去产奶,能的话更新牛棚的结束时间,不能的话申请新的牛棚,利用优先队列维护牛棚
#include<iostream>#include<cstdio>#include<algorithm>#include<queue>#define MAXN 50100using namespace std;struct node{int s,e;int num,id;}cow[MAXN];bool cmp(node a,node b){return a.s<b.s;}bool cmp1(node a,node b){return a.num<b.num;}struct stall{int T,ID;stall(int t,int n){T=t;ID=n;}bool operator< (const stall &b) const {return T>b.T;}};priority_queue<stall> qq;int main(){//freopen("in.txt","r",stdin);int n;scanf("%d",&n);for(int i=1;i<=n;i++){scanf("%d%d",&cow[i].s,&cow[i].e);cow[i].num=i;}sort(cow+1,cow+1+n,cmp);for(int i=1;i<=n;i++) {if(!qq.empty()){stall temp=qq.top();if(cow[i].s>temp.T){temp.T=cow[i].e;cow[i].id=temp.ID;qq.pop();qq.push(temp);}else {cow[i].id=qq.size()+1;qq.push(stall(cow[i].e,cow[i].id));}}else{cow[i].id=1;qq.push(stall(cow[i].e,1));}}printf("%d\n",qq.size());sort(cow+1,cow+1+n,cmp1);for(int i=1;i<=n;i++)printf("%d\n",cow[i].id);}
0 0
- POJ3190 Stall Reservations 贪心
- POJ3190 Stall Reservations 【贪心】
- Stall Reservations - POJ3190 贪心
- POJ3190:Stall Reservations(贪心)
- POJ3190——Stall Reservations(贪心)
- #POJ3190#Stall Reservations(贪心 -> 冲突分配)
- POJ3190 Stall Reservations (贪心+优先队列)
- POJ3190-Stall Reservations
- POJ3190 Stall Reservations
- poj Stall Reservations(贪心)
- C - Stall Reservations 贪心算法
- Stall Reservations - POJ 3190 贪心
- POJ 3190 - Stall Reservations(贪心)
- Stall Reservations (poj 3190 贪心)
- poj 3190 Stall Reservations(贪心)
- poj 3190 Stall Reservations 贪心
- POJ-3190 Stall Reservations(贪心)
- POJ 3190 Stall Reservations(贪心)
- oracle中修改表名
- 用Python和Pygame写游戏-从入门到精通(22)
- 「HD_ACM」A+B for Input-Output Practice (III)
- window命令行的cd
- HDU 2018
- Stall Reservations - POJ3190 贪心
- 诸葛亮兵书
- 字符串的全排列(未解决)
- UIImage 所支持的图片类型
- Maven项目下HttpServletRequest 或 HttpServletResponse需引用的依赖包
- ponyDebugger 使用感悟
- java String和Stringbuffer性能测试结果
- 【猫猫的Unity Shader之旅】之混合效果
- Universal DEP/ASLR bypass with msvcr71.dll and mona.py