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
解题思路：
这道题目主要可以分解为三个问题：
1.电话信息“on”和“off”的匹配，这个只要按照名字从小到大，再按照时间从小到大排序，最后前后两个比较是不是一个on一个off即可。因为off时间早于on的一定是无效的。
2.钱的计算问题。有两个方法，一个是以on的时间为起点，一分钟一分钟地加到off的时间，每个小时都要加个if；另一个是从柳神那里学来的，就是把所有计费都从月初的00：00：00：00开始，客户的实际消费就是off的时间减去on的时间。
3.第一次信息输出时需要带上名字和月份，最后一次输出要有Total amount。所以这里需要有一个判断。
易错点：
1. 测试点1：无效的数据不用输出，而不是不输出消费为0的。例如下面的数据虽然消费为0，但是符合一个on一个off的仍旧需要输出，但如果是两个on或者两个off则输出为空：
输入：
CYY 01：02：01：01 on-line
CYY 01：02：01：01 off-line
输出：
CYY 01
01：02：01：01 01：02：01：01 0 $0
Total amount: $0
2. 同一天的不同小时，同一小时的不同天的花费计算可能会出错，建议使用柳神的计算方式，那个又简单又不容易错。
代码：
AC代码如下：
#include<bits/stdc++.h>
using namespace std;
int rate[25];//存储24小时内的电话消费，rate【24】存储一天的消费
int N;
typedef struct Phone{
string name;
int MM,DD,HH,mm,time;//time用来把所有时间换算成分钟
int turn;
};
bool cmp(Phone a,Phone b){//名字从小到大排序，名字相同按时间从小到大
if(a.name!=b.name) return a.name<b.name;
return a.time<b.time;
}
double billfromzero(Phone call) {
//从月初开始计费，开始与结束时间的话费差就是需要的费用
double total = rate[call.HH] * call.mm + rate[24] * 60 * call.DD;
for (int i = 0; i < call.HH; i++) {
total += rate[i] * 60;
}
total /= 100.0;
return total;
}
int main(){
for(int i=0;i<24;i++){
cin>>rate[i];
rate[24]+=rate[i];
}
cin>>N;
vector<Phone> P(N);
for(int i=0;i<N;i++){
cin>>P[i].name;
scanf("%d:%d:%d:%d",&P[i].MM,&P[i].DD,&P[i].HH,&P[i].mm);
string a;
cin>>a;
P[i].turn=(a=="on-line") ? 1:0;//“on-line”为1，“off-line”为0
P[i].time = P[i].DD*24*60+P[i].HH*60+P[i].mm;//换算成min为单位
}
sort(P.begin(),P.end(),cmp);
map<string,vector<Phone>> m;
for(int i=1;i<N;i++){
if(P[i].name == P[i-1].name&&P[i-1].turn==1&&P[i].turn==0){
m[P[i-1].name].push_back(P[i-1]);
m[P[i-1].name].push_back(P[i]);
}
}
for(auto it : m){
vector<Phone> temp = it.second;
cout<<it.first;
printf(" %02d\n",temp[0].MM);
double tol=0;
for(int i=1;i<temp.size();i+=2){
double money = billfromzero(temp[i])-billfromzero(temp[i-1]);
printf("%02d:%02d:%02d %02d:%02d:%02d %d $%.2f\n",temp[i-1].DD,temp[i-1].HH,temp[i-1].mm,temp[i].DD,temp[i].HH,temp[i].mm,temp[i].time-temp[i-1].time,money);
tol+=money;
}
printf("Total amount: $%.2f\n",tol);
}
return 0;
}代码参考了柳神，我自己一开始写的只能过测试点0（甚至找不到为什么错，也贴在下面，如果你感兴趣的话可以帮我原来的代码找找问题呀！）
只过了测试点0的原始代码：
#include<bits/stdc++.h>
using namespace std;
int time_m[24];//存储24小时内，每个小时对应的话费
int N;
map<string,int> name;//存储这个客户是否需要输出
map<string,double> name_m;//存储客户的总花费
typedef struct Phone{//定义一个结构来存储每一电话信息
string name;
int MM,DD,HH,mm;
int turn; //turn==1代表on_line；turn==0代表off_line
};
void read(){//读取24小时的话费
for(int i=0;i<24;i++){
cin>>time_m[i];
}
}
bool cmp(Phone a,Phone b){
//按照名字从小到大，名字相同时，按照时间从小到大排序
if(a.name<b.name) return true;
else if(a.name==b.name&&a.DD<b.DD) return true;
else if(a.name==b.name&&a.DD==b.DD&&a.HH<b.HH) return true;
else if(a.name==b.name&&a.DD==b.DD&&a.HH==b.HH&&a.mm<b.mm) return true;
return false;
}
int main(){
read();
cin>>N;
Phone P[N];
for(int i=0;i<N;i++){
cin>>P[i].name;
name[P[i].name]=0;
name_m[P[i].name]=0;
scanf("%d:%d:%d:%d",&P[i].MM,&P[i].DD,&P[i].HH,&P[i].mm);
string a;
cin>>a;
if(a=="on-line") P[i].turn=1;
else if(a=="off-line") P[i].turn=0;
}
sort(P,P+N,cmp);
for(int i=1;i<N;i++){
if(P[i].name==P[i-1].name&&P[i].turn==0&&P[i-1].turn==1&&name[P[i].name]==0){
name[P[i].name]=1;
cout<<P[i].name<<" ";
printf("%02d\n",P[i].MM);
printf("%02d:%02d:%02d %02d:%02d:%02d ",P[i-1].DD,P[i-1].HH,P[i-1].mm,P[i].DD,P[i].HH,P[i].mm);
int tol=(P[i].DD-P[i-1].DD)*24*60+(P[i].HH-P[i-1].HH)*60+P[i].mm-P[i-1].mm;
double money=0;
if(P[i-1].DD==P[i].DD){
if(P[i-1].HH!=P[i].HH){
for(int j=P[i-1].HH;j<P[i].HH;j++){
if(j==P[i-1].HH) money+=(60-P[i-1].mm)*time_m[j];
else money+=60*time_m[j];
}
money+=P[i].mm*time_m[P[i].HH];
}
else{
money+=(P[i].mm-P[i-1].mm)*time_m[P[i].HH];
}
}
else{
for(int j=P[i-1].DD;j<P[i].DD;j++){
for(int k=P[i-1].HH;k<24;k++){
if(k==P[i-1].HH&&j==P[i-1].DD) money+=(60-P[i-1].mm)*time_m[k];
else money+=60*time_m[k];
}
}
for(int j=0;j<P[i].HH;j++){
money+=60*time_m[j];
}
money+=P[i].mm*time_m[P[i].HH];
}
name_m[P[i].name]+=money;
cout<<tol<<" "<<"$";
printf("%.2f\n",money/100);
}
else if(P[i].name==P[i-1].name&&P[i].turn==0&&P[i-1].turn==1&&name[P[i].name]==1){
printf("%02d:%02d:%02d %02d:%02d:%02d ",P[i-1].DD,P[i-1].HH,P[i-1].mm,P[i].DD,P[i].HH,P[i].mm);
int tol=(P[i].DD-P[i-1].DD)*24*60+(P[i].HH-P[i-1].HH)*60+P[i].mm-P[i-1].mm;
double money = 0;
if(P[i-1].DD==P[i].DD){
if(P[i-1].HH!=P[i].HH){
for(int j=P[i-1].HH;j<P[i].HH;j++){
if(j==P[i-1].HH) money+=(60-P[i-1].mm)*time_m[j];
else money+=60*time_m[j];
}
money+=P[i].mm*time_m[P[i].HH];
}
else{
money+=(P[i].mm-P[i-1].mm)*time_m[P[i].HH];
}
}
else{
for(int j=P[i-1].DD;j<P[i].DD;j++){
for(int k=P[i-1].HH;k<24;k++){
if(k==P[i-1].HH&&j==P[i-1].DD) money+=(60-P[i-1].mm)*time_m[k];
else money+=60*time_m[k];
}
}
for(int j=0;j<P[i].HH;j++){
money+=60*time_m[j];
}
money+=P[i].mm*time_m[P[i].HH];
}
name_m[P[i].name]+=money;
cout<<tol<<" "<<"$";
printf("%.2f\n",money/100);
}
if((P[i].name!=P[i-1].name&&name[P[i-1].name]!=0)||(i==N-1&&name[P[i].name]!=0)){
cout<<"Total amount: $";
printf("%.2f\n",name_m[P[i-1].name]/100);
}
}
return 0;
}
633
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
