1016 Phone Bills (25)（25 分）

---

---

1 题目

A long-distance telephone company charges its customers by the following rules:
Making a long-distance call costs a certain amount per minute, depending on the time of day when the call is made. When a customer starts connecting a long-distance call, the time will be recorded, and so will be the time when the customer hangs up the phone. Every calendar month, a bill is sent to the customer for each minute called (at a rate determined by the time of day). Your job is to prepare the bills for each month, given a set of phone call records.
Input Specification:
Each input file contains one test case. Each case has two parts: the rate structure, and the phone call records.
The rate structure consists of a line with 24 non-negative integers denoting the toll (cents/minute) from 00:00 - 01:00, the toll from 01:00－02:00, and so on for each hour in the day.
The next line contains a positive number N (<= 1000), followed by N lines of records. Each phone call record consists of the name of the customer (string of up to 20 characters without space), the time and date (mm:dd:hh:mm), and the word “on-line” or “off-line”.
For each test case, all dates will be within a single month. Each “on-line” record is paired with the chronologically next record for the same customer provided it is an “off-line” record. Any “on-line” records that are not paired with an “off-line” record are ignored, as are “off-line” records not paired with an “on-line” record. It is guaranteed that at least one call is well paired in the input. You may assume that no two records for the same customer have the same time. Times are recorded using a 24-hour clock.
Output Specification:
For each test case, you must print a phone bill for each customer.
Bills must be printed in alphabetical order of customers’ names. For each customer, first print in a line the name of the customer and the month of the bill in the format shown by the sample. Then for each time period of a call, print in one line the beginning and ending time and date (dd:hh:mm), the lasting time (in minute) and the charge of the call. The calls must be listed in chronological order. Finally, print the total charge for the month in the format shown by the sample.

Sample Input:

10 10 10 10 10 10 20 20 20 15 15 15 15 15 15 15 20 30 20 15 15 10 10 10
10
CYLL 01:01:06:01 on-line
CYLL 01:28:16:05 off-line
CYJJ 01:01:07:00 off-line
CYLL 01:01:08:03 off-line
CYJJ 01:01:05:59 on-line
aaa 01:01:01:03 on-line
aaa 01:02:00:01 on-line
CYLL 01:28:15:41 on-line
aaa 01:05:02:24 on-line
aaa 01:04:23:59 off-line

Sample Output:

CYJJ 01
01:05:59 01:07:00 61 $12.10
Total amount: $12.10
CYLL 01
01:06:01 01:08:03 122 $24.40
28:15:41 28:16:05 24 $3.85
Total amount: $28.25
aaa 01
02:00:01 04:23:59 4318 $638.80
Total amount: $638.80

题目链接：https://pintia.cn/problem-sets/994805342720868352/problems/994805493648703488

2 解题思路

　　题目大意：给你一个长途电话收费标准，以及一张通话记录，计算每个客户的话费单。每张通话记录可能有不匹配的状况，你需要在on-line和off-line中找到匹配的一次完整的通话，然后开始计费。输出每次完整通话的开始和结束时间以及本次通话话费，然后再计算本月通话总计。
　　这是一道排序题，但是需要注意的细节比较多，所以相比于一般的排序，也不简单。所以我觉得，与其所示排序，不如说是一道逻辑题。
　 思路:
　　1.题目要求以字母排序（alphabetical order）输出排序，但是从输出的Sample中可以看出，其实是以ASCII顺序，大写字母在前（65_{90），小写字母在后（97}122）。
　　2.以时间进行排序，题目给出的是月、日、时、分（mm:dd:hh:mm）的格式，不妨统一转换成分钟的相对值（以本月1号0点0分为起始时间），方便排序和计算通话时长。
　　3.计费也是同样的道理，计算每一次通话的相对值（相对于每月1号0点0分起）的话费，然后两次计费相减，即一次完整通话的话费。这样计费标准可以直接存在一个数组里，for循环遍历相对时间就可以得到每一次通话记录的相对话费了。
　　4.按姓名和通话时长排序之后，那么相邻的一次“on-line”和“off-line”必然是一次完整的通话。找到匹配通话记录之后，相减两者的“相对话费”，得到一次完整通话的话费，遍历有序记录，得到所有客户的数据。
　　
　　实现细节：可以把每个通话记录作为一个结构体，然后每个结构存储一个姓名、月、日、时、分，以及相对时间（分钟），结构体对象用vector存储，方便操作（也可以直接用结构体数组，但是比较麻烦），由于两个通话记录（on-line和off-line）对应一