HDU4883模拟
来源:互联网 发布:淘宝助理水印 编辑:程序博客网 时间:2024/05/16 00:55
原题http://acm.hdu.edu.cn/showproblem.php?pid=4883
TIANKENG’s restaurant
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)
Total Submission(s): 443 Accepted Submission(s): 231
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 <stdio.h>#include <stdlib.h>#include <malloc.h>#include <limits.h>#include <ctype.h>#include <string.h>//直接模拟,把每分钟的人数都确定下来,然后循环。找出答案#include <string>#include <algorithm>#include <iostream>#include <stack>#include <queue>#include <deque>#include <vector>#include <set>#include <map>using namespace std;#define N 1444int ans[N];int main(){int t,n,sum,a,b,c,d,f1,f2,i;while(~scanf("%d",&t)){while(t--){memset(ans,0,sizeof(ans));scanf("%d",&n);while(n--){scanf("%d%d:%d%d:%d",&sum,&a,&b,&c,&d);//memset(ans,0,sizeof(ans));f1 = a*60+b;f2 = c*60+d;//int i;for(i=f1;i<f2;i++){ans[i]+=sum;}}int max = -1;for(i=0;i<N;i++){if(max < ans[i]){max = ans[i];}}printf("%d\n",max);}}return 0;}
0 0
- HDU4883模拟
- hdu4883
- HDU4883
- hdu4883 TIANKENG’s restaurant 模拟下就好了
- hdu4883(贪心)
- hdu4883/BestCoder#2_1001
- TIANKENG’s restaurant--hdu4883
- HDU4883 TIANKENG’s restaurant 【贪心】
- hdu4883 & BestCoder Round #2 TIANKENG’s restaurant(暴力)
- 模拟
- 模拟
- 模拟
- 模拟
- 模拟
- 模拟
- 模拟
- 模拟
- 模拟
- Cocoapods 第三方依赖库管理使用介绍
- 格式化时间,几分钟前,几小时前
- 棋牌游戏服务器开发心得
- xxx
- unity 2d 四大坐标系问题 鼠标点击位置问题 详细入门解析
- HDU4883模拟
- c中不安全的函数
- 我的架构经验系列文章 - 后端架构 - 设计层面
- 手机点餐APP开发需求分析
- eclipse快捷键
- PDF格式在出版印刷行业的应用
- HDU - 2604 Queuing (矩阵快速幂)
- UVA 10300 Ecological Premium
- shell 中的函数优先于 命令