TIANKENG’s restaurant
来源:互联网 发布:变频布林线源码 编辑:程序博客网 时间:2024/06/06 02:50
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
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;struct node{int renshu ,kaishi,kaifen,lishi,lifen,jintime,litime;}zu[20001];int shi[2001];int main(){int t;scanf("%d",&t);while(t--){memset(shi,0,sizeof(shi)); int n; scanf("%d",&n); for(int i=0;i<n;i++) { scanf("%d %d:%d %d:%d",&zu[i].renshu ,&zu[i].kaishi ,&zu[i].kaifen ,&zu[i].lishi ,&zu[i].lifen ); zu[i].jintime =zu[i].kaishi *60+zu[i].kaifen ; zu[i].litime =zu[i].lishi *60+zu[i].lifen ; } for(int i=0;i<n;i++) { for(int j=zu[i].jintime;j<zu[i].litime ;j++ ) { shi[j]+=zu[i].renshu;} } int max=0; for(int i=1;i<=1440;i++) { if(shi[i]>max) { max=shi[i]; } } printf("%d\n",max);}return 0;}
0 0
- TIANKENG’s restaurant
- TIANKENG’s restaurant
- HDU_4883 TIANKENG’s restaurant
- hdu TIANKENG’s restaurant
- hdoj4883 TIANKENG’s restaurant
- TIANKENG’s restaurant
- HDOJ TIANKENG’s restaurant
- TIANKENG’s restaurant
- 4883 TIANKENG’s restaurant
- hd4883 TIANKENG’s restaurant
- TIANKENG’s restaurant--hdu4883
- TIANKENG’s restaurant
- B - TIANKENG’s restaurant
- TIANKENG’s restaurant
- TIANKENG’s restaurant
- TIANKENG’s restaurant
- TIANKENG’s restaurant HDU
- HDOJ 4883 TIANKENG’s restaurant
- Service基本用法
- python pexpect和argparse模块用法例子之确保一批远程机器指定一批服务在运行
- Android--圆形进度条对话框
- php学习--6文件操作
- Windbg调试程序
- TIANKENG’s restaurant
- 《Java源码分析》:LinkedHashSet
- WEBAPP“企业网站”模板用户指南
- C++的重写,重载,重定义
- 循环队列
- 【三】Deep Learning模型之:CNN卷积神经网络推导和实现
- CodeForces 451B Sort the Array
- 2016.07.13【初中部 NOIP提高组 】模拟赛C
- JAVA面向对象-----this的概述