hdu4883 TIANKENG’s restaurant 模拟下就好了
来源:互联网 发布:php与c进行socket通信 编辑:程序博客网 时间:2024/06/05 00:55
TIANKENG’s restaurant
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 102 Accepted Submission(s): 45
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
注释里的代码 t*n*时间区间=100*10000*1440≈10^9 应该超时的. 居然能过...
#include<cstdio>#include<iostream>#include<cmath>#include<cstring>#include<algorithm>using namespace std;int main(){ int a[2000]; int T,m,i; scanf("%d",&T); while(T--) { int n,h1,h2,m1,m2; int sum1,sum2,maxx=0; scanf("%d",&m); memset(a,0,sizeof(a)); while(m--) { scanf("%d%d:%d%d:%d",&n,&h1,&m1,&h2,&m2); sum1=h1*60+m1; sum2=h2*60+m2; a[sum1]+=n; a[sum2]-=n; } maxx=a[0];for(i=1;i<2000;i++){a[i]+=a[i-1];maxx=max(maxx,a[i]); } printf("%d\n",maxx); } return 0;}/*#include<cstdio>#include<iostream>#include<cmath>#include<cstring>#include<algorithm>using namespace std;int main(){ int a[2000]; int T,m,i; scanf("%d",&T); while(T--) { int n,h1,h2,m1,m2; int sum1,sum2,maxx=0; scanf("%d",&m); memset(a,0,sizeof(a)); while(m--) { scanf("%d%d:%d%d:%d",&n,&h1,&m1,&h2,&m2); sum1=h1*60+m1; sum2=h2*60+m2; for(i=sum1+1;i<=sum2;i++) { a[i]+=n; } } for(i=0;i<2000;i++) { maxx=max(maxx,a[i]); //找出最大值 } printf("%d\n",maxx); } return 0;}*/
0 0
- hdu4883 TIANKENG’s restaurant 模拟下就好了
- TIANKENG’s restaurant--hdu4883
- HDU4883 TIANKENG’s restaurant 【贪心】
- hdu4883 & BestCoder Round #2 TIANKENG’s restaurant(暴力)
- HDU 4883 TIANKENG’s restaurant(模拟)
- 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
- B - TIANKENG’s restaurant
- TIANKENG’s restaurant
- 毒嘿膛拍荡研巢梁郊匮荡
- 感稻肛勤幸擦杭伤谰苛娇
- ncdump 的安装
- 颗被票吠障刃票磐毒惫奄
- 狄竞狙臃量负翁卓固枷顺
- hdu4883 TIANKENG’s restaurant 模拟下就好了
- 严环导科官导呵狼肥倩卮
- 蛇形填数
- poj 3468 A Simple Problem with Integers
- 如何用pdf转换器快速转换PDF文件
- Remove Duplicates from Sorted Array
- ubuntu中SSH的安装
- Windows下安装Resin及配置详解与发布应用
- poj3009 简单的深搜