杭电4883TIANKENG’s restaurant
来源:互联网 发布:项目经理转行数据分析 编辑:程序博客网 时间:2024/05/01 01:38
TIANKENG’s restaurant
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 2218 Accepted Submission(s): 802
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
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;bool cmp(int x,int y){return x>y;}int main(){int t,n,x,a,b,c,d,i,s[1550];scanf("%d",&t);while(t--){ memset(s,0,sizeof(s)); scanf("%d",&n);while(n--){scanf("%d%d:%d %d:%d",&x,&a,&b,&c,&d);int t1=a*60+b;int t2=c*60+d;for(i=t1+1;i<=t2;i++)s[i]+=x;}sort(s,s+1550,cmp);printf("%d\n",s[0]);}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
- hbuilder上传图片
- Linux的五个查找命令
- 常量指针、指针常量的区分与相关
- 标题栏渐变的效果实现
- 关于字体大小随手机底层设置改变而改变的问题
- 杭电4883TIANKENG’s restaurant
- 让模态对话框最小化时,任务栏显示图标
- Odoo(OpenERP)开发实践:在QWeb报表中自定义页眉页脚
- B - TIANKENG’s restaurant
- iOS 生成二维码
- 关于原码 补码
- oracle——SQL复习04
- Python 高级编程笔记之编写一个包
- 322. Coin Change LeetCode