PAT 1014 Waiting in Line
2014-01-30 16:32
459 查看
1014. Waiting in Line (30)
模拟题,用队列做比较简单#include<cstdio> #include<queue> using namespace std; #define sb line[l].front() const int N=1002,bt=8*60,et=17*60; int t ,n,m,k,q,p,ans ; queue<int> line[22]; void solve(){ for(int j=0;j<m;j++) for(int i=1;i<=n;i++) line[i].push(j*n+i); int turn=n*m+1; for(int time=bt+1;time<et;time++) for(int l=1;l<=n;l++) if(--t[sb]==0){//服务完 ans[sb]=time; line[l].pop(); line[l].push(turn++); } for(int l=1;l<=n;l++) if(!line[l].empty())//只服务第一个 ans[sb]=et-1+t[sb]; } int main(){ scanf("%d %d %d %d",&n,&m,&k,&q); for(int i=1;i<=k;i++) scanf("%d",&t[i]); solve(); while(q--){ scanf("%d",&p); if(ans[p]) printf("%02d:%02d\n",ans[p]/60,ans[p]%60); else printf("Sorry\n"); } return 0; }
相关文章推荐
- PAT 1014 Waiting in Line (30)
- pat1014 Waiting in line
- PAT-1014 Waiting in Line (30)
- PAT (Advanced Level) Practise 1014 Waiting in Line (30)
- PAT 1014 Waiting in Line (30)
- [PAT][1014] Waiting in Line
- PAT 甲级 1014 Waiting in Line (30)
- PAT (Advanced Level) Practise 1014 Waiting in Line (30)
- PAT 1014 Waiting in Line (30)
- pat 1014 Waiting in Line (30)
- PAT 1014 Waiting in Line(模拟+队列操作)
- PAT_1014: Waiting in Line
- PAT 1014 Waiting in Line
- PAT 1014 Waiting in line
- 【PAT1014】 Waiting in Line (30) queue模拟排队
- 1014 Waiting in Line (30)
- 1014.Waiting in Line
- PAT 1014 Waiting in Line (模拟)
- project-waiting in line
- 【九度】题目1326:Waiting in Line