【杭电4883】TIANKENG’s restaurant
来源:互联网 发布:seo优势 编辑:程序博客网 时间:2024/04/30 18:35
TIANKENG’s restaurant
Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uDescription
TIANKENG manages a restaurant after graduating from ZCMU, and tens of thousands of customers come to have meal because of its delicious dishes. Today n groups of customers come to enjoy their meal, and there are Xi persons in the ith group in sum. Assuming that each customer can own only one chair. Now we know the arriving time STi and departure time EDi of each group. Could you help TIANKENG calculate the minimum chairs he needs to prepare so that every customer can take a seat when arriving the restaurant?
Input
The first line contains a positive integer T(T<=100), standing for T test cases in all.
Each cases has a positive integer n(1<=n<=10000), which means n groups of customer. Then following n lines, each line there is a positive integer Xi(1<=Xi<=100), referring to the sum of the number of the ith group people, and the arriving time STi and departure time Edi(the time format is hh:mm, 0<=hh<24, 0<=mm<60), Given that the arriving time must be earlier than the departure time.
Pay attention that when a group of people arrive at the restaurant as soon as a group of people leaves from the restaurant, then the arriving group can be arranged to take their seats if the seats are enough.
Each cases has a positive integer n(1<=n<=10000), which means n groups of customer. Then following n lines, each line there is a positive integer Xi(1<=Xi<=100), referring to the sum of the number of the ith group people, and the arriving time STi and departure time Edi(the time format is hh:mm, 0<=hh<24, 0<=mm<60), Given that the arriving time must be earlier than the departure time.
Pay attention that when a group of people arrive at the restaurant as soon as a group of people leaves from the restaurant, then the arriving group can be arranged to take their seats if the seats are enough.
Output
For each test case, output the minimum number of chair that TIANKENG needs to prepare.
Sample Input
226 08:00 09:005 08:59 09:5926 08:00 09:005 09:00 10:00
Sample Output
116
刚开始以为是贪心问题,写了以下代码,结果错了wrong answer
123456789101112131415161718192021222324252627282930313233343536#include<stdio.h>#include<algorithm>using namespace std;struct stu{int a,h[2],m[2];}s[10000];bool cmp(stu q,stu p){if(q.h[1]!=p.h[1])return q.m[1]<p.m[1];else return q.h[1]<p.h[1];}int main(){int t;scanf("%d",&t);while(t--){int n;scanf("%d",&n);for(int i=0;i<n;i++)scanf("%d %d:%d %d:%d",&s[i].a,&s[i].h[0],&s[i].m[0],&s[i].h[1],&s[i].m[1]);sort(s,s+n,cmp);int sum=s[0].a;for(int i=1;i<n;i++){if((s[i].h[0]>=s[i-1].h[1])||(s[i].h[0]==s[i-1].h[1]&&s[i].m[0]>s[i-1].m[1]))sum=sum;elsesum=sum+s[i].a;}printf("%d\n",sum);}return 0;}而实际上是时间区域覆盖问题,在一段时间内,随时可能有下一组人来,所以正确代码如下:
0 0
- HDU杭电4883 TIANKENG’s restaurant
- 杭电4883TIANKENG’s restaurant
- 【杭电】[4883]TIANKENG’s restaurant
- 【杭电4883】TIANKENG’s restaurant
- 杭电-4883 TIANKENG’s restaurant
- 【杭电4883】TIANKENG’s restaurant
- 【杭电 4883】TIANKENG’s restaurant
- 杭电4883-TIANKENG’s restaurant(区间覆盖)
- 【杭电oj】4883 - TIANKENG’s restaurant(区间覆盖)
- 4883 TIANKENG’s restaurant
- 杭电4883 TIANKENG’s restaurant(小板凳的问题)
- HDOJ 4883 TIANKENG’s restaurant
- HDU 4883 TIANKENG’s restaurant
- hdu 4883 TIANKENG’s restaurant
- HDU 4883 TIANKENG’s restaurant
- hdu 4883 TIANKENG’s restaurant
- hdu 4883 TIANKENG’s restaurant
- hdoj 4883 TIANKENG’s restaurant
- 七步从Angular.JS菜鸟到专家(1):如何开始
- HDU 5718 oracle BestCoder 2nd Anniversary
- SDUT 2137 数据结构实验之求二叉树后序遍历和层次遍历
- web流程
- HDU 2603 Wiskey's Power(物理题)
- 【杭电4883】TIANKENG’s restaurant
- 多媒体初识
- HDU 5745 La Vie en rose
- popuwindow
- 2016.7.20学习总结,关于屏幕适配
- [Leetcode]358. Rearrange String k Distance Apart (贪心,窗口,堆,字符)
- 高精度小数-week5-C语言习题集
- 在easyui中实现datagrid滚动条联动
- wifi信道就是频段吗?,频段带宽又是什么?