Gourmet and Banquet -CodeForces
来源:互联网 发布:表格中如何建立数据库 编辑:程序博客网 时间:2024/05/18 02:46
A gourmet came into the banquet hall, where the cooks suggested n dishes for guests. The gourmet knows the schedule: when each of the dishes will be served.
For i-th of the dishes he knows two integer moments in time ai and bi (in seconds from the beginning of the banquet) — when the cooks will bring the i-th dish into the hall and when they will carry it out (ai < bi). For example, if ai = 10 and bi = 11, then the i-th dish is available for eating during one second.
The dishes come in very large quantities, so it is guaranteed that as long as the dish is available for eating (i. e. while it is in the hall) it cannot run out.
The gourmet wants to try each of the n dishes and not to offend any of the cooks. Because of that the gourmet wants to eat each of the dishes for the same amount of time. During eating the gourmet can instantly switch between the dishes. Switching between dishes is allowed for him only at integer moments in time. The gourmet can eat no more than one dish simultaneously. It is allowed to return to a dish after eating any other dishes.
The gourmet wants to eat as long as possible on the banquet without violating any conditions described above. Can you help him and find out the maximum total time he can eat the dishes on the banquet?
The first line of input contains an integer n (1 ≤ n ≤ 100) — the number of dishes on the banquet.
The following n lines contain information about availability of the dishes. The i-th line contains two integers ai and bi (0 ≤ ai < bi ≤ 10000) — the moments in time when the i-th dish becomes available for eating and when the i-th dish is taken away from the hall.
Output should contain the only integer — the maximum total time the gourmet can eat the dishes on the banquet.
The gourmet can instantly switch between the dishes but only at integer moments in time. It is allowed to return to a dish after eating any other dishes. Also in every moment in time he can eat no more than one dish.
32 41 56 9
6
31 21 21 2
0
In the first example the gourmet eats the second dish for one second (from the moment in time 1 to the moment in time 2), then he eats the first dish for two seconds (from 2 to 4), then he returns to the second dish for one second (from 4 to 5). After that he eats the third dish for two seconds (from 6 to 8).
In the second example the gourmet cannot eat each dish for at least one second because there are three dishes but they are available for only one second (from 1 to 2).
题意:
这道题就是贪心加上二分,先对时间段按照结束时间排序,做贪心选择,之后对答案进行二分
代码:
#include<iostream>#include<algorithm>#include<cmath>#include<cstring>using namespace std;int n;int vis[10005];struct node{ int left; int right; bool operator < (const node&a) const { return right<a.right||(right==a.right&&left<a.left); }};node a[105];bool ok(int x){ memset(vis,0,sizeof(vis)); for(int i = 0;i<n;i++) { if((a[i].right-a[i].left)<x) return false; int help = 0; for(int j = a[i].left;j<a[i].right;j++) { if(!vis[j]) { help++; vis[j] = 1; if(help==x) break; } } if(help<x) return false; } return true;}int main(){ while(cin>>n) { int big = 10000; for(int i = 0;i<n;i++) { cin>>a[i].left; cin>>a[i].right; } sort(a,a+n); int small = 0; int ans = 0; while(big>=small) { int mid = (small+big)/2; if(ok(mid)) { small = mid+1; ans = max(ans,mid); } else big = mid-1; } cout<<ans*n<<endl; }}
- Gourmet and Banquet -CodeForces
- Gourmet and Banquet CodeForces
- CodeForces 589F Gourmet and Banquet 题解
- day4 CodeForces 589F Gourmet and Banquet
- codeforces 589F Gourmet and Banquet
- CodeForces 589F Gourmet and Banquet(二分 + 最大流)
- CodeForces 589F -- F. Gourmet and Banquet (二分 + 贪心)
- CodeForces 589F Gourmet and Banquet(贪心+二分)
- Codeforces 589F Gourmet and Banquet(二分+贪心)
- CodeForces 589F:Gourmet and Banquet(二分+贪心)
- 2015 NEERC F. Gourmet and Banquet
- 文章标题 codeforces 598F :Gourmet and Banquet(贪心+二分)
- CF589F Gourmet and Banquet(二分答案+最大流)
- 2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest F. Gourmet and Banquet(贪心+二分)
- 【2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest F】【贪心+ STL-优先队列】 Gourmet and Banquet 最大活动时间
- [二分+线段树构图+网络流]CodeForces 589FGourmet and Banquet
- HUNANOJ -- Gourmet
- poj 3622 Gourmet Grazers
- hdu 1024 Max Sum Plus Plus(dp)
- 算法笔记:贪心法(未完待续)
- 第六章 理解对象
- 如何培养《未来架构师》
- 关于Spring容器中定时器到时执行会出现两个线程同时执行的问题
- Gourmet and Banquet -CodeForces
- 1144
- orcale数据库-----------------2。字符函数
- java 设计模式 之 原型模式
- 如何培养《未来架构师》(2)
- How to copy and paste quickly in the shell
- float浮动的原理和工作方式,以及浮动造成的问题总结
- [POJ]2185 真正的正解
- 在C#中,Json的序列化和反序列化的几种方式总结