【PAT】PAT A1016 Phone Bills【排序】

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

题目大意

题目给定一组通话记录，要求把所有用户的有效通话记录计费。并将计费后的结果按照客户的名字的字母序排列后输出。有效通话记录是指on-line记录后紧接着off-line记录的用户通话记录。

思路

• 先将通话记录按照姓名>时间>类型（on-line在前,off-line）的优先级排序。
• 相邻两条记录判断是否为同一个用户的通话记录并且前一条为on-line，后一条为off-line。
• 对于时间处理，要注意跨天的问题。
  • 第一种做法是以某个时间点为基准，计算出开始和结束的时间和费用然后做差（对于跨月的问题比较麻烦，但是在这道题里不会出现跨月问题，所以以每月第一天凌晨为基准时间就可以）
  • 第二种是下面代码的方式，判断是否跨天（不跨天就简单的两个时间相减，跨天就从开始时间计算到凌晨，再从凌晨计算到结束时间）。
• 最后要将记录依据 用户>时间 进行分组，这里有两种方案：
  • 一种是创建一个map分组存储。这种方法代码比较清晰，效率差些（其实差别很小）。
  • 第二种是下列代码中的设置哨兵的方法（判断遍历到了新组，则输出上一组的尾部和这一组的头部， 对于第一组，因为没有上一组，所以不输出上一组的头部，对于最后一组需要在for循环外面再输出一次尾部）。 代码写起来相对乱一点。

代码

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#define H 24
#define maxN 1000
using namespace std;
struct Customer{
   
    string name;
    int M;
    int d;
    int h;
    int m;
    int type;
} customers[maxN];
bool cmp(