A table tennis club has N tables available to the public. The tables are numbered from 1 to N. For any pair of players, if there are some tables open when they arrive, they will be assigned to the available table with the smallest number. If all the tables are occupied, they will have to wait in a queue. It is assumed that every pair of players can play for at most 2 hours.
Your job is to count for everyone in queue their waiting time, and for each table the number of players it has served for the day.
One thing that makes this procedure a bit complicated is that the club reserves some tables for their VIP members. When a VIP table is open, the first VIP pair in the queue will have the priviledge to take it. However, if there is no VIP in the queue, the next pair of players can take it. On the other hand, if when it is the turn of a VIP pair, yet no VIP table is available, they can be assigned as any ordinary players.
Input Specification:
Each input file contains one test case. For each case, the first line contains an integer N (<=10000) - the total number of pairs of players. Then N lines follow, each contains 2 times and a VIP tag: HH:MM:SS - the arriving time, P - the playing time in minutes of a pair of players, and tag - which is 1 if they hold a VIP card, or 0 if not. It is guaranteed that the arriving time is between 08:00:00 and 21:00:00 while the club is open. It is assumed that no two customers arrives at the same time. Following the players' info, there are 2 positive integers: K (<=100) - the number of tables, and M (< K) - the number of VIP tables. The last line contains M table numbers.
Output Specification:
For each test case, first print the arriving time, serving time and the waiting time for each pair of players in the format shown by the sample. Then print in a line the number of players served by each table. Notice that the output must be listed in chronological order of the serving time. The waiting time must be rounded up to an integer minute(s). If one cannot get a table before the closing time, their information must NOT be printed.
Sample Input:
9
20:52:00 10 0
08:00:00 20 0
08:02:00 30 0
20:51:00 10 0
08:10:00 5 0
08:12:00 10 1
20:50:00 10 0
08:01:30 15 1
20:53:00 10 1
3 1
2
Sample Output:
08:00:00 08:00:00 0 08:01:30 08:01:30 0 08:02:00 08:02:00 0 08:12:00 08:16:30 5 08:10:00 08:20:00 10 20:50:00 20:50:00 0 20:51:00 20:51:00 0 20:52:00 20:52:00 0 3 3 2
先理清题目中重要的点：
把所有的时间都转换成秒方便比较。
1.playing time最多是120（两小时）,超过的按照120处理
2.对于vip客户，先查看是否有空闲的vip桌，如果有选择编号最小的，如果没有按照普通客户来处理
3.当前处理的客户没有空闲桌子时需要等待最先空闲的一个桌子，如果最先空闲的桌子是个vip桌，而此客户又不是vip客户，那么要查看后到的客户中是否有vip客户，且vip客户到达时间在vip桌空闲时间之前，如果有，就先处理此vip客户。同时要重新处理当前非vip客户。
4.结果等待时间需要四舍五入。
5.到达时间没有重复的，可以按到达时间排序。
6.营业时间截止21点，处理时间超过21点的就违反了规定，不输出。
每处理一个客户就输出一个客户。
#include <stdlib.h> #include <stdio.h> #define inf 0x3f3f3f3f #define MAX 10001 const int e = 21 * 3600; /** n个乒乓球桌 1-n 每对players选择open的编号最小的 没有open的就排队 最多play两小时 计数每对的等待时间 每桌的服务次数 对于vip桌 第一对vip 可以用 如果队里没有vip 那么可以当成一般的给一般的一对plays用 如果没有vip桌了 可以给vip普通桌 不会有重复的到达时间 **/ struct player { int t,p,tag,ser; }pl[MAX]; struct table { int ifvip,num,t; }ta[101]; int n,hh,mm,ss,p,tag,k,m,d,vis[MAX];///vis标记是否处理过 int simplify(int hh,int mm,int ss) {///时间化为秒 return hh * 3600 + mm * 60 + ss; } int cmp(const void *a,const void *b) { return ((struct player *)a) -> t - ((struct player *)b) -> t; } int max(int a,int b) { return a > b ? a : b; } int havevip(int a,int b) {///等待a号桌的人中是否有vip 如果有返回编号 没有就返回-1 while(++ b < n) { if(!vis[b] && pl[b].tag) { if(pl[b].t < ta[a].t)return b; return -1; } } return -1; } int main() { scanf("%d",&n); for(int i = 0;i < n;i ++) { scanf("%d:%d:%d %d %d",&hh,&mm,&ss,&pl[i].p,&pl[i].tag); pl[i].t = simplify(hh,mm,ss); if(pl[i].p > 120)pl[i].p = 120;///play超过120 pl[i].p *= 60;///化成秒 } scanf("%d%d",&k,&m); for(int i = 0;i < m;i ++) { scanf("%d",&d); ta[d].ifvip = 1; } for(int i = 1;i <= k;i ++) { ta[i].num = ta[i].t = 0; } qsort(pl,n,sizeof(struct player),cmp);///按到达时间排序 for(int i = 0;i < n;i ++) { if(vis[i])continue; int ti = -1,mi = inf; if(pl[i].tag)///vip客户先查看是否有空的vip桌子 没有就当成一般客户对待 for(int j = 1;j <= k;j ++) {///按编号从小到大查看 如果有空桌子 ti就不再是-1 if(ta[j].ifvip && ta[j].t <= pl[i].t) { ti = j; mi = ta[j].t; break; } } if(ti == -1) for(int j = 1;j <= k;j ++) {///按编号从小到大查看 如果有空的 直接用 if(ta[j].t <= pl[i].t) {///不用排队 ti = j; mi = ta[j].t; break; } else if(ta[j].t < mi) {///需要排队，找到最先空闲的桌子 ti = j; mi = ta[j].t; } } if(mi > pl[i].t && ta[ti].ifvip && !pl[i].tag) {///需要排队且最先空闲的桌子是vip而当前客户非vip d = havevip(ti,i); if(d != -1) {///队伍里有vip客户 if((pl[d].ser = mi) >= e)break; i --;///要重新处理当前非vip客户 ta[ti].t = pl[d].ser + pl[d].p; ta[ti].num ++; int w = max(0,pl[d].ser - pl[d].t); vis[d] = 1; printf("%02d:%02d:%02d %02d:%02d:%02d %d ",pl[d].t / 3600,pl[d].t / 60 % 60,pl[d].t % 60,pl[d].ser / 3600,pl[d].ser / 60 % 60,pl[d].ser % 60,(w + 30) / 60);///四舍五入 continue; } } if((pl[i].ser = max(mi,pl[i].t)) >= e)break; ta[ti].t = pl[i].ser + pl[i].p; ta[ti].num ++; int w = max(0,pl[i].ser - pl[i].t); vis[i] = 1; printf("%02d:%02d:%02d %02d:%02d:%02d %d ",pl[i].t / 3600,pl[i].t / 60 % 60,pl[i].t % 60,pl[i].ser / 3600,pl[i].ser / 60 % 60,pl[i].ser % 60,(w + 30) / 60);///四舍五入 } for(int i = 1;i <= k;i ++) {///输出每个桌服务人数 if(i > 1)putchar(' '); printf("%d",ta[i].num); } }