关闭

PAT 1014 Waiting in Line (模拟)

标签: PAT 1014Waiting in Line
301人阅读 评论(0) 收藏 举报
分类:

1014. Waiting in Line (30)

时间限制
400 ms
内存限制
65536 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue

Suppose a bank has N windows open for service. There is a yellow line in front of the windows which devides the waiting area into two parts. The rules for the customers to wait in line are:

  • The space inside the yellow line in front of each window is enough to contain a line with M customers. Hence when all the N lines are full, all the customers after (and including) the (NM+1)st one will have to wait in a line behind the yellow line.
  • Each customer will choose the shortest line to wait in when crossing the yellow line. If there are two or more lines with the same length, the customer will always choose the window with the smallest number.
  • Customer[i] will take T[i] minutes to have his/her transaction processed.
  • The first N customers are assumed to be served at 8:00am.

Now given the processing time of each customer, you are supposed to tell the exact time at which a customer has his/her business done.

For example, suppose that a bank has 2 windows and each window may have 2 custmers waiting inside the yellow line. There are 5 customers waiting with transactions taking 1, 2, 6, 4 and 3 minutes, respectively. At 08:00 in the morning, customer1 is served at window1 while customer2 is served at window2. Customer3 will wait in front of window1 and customer4 will wait in front of window2. Customer5 will wait behind the yellow line.

At 08:01, customer1 is done and customer5 enters the line in front of window1 since that line seems shorter now. Customer2 will leave at 08:02, customer4 at 08:06, customer3 at 08:07, and finally customer5 at 08:10.

Input

Each input file contains one test case. Each case starts with a line containing 4 positive integers: N (<=20, number of windows), M (<=10, the maximum capacity of each line inside the yellow line), K (<=1000, number of customers), and Q (<=1000, number of customer queries).

The next line contains K positive integers, which are the processing time of the K customers.

The last line contains Q positive integers, which represent the customers who are asking about the time they can have their transactions done. The customers are numbered from 1 to K.

Output

For each of the Q customers, print in one line the time at which his/her transaction is finished, in the format HH:MM where HH is in [08, 17] and MM is in [00, 59]. Note that since the bank is closed everyday after 17:00, for those customers who cannot be served before 17:00, you must output "Sorry" instead.

Sample Input
2 2 7 5
1 2 6 4 3 534 2
3 4 5 6 7
Sample Output
08:07
08:06
08:10
17:00

Sorry

模拟题:

#include <iostream>
#include <string.h>
#include <stdlib.h>
#include <algorithm>
#include <math.h>
#include <stdio.h>
#include <queue>

using namespace std;

int t[1005];
int l;
int start[1005];
int e[1005];
int n,m;
int k;
void fun(int time)
{
  int hh=time/60;
  int mm=time%60;
  printf("%02d:%02d\n",8+hh,mm);
}
int main()
{
  scanf("%d%d%d%d",&n,&m,&k,&l);
  for(int i=1;i<=k;i++)
    scanf("%d",&t[i]);
  int cnt=1;
  memset(e,-1,sizeof(e));
  queue<int> q[1005];
  for(int j=1;j<=m;j++)
  {
    for(int i=1;i<=n;i++)
    {
      if(cnt>k)
        continue;
      if(j==1)
        start[cnt]=0;
      q[i].push(cnt++);
    }
  }
  for(int i=0;i<540;i++)
  {
    int num=1e5;
    for(int j=1;j<=n;j++)
    {
      if(q[j].empty()) continue;
      int x=q[j].front();
      if(start[x]+t[x]==i)
      {
        e[x]=i;
        q[j].pop();
        if(!q[j].empty())
        {
          int x=q[j].front();
          start[x]=i;
        }
      }
    }
    if(cnt>k)
      continue;
    for(int j=1;j<=n;j++)
    {
      if(q[j].size()<m)
      {
        if(cnt>k)
          continue;
        if(q[j].empty())
          start[cnt]=i;
        q[j].push(cnt++);
      }
    }
  }
  for(int i=1;i<=n;i++)
  {
    if(!q[i].empty())
    {
      int x=q[i].front();
      if(start[x]<540)
        e[x]=start[x]+t[x];
    }
  }
  int pos;
  for(int i=1;i<=l;i++)
  {
    scanf("%d",&pos);
    if(e[pos]==-1)
      printf("Sorry\n");
    else
      fun(e[pos]);
  }
  return 0;

}


0
0
查看评论

【PAT】1014. Waiting in Line (30)

Suppose a bank has N windows open for service. There is a yellow line in front of the windows which devides the waiting area into two parts. The rules...
  • realxuejin
  • realxuejin
  • 2015-10-26 19:01
  • 444

1014. Waiting in Line (30)

考察排队 #include #include #include #include #include #include #include #include using namespace std; int N;// (<=20, number of windows) int M;// (&l...
  • sunbaigui
  • sunbaigui
  • 2013-03-10 20:40
  • 2890

PAT (Advanced Level) Practise 1014 Waiting in Line (30)

1014. Waiting in Line (30) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue ...
  • jtjy568805874
  • jtjy568805874
  • 2016-03-03 23:26
  • 408

pat1014Waiting in Line (30)

题意分析: (1)本题模拟银行排队,逻辑上不难,操作起来有点麻烦。银行来了K个客户,银行有N个窗口,每个窗口前有M个位置排队,客户选择最短的队伍排,根据每个客户的序号和服务时间来确定最后客户离开银行的时间。 (2)属于队列的问题,但实际上可以将问题简化:因为每个客户的服务时间是固定的,假设前N*M个...
  • LostStephon
  • LostStephon
  • 2015-10-02 20:33
  • 353

PAT 1014. Waiting in Line

题目:http://pat.zju.edu.cn/contests/pat-a-practise/1014 题解: 模拟题。 先把n*m个客户加入对应的n的窗口队列中,如果还有客户,枚举判断出n个窗口中最早处理完的队列,然后将用户加入此队列。 最后将时间和时限进行比较,输出。 代码: #includ...
  • ACM_Ted
  • ACM_Ted
  • 2014-03-04 17:21
  • 1829

PAT (Advanced Level) Practise 1014. Waiting in Line (30)

1014. Waiting in Line (30) 时间限制 400 ms 内存限制 32000 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue ...
  • wyxdexyq
  • wyxdexyq
  • 2014-10-24 18:36
  • 662

PAT 1014. Waiting in Line

一开始题意理解错了。 是17:00之前还没开始服务的就不能服务了。 不是说不能完成就sorry了。 另外这种模拟题一旦用数组和很多游标 自己就很容易出错。 以后还是要尽量少用了。 #include #include #include #include #include #incl...
  • WhereYouSink
  • WhereYouSink
  • 2016-08-13 21:32
  • 323

[PAT (Advanced Level) ]1014.Waiting in Line 解题文档

1014. Waiting in Line (30) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue Suppose a bank has N windows ...
  • u010536377
  • u010536377
  • 2015-10-23 23:21
  • 367

PAT 1014. Waiting in Line

一开始题意理解错了。 是17:00之前还没开始服务的就不能服务了。 不是说不能完成就sorry了。 另外这种模拟题一旦用数组和很多游标 自己就很容易出错。 以后还是要尽量少用了。 #include #include #include #include #include #incl...
  • WhereYouSink
  • WhereYouSink
  • 2016-08-13 21:32
  • 323

【PAT1014】 Waiting in Line (30) queue模拟排队

1014. Waiting in Line (30) 时间限制 400 ms 内存限制 32000 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue Suppose a bank has N windows ...
  • tiantangrenjian
  • tiantangrenjian
  • 2014-02-20 22:23
  • 3023
    个人资料
    • 访问:131069次
    • 积分:4658
    • 等级:
    • 排名:第7453名
    • 原创:349篇
    • 转载:0篇
    • 译文:0篇
    • 评论:7条
    最新评论