PAT (Advanced Level) Practice

1016 Phone Bills (25)（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

/*
原来他只会显示一个月的账单，不存在有两个月的
用node存输入数据，建立一个vector存node，排好序，建立map把对应数据存到名字下（开始跟着挂断时间）
用auto建立迭代器，循环map
*/
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<vector>
#include<map>
using namespace std;
struct node{
    string name;
    int status,time,month,day,hour,minute;
};
 
bool cmp(node a,node b){
    return a.name != b.name ? a.name < b.name :a.time < b.time;
}
double charge(node call, int *rate) {   //操作的是传入的这一个node
    double total = rate[call.hour] * call.minute + rate[24] * 60 * call.day;
    for (int i = 0; i < call.hour; i++)
        total += rate[i] * 60;
    return total / 100.0;    //把所有花费算出来再减
}
 
int main(){
    int rate[25]={0},n;
    for(int i=0;i<24;i++){
        scanf("%d",&rate[i]);
        rate[24] += rate[i];
    }
    scanf("%d",&n);
    vector<node> data(n);
    for(int i=0;i<n;i++){
        cin>>data[i].name;
        scanf("%d:%d:%d:%d",&data[i].month,&data[i].day,&data[i].hour,&data[i].minute);
        string temp;
        cin>>temp;
        data[i].status=(temp=="on-line")?1:0;
        data[i].time=data[i].day*24*60+data[i].hour*60+data[i].minute;
    }
    sort(data.begin(),data.end(),cmp);
    map<string,vector<node> > custom;
    for(int i=1;i<n;i++){                    //打完一个电话之前是不会再打另一个电话的，所以数据是有规律的
        if(data[i].name==data[i-1].name&&data[i].status==0&&data[i-1].status==1){
            custom[data[i-1].name].push_back(data[i-1]);       //把data存到data.name里，先存i-1；
            custom[data[i].name].push_back(data[i]);           //相同的的信息存在一个name里
        }
    }
    //for(auto it=std::begin(custom);it!=std::end(custom);it++){
    for(auto it:custom){            //这个是值传递，上句是it是迭代器
        vector<node> temp=it.second;   //这个map的first是string，second是vector，应该很好理解
        cout<<it.first;
        printf(" %02d\n",temp[0].month);
        double total=0.0;
        for(int i=1;i<temp.size();i+=2){
            double t=charge(temp[i],rate)-charge(temp[i-1],rate);
            printf("%02d:%02d:%02d %02d:%02d:%02d %d $%.2f\n", temp[i - 1].day, temp[i - 1].hour, temp[i - 1].minute, temp[i].day, temp[i].hour, temp[i].minute, temp[i].time - temp[i - 1].time, t);
            total += t;
        }
        printf("Total amount: $%.2f\n", total);
    }
    return 0;
}