杭电-4883 TIANKENG’s restaurant
来源:互联网 发布:org.apache jar包 编辑:程序博客网 时间:2024/04/30 23:48
TIANKENG’s restaurant
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)
Total Submission(s): 2522 Accepted Submission(s): 933
Problem Description
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
Source
BestCoder Round #2
Recommend
liuyiding | We have carefully selected several similar problems for you: 5746 5745 5744 5743 5742
AC代码:
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int a[1510];int main(){ int t,n,x,i,j,begin,end,h,m,hh,mm; scanf("%d",&t); while(t--) { memset(a,0,sizeof(a)); scanf("%d",&n); while(n--) { scanf("%d %d:%d %d:%d",&x,&h,&m,&hh,&mm); begin=h*60+m; end=hh*60+mm; for(j=begin;j<end;j++) { a[j]=a[j]+x; } } int ans=0; for(j=1;j<1440;j++) { if(a[j]>ans) { ans=a[j]; } } printf("%d\n",ans); } 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
- 128. Longest Consecutive Sequence
- c++游戏别踩白块课程设计
- 心里藏着一个人,怎么能开始一段新的感情
- c语言_函数指针的调用方法
- 【HDU】4135 - Co-prime(容斥原理)
- 杭电-4883 TIANKENG’s restaurant
- gradle多渠道打包
- 定义一个长方形类,定义 求周长和面积的方法,然后定义一个测试了Test2,进行测试
- 【 CodeForces 698B 】Vacations
- tarjan
- PHP Cookie本地存储
- 求解单源最短路径:Dijkstara算法典型示例
- Spark Transformation —— subtract
- UVA 11609 Teams