1014. Waiting in Line (30)
来源:互联网 发布:java代码实现单例模式 编辑:程序博客网 时间:2024/04/30 04:47
#include<iostream>#include<iomanip>#include<queue>#define MAXTIME 540#define INF 1000using namespace std;void time_change(int i){ if(i==INF) cout<<"Sorry"<<endl; else cout<<setw(2)<<setfill('0')<<8+i/60<<":"<<setw(2)<<setfill('0')<<i%60<<endl;}int main(){ int N,M,K,Q,x=1; queue<int> q[22]; int T[1001]; int time[1001]; cin>>N>>M>>K>>Q; for(int t=1;t<=K;t++) {cin>>T[t];time[t]=INF;} for(int t=0;t<M;t++) { for(int i=0;i<N;i++) if(x<=K) q[i].push(x++); } for(int t=1;t<=539;t++) { for(int i=0;i<N;i++) { if(!q[i].empty() &&--T[q[i].front()]==0) { time[q[i].front()]=t; if(q[i].size()>=2) q[i].pop(); if(x<=K) { q[i].push(x++); } } if(t==539 && T[q[i].front()]>0) time[q[i].front()]=t+T[q[i].front()]; } } for(int t=1;t<=Q;t++) { cin>>x; time_change(time[x]); }}
0 0
- 1014. Waiting in Line (30)
- 1014. Waiting in Line (30)
- 1014. Waiting in Line (30)
- 1014. Waiting in Line (30)
- 1014. Waiting in Line (30)
- 1014. Waiting in Line (30)
- 1014. Waiting in Line (30)
- 1014. Waiting in Line (30)
- 1014. Waiting in Line (30)
- 1014. Waiting in Line (30)
- 1014. Waiting in Line (30)
- 1014. Waiting in Line (30)
- 1014. Waiting in Line (30)
- 1014. Waiting in Line (30)
- 1014. Waiting in Line (30)
- 1014. Waiting in Line (30)
- 1014. Waiting in Line (30)
- 1014. Waiting in Line (30)
- [BZOJ1036][ZJOI2008]树的统计Count(树链剖分)
- Gsonformat
- 1013. Battle Over Cities (25)
- ssm整合的配置文件
- vim配置中的.vimrc文件内容配置,还有两个插件安装效果图
- 1014. Waiting in Line (30)
- 数据结构哈希表
- 1015. Reversible Primes (20)
- 中华人民共和国财政部令第20号——政府采购供应商投诉处理办法
- 查看天气可用的api
- 1016. Phone Bills (25)
- Java基础----Servlet
- 利用burp+metasplot快速检测&利用 ImageTragick(CVE-2016–3714)
- 1017. Queueing at Bank (25)