TIANKENG’s restaurant hd 4883
2016-07-22 20:27
423 查看
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.
Output
For each test case, output the minimum number of chair that TIANKENG needs to prepare.
Sample Input
2
2
6 08:00 09:00
5 08:59 09:59
2
6 08:00 09:00
5 09:00 10:00
Sample Output
11
6
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <cmath>
using namespace std;
#define ll long long
int n;
int time[1442];
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
memset(time,0,sizeof(time));
scanf("%d",&n);
int sh,sm;
int eh,em;
int cnt=0;
int ans=0;
for(int i=1;i<=n;i++)
{
scanf("%d",&cnt);
scanf("%d:%d",&sh,&sm);
scanf("%d:%d",&eh,&em);
int s=sh*60+sm;
int e=eh*60+em;
e--;
for(int i=s;i<=e;i++)
{
time[i]+=cnt;
}
}
for(int i=0;i<1440;i++)
{
if(ans<time[i])
ans=time[i];
}
printf("%d\n",ans);
}
return 0;
}
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.
Output
For each test case, output the minimum number of chair that TIANKENG needs to prepare.
Sample Input
2
2
6 08:00 09:00
5 08:59 09:59
2
6 08:00 09:00
5 09:00 10:00
Sample Output
11
6
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <cmath>
using namespace std;
#define ll long long
int n;
int time[1442];
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
memset(time,0,sizeof(time));
scanf("%d",&n);
int sh,sm;
int eh,em;
int cnt=0;
int ans=0;
for(int i=1;i<=n;i++)
{
scanf("%d",&cnt);
scanf("%d:%d",&sh,&sm);
scanf("%d:%d",&eh,&em);
int s=sh*60+sm;
int e=eh*60+em;
e--;
for(int i=s;i<=e;i++)
{
time[i]+=cnt;
}
}
for(int i=0;i<1440;i++)
{
if(ans<time[i])
ans=time[i];
}
printf("%d\n",ans);
}
return 0;
}
相关文章推荐
- dp整数划分问题——03:复杂的整数划分问题
- Flux/Redux架构初步
- FFmpeg应用程序的使用
- hdu5729 Rigid Frameworks(连通二分图计数dp)
- 使用 screen 管理远程会话
- Lars Knoll 宣布了Qt 5有四大目标
- ****Codeforces Round #363 (Div. 2) C. Vacations(DP 动态规划)
- 数据解析
- caffe安装
- NYOJ 510 昂贵的聘礼 dfs
- 快速求幂与快速幂模
- java 反射机制的基本知识
- 漫步微积分十——复合函数和链式法则
- JVM系列三:JVM参数设置、分析
- 基于MVC+EasyUI的Web开发框架经验总结(9)--在Datagrid里面实现外键字段的转义操作
- Codeforces Round #343 (Div. 2) B. Far Relative’s Problem (贪心)
- UVa--839 Not so Mobile
- 你收到了吗,我的三行情书。
- 如何对没有缩进的pdf进行修改目录,快速方法!!!
- Jenkins+SonarQube代码质量检查自动化