PAT 1016 Phone Bills

1016 Phone Bills （25 分）
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

题目要求：读入通话记录，为每个用户计算该月的消费，按用户名字字典序输出消费记录和总的消费金额。

分       析：这里要求按字典序输出，自然想到用map<string,vector<> >存储数据，名字做key，消费记录存入vector中做value，最后按map输出，自然就按名字排好了序，只需为每个用户计算花费即可。感觉思路清晰又简单。但是，这是有bug的?，bug见坑点1！

坑       点：

1. 用户虽然名字出现过，但是没有有效的消费记录（就是没有on-line，off-line匹配的消费记录），所以应该在输出名字前先检查该用户是否有有效的消费记录。
2. 消费记录匹配后计算费用时，如果on-line，off-line记录跨天，计算时应细心些。最好的方法是计算t1到t2费用时，分别计算00:00:00到t1，t2的花费，然后用两者相减。

#include <bits/stdc++.h>
using namespace std;

typedef struct record
{
	int month,day,hour,minute;
	bool online;
}record;

int hour_cost[24];
map<string,vector<record> > all;

bool cmp(record& r1,record &r2)
{
	return r1.day * 24 * 60 + r1.hour * 60 + r1.minute
			< r2.day * 24 * 60 + r2.hour * 60 + r2.minute;
}

double billFromZero(record call) 
{
	//先计算打一整天需要多少钱 
	double oneday = 0;
	for(int i = 0;i < 24; i++) 
		oneday += hour_cost[i] * 60;
	
	double total = hour_cost[call.hour] * call.minute + oneday * call.day;
	for (int i = 0; i < call.hour; i++)
		total += hour_cost[i] * 60;
	return total;
}

bool hasCost(vector<record>& rc)
{
	//按时间排序 
	sort(rc.begin(),rc.end(),cmp);
	
	for(int i = 1;i < rc.size(); i++)
	{
		if(rc[i-1].online && !rc[i].online)
			return true;
	}
	return false;
}


void calCost(vector<record>& rc)
{
	//检查是否有消费记录时已经排序 
	printf("%02d\n",rc[0].month);
	
	double total = 0.0;
	
	for(int i = 1;i < rc.size(); i++)
	{
		if(rc[i-1].online && !rc[i].online)
		{
			record& r1 = rc[i-1];
			record& r2 = rc[i];
			double cost = 0;
			
			cost = billFromZero(r2) - billFromZero(r1);
			
			printf("%02d:%02d:%02d %02d:%02d:%02d %d $%.2lf\n",
				r1.day,r1.hour,r1.minute,r2.day,r2.hour,r2.minute,r2.day*24*60 +r2.hour*60+r2.minute-(r1.day*24*60+r1.hour*60+r1.minute)
				,cost/100);
			
			total += cost;
			i++;
		}
	}
	printf("Total amount: $%.2lf\n",total/100);
}

int main(int argc, char const *argv[])
{
	for(int i = 0;i < 24; i++)
		cin >> hour_cost[i];
	
	int m;	
	string name,is_online;
	cin >> m;
	
	for(int i = 0;i < m; i++)
	{
		record rc;
		cin >> name;
		scanf("%d:%d:%d:%d",&rc.month,&rc.day,&rc.hour,&rc.minute);
		cin >> is_online;
		if(is_online.compare("on-line") == 0)
			rc.online = true;
		else
			rc.online = false;
		all[name].push_back(rc);
	}
	
	for(auto it = all.begin();it != all.end(); it++)
	{
		if(hasCost((*it).second))
		{
			cout << (*it).first << " ";
			calCost((*it).second);	
		} 
		
	}
	return 0;
}

参考链接：
大佬的解法
表情来源