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

---

本次的重要思想在于先将按人进行分块，以及如何计算话费。

---

#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
float toll[25]; 
struct node{
    string name;
    int mo,dd,hh,mi;
    bool on;
    node(){
        cin>>name;
        scanf("%d:%d:%d:%d",&mo,&dd,&hh,&mi);
        string s;
        cin>>s;
        if(s[1]=='n') on=true;
        else on=false;
    }
    float cost(node b){
        int t1=b.mi+b.hh*60+b.dd*1440;
        int tm=mi,th=hh,td=dd;
        int t2=tm+th*60+td*1440;
        int time =t1-t2;
        float cost=0;
        while(tm!=b.mi||th!=b.hh||td!=b.dd){
            if(tm==60) {tm=0,th++;}
            if(th==24){th=0,td++;}
            if(th!=b.hh||b.dd!=td){
                cost+=toll[th]*(60-tm);
                tm=0;
                th++;
                continue;
            }
            else {
                    cost+=toll[th]*(b.mi-tm);
                    tm=b.mi;
                    break;
            }
        }
        cost/=100.0;
        printf("%02d:%02d:%02d %02d:%02d:%02d %d $%.2f\n",dd,hh,mi,b.dd,b.hh,b.mi,time,cost);
        return cost;
    }
};
vector<node> record;
bool cmp(node a,node b){
    if(a.name!=b.name) return a.name<b.name;
    if(a.mo!=b.mo) return a.mo<b.mo;
    if(a.dd!=b.dd) return a.dd<b.dd;
    if(a.hh!=b.hh) return a.hh<b.hh;
    else return a.mi<b.mi;
}
int main(){
    int t;
    for(int i=0;i<24;i++){
        cin>>toll[i];
    }
    int n;
    cin>>n;
    for(int i=0;i<n;i++){
        record.push_back(node());
    }
    sort(record.begin(),record.end(),cmp);
    string tname;
    bool find=false;
    float total=0;
    for(int i=0;i<record.size()-1;i++){
        if(!record[i].on) continue;
        if(record[i].name!=tname){
            if(find){//结束本次匹配，存在对话
                printf("Total amount: $%.2f\n",total);
                find=false;
            }
            total=0;
            tname=record[i].name;
        }
        while(i<record.size()-1&&record[i+1].name==tname&&record[i+1].on){//定位连续多个on中最后一个on
            i++;
        }
        if(i==record.size()-1) break;
        if(record[i+1].name==tname&&!record[i+1].on){//如果下一个是对应的off
            if(!find){
                cout<<tname<<" ";printf("%02d\n",record[i].mo);//第一个匹配项 
            }
            total+=record[i].cost(record[i+1]);
            find=true;//存在匹配
        }
    }
    if(find)
            printf("Total amount: $%.2f\n",total);
    return 0;
}