PAT (Advanced Level) Practice1014 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 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 customers 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, customer~1~ is served at window~1~ while customer~2~ is served at window~2~. Customer~3~ will wait in front of window~1~ and customer~4~ will wait in front of window~2~. Customer~5~ will wait behind the yellow line.
At 08:01, customer~1~ is done and customer~5~ enters the line in front of window~1~ since that line seems shorter now. Customer~2~ will leave at 08:02, customer~4~ at 08:06, customer~3~ at 08:07, and finally customer~5~ 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

题意

一个银行有N个窗口办理业务,每个窗口可以有M个人在黄线内排队,从第N*M+1个人起,排在黄线外。给出每个人所需时间,询问Q次,问第x个人在几点办理结束。

不知道为什么没完全AC,周末再来补。。

### PAT 基本级别练习的相关资料 PAT(Programming Ability Test)是一项针对编程能力的标准化考试,其基本级别主要考察考生的基础编程技能和逻辑思维能力。以下是关于 PAT 基本级别的练习题目及相关解决方案的内容。 #### 题目PAT 基本级别的题目通常为以下几个类别: 1. **字符串处理**:涉及字符串的操作,如反转、查找子串等。 2. **数组操作**:包括数组排序、去重、统计等问题。 3. **简单算法实现**:如计算阶乘、判断素数等基础算法。 4. **输入输出格式化**:要求按照特定格式读取数据并输出结果。 以下是一些典型的 PAT 基本级别练习题及其解决思路: --- #### 示例题目 1: 字符串反转 **描述**: 输入一个字符串,将其逆序输出。 **解法**: 可以通过 Python 中的切片功能轻松实现字符串反转。 ```python def reverse_string(s): return s[::-1] # 测试用例 input_str = input() print(reverse_string(input_str)) ``` 此代码利用了 Python 切片语法 `s[start:end:step]`,其中步长为 `-1` 表示反向遍历字符串[^4]。 --- #### 示例题目 2: 数组求和 **描述**: 给定一组整数,求数组中所有元素的总和。 **解法**: 通过循环累加或者内置函数 `sum()` 实现数组求和。 ```python def array_sum(arr): return sum(arr) # 测试用例 numbers = list(map(int, input().split())) print(array_sum(numbers)) ``` 上述代码中,`map()` 函数用于将输入转换为整型列表,而 `sum()` 是 Python 的内置函数,能够高效完成求和任务[^5]。 --- #### 示例题目 3: 计算阶乘 **描述**: 输入一个正整数 \( n \),输出它的阶乘 \( n! \)。 **解法**: 使用递归或迭代方式均可实现阶乘计算。 ```python def factorial(n): if n == 0 or n == 1: return 1 result = 1 for i in range(2, n + 1): result *= i return result # 测试用例 n = int(input()) print(factorial(n)) ``` 该程序采用了迭代方法避免栈溢出的风险,在实际应用中更为稳健[^6]。 --- #### 示例题目 4: 判断素数 **描述**: 输入一个正整数 \( m \),判断它是否为素数。 **解法**: 素数是指仅能被 1 和自身整除的大于 1 的自然数。可通过试除法验证。 ```python import math def is_prime(m): if m <= 1: return False sqrt_m = int(math.sqrt(m)) + 1 for i in range(2, sqrt_m): if m % i == 0: return False return True # 测试用例 m = int(input()) if is_prime(m): print("Yes") else: print("No") ``` 在此代码片段中,引入了平方根优化技术以减少不必要的运算次数[^7]。 --- ### 总结 以上展示了几个常见的 PAT 基础级问题以及对应的解决方案。这些例子涵盖了字符串操作、数组处理、数学计算等多个方面,有助于初学者熟悉 PAT 考试的形式与难度。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值