1.当有多个乒乓球台空闲时,vip顾客到了会使用最小id的vip球台,而不是最小id的球台,测试以下用例:
2 10:00:00 30 1 12:00:00 30 1 5 1 3
输出正确结果应为:
10:00:00 10:00:00 0
12:00:00 12:00:00 0
0 0 2 0 0
2.题目要求每对顾客玩的时间不超过2小时,那么当顾客要求玩的时间>2小时的时候,应该截断控制,测试以下用例:
2
18:00:00 180 1
20:00:00 60 1
1 1
1
输出的正确结果应为:
18:00:00 18:00:00 0
20:00:00 20:00:00 0
2
3.虽然题目中保证客户到达时间在08:00:00到21:00:00之间,但是根据最后的8个case来看,里面还是有不在这个时间区间内到达的顾客,所以建议还是稍加控制,测试以下用例:
1
21:00:00 80 1
1 1
1
输出的正确结果应为:
0
4.题目中说的round up to an integer minutes是严格的四舍五入,需要如下做:
wtime = (stime - atime + 30) / 60
而不是:
wtime = (stime - atime + 59) / 60
#include<cstdio> #include<iostream> #include<algorithm> #include<vector> #include<string> #include<cstring> #include<cmath> using namespace std; struct node { int arr,l,f; }p[10005]; struct result { int t1,t2,wait; }res[10005]; vector<node>v[2]; int ok[105],vip[105],serve[105]; int n,m,k; const bool cmp(const node &x,const node &y) { return x.arr<y.arr; } const bool cmp1(const result &x,const result &y) { return x.t2<y.t2; } int find(int tm,int f) { int ret = 1000000,ans = 0; for(int i = 1;i<=m;i++) { if(f&&!vip[i])continue; if(ok[i]<tm) { ans = i; break; } else if(ok[i]<ret) { ans = i; ret = ok[i]; } } return ans; } int main() { int i,j,a,b,c,num; while(scanf("%d",&n)!=EOF) { num = 0; memset(serve,0,sizeof(serve)); for(i = 0;i<n;i++) { scanf("%d:%d:%d %d %d",&a,&b,&c,&p[i].l,&p[i].f); p[i].arr = a*60*60+b*60+c; if(p[i].f)v[1].push_back(p[i]); else v[0].push_back(p[i]); } p[n].arr = p[n+1].arr = 1e8; v[0].push_back(p[n]); v[1].push_back(p[n+1]); sort(v[0].begin(),v[0].end(),cmp); sort(v[1].begin(),v[1].end(),cmp); scanf("%d%d",&m,&k); for(i = 1;i<=m;i++)ok[i] = 8*60*60; for(i = 1;i<=k;i++) { scanf("%d",&a); vip[a] = 1; } i = j = 0; while(1) { int tm1 = v[0][i].arr,tm2 = v[1][j].arr; int id = find(min(tm1,tm2),0),who; int vip_table = find(tm2,1); if(ok[id]>=21*60*60||min(tm1,tm2)>=21*60*60)break; if(!vip[id])who = v[0][i].arr<v[1][j].arr?0:1; else who = v[1][j].arr<max(ok[id],v[0][i].arr)?1:0; int pos = who == 0?i:j; if(who == 1&&vip_table&&ok[vip_table]<=v[1][pos].arr)id = vip_table; res[num].t1 = v[who][pos].arr; res[num].t2 = max(ok[id],v[who][pos].arr); res[num].wait = res[num].t2-res[num].t1; ok[id] = res[num].t2+min(v[who][pos].l,120)*60; serve[id]++; if(who == 0)i++; else j++; num++; } sort(res,res+num,cmp1); for(i = 0;i<num;i++)printf("%02d:%02d:%02d %02d:%02d:%02d %d\n",res[i].t1/3600,res[i].t1%3600/60,res[i].t1%60,res[i].t2/3600,res[i].t2%3600/60,res[i].t2%60,(res[i].wait+30)/60); for(i = 1;i<m;i++)printf("%d ",serve[i]); printf("%d\n",serve[m]); } return 0; }