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.没有配对的用户不能输出(测试点3)。needPrint
2.名字必须相同(测试点2)。rec[j].name==rec[j+1].name
#include<bits/stdc++.h>
using namespace std; const int maxn=100010; struct Record{
string name;
int month;
int day;
int hh;
int mm;
int flag;
string status;
}; Record rec[maxn]; int rate[24];
int n; bool cmp(Record a,Record b){
if(a.name!=b.name)
return a.name<b.name;
else if(a.month!=b.month)
return a.month<b.month;
else if(a.day!=b.day)
return a.day<b.day;
else if(a.hh!=b.hh)
return a.hh<b.hh;
else
return a.mm<b.mm; } void print(){
for(int i=0;i<n;i++){
cout<<rec[i].name<<" "<<rec[i].month<<":"<<rec[i].day<<":"<<rec[i].hh<<":"<<rec[i].mm
<<" "<<rec[i].status<<" "<<rec[i].flag<<endl;
}
} int Calculate(int dd1,int hh1,int mm1,int dd2,int hh2,int mm2,int& count){
int money=0; while(dd1<dd2||hh1<hh2||mm1<mm2){ count++; mm1++; money+=rate[hh1]; if(mm1==60){
hh1++;
mm1=0;
} if(hh1==24){
dd1++;
hh1=0;
} } return money; } int main(){ for(int i=0;i<24;i++)
cin>>rate[i]; cin>>n; char c; Record temp; for(int i=0;i<n;i++){
cin>>temp.name>>temp.month>>c>>temp.day>>c>>temp.hh>>c>>temp.mm
>>temp.status; if(temp.status=="on-line")
temp.flag=1;
else
temp.flag=2; rec[i]=temp; } sort(rec,rec+n,cmp); // print(); // int count1=0;
// int money1=Calculate(rec[7].day,rec[7].hh,rec[7].mm,rec[8].day,rec[8].hh,rec[8].mm,count1); // cout<<count1<<" "<<money1<<endl; int left=0,right=0; while(left<n){ while(right<n&&rec[left].name==rec[right].name)
right++; if(right!=n-1)
right--; bool needPrint=false; for(int j=left;j<right;j++){
if(rec[j].flag==1&&rec[j+1].flag==2&&rec[j].name==rec[j+1].name){
needPrint=true;
break;
} } if(needPrint){
cout<<rec[left].name<<" ";
printf("%02d\n",rec[left].month);
}else{
left=right+1;
right=left;
continue;
} double total=0; for(int i=left;i<=right-1;i++){
if(rec[i].flag==1&&rec[i+1].flag==2&&rec[i].name==rec[i+1].name){ int money=0,count=0; money=Calculate(rec[i].day,rec[i].hh,rec[i].mm,
rec[i+1].day,rec[i+1].hh,rec[i+1].mm,count); total+=money; printf("%02d:%02d:%02d %02d:%02d:%02d %d $%.2f\n",rec[i].day,rec[i].hh,rec[i].mm,
rec[i+1].day,rec[i+1].hh,rec[i+1].mm,count,(double)money/100.0); }
} printf("Total amount: $%.2f\n",total/100.0); left=right+1;
right=left; } return 0;
}

  


A1016 Phone Bills (25 分)的更多相关文章

  1. A1016 Phone Bills (25)(25 分)

    A1016 Phone Bills (25)(25 分) A long-distance telephone company charges its customers by the followin ...

  2. PAT 甲级 1016 Phone Bills (25 分) (结构体排序,模拟题,巧妙算时间,坑点太多,debug了好久)

    1016 Phone Bills (25 分)   A long-distance telephone company charges its customers by the following r ...

  3. PAT A1016 Phone Bills (25)

    题目描述 A long-distance telephone company charges its customers by the following rules: Making a long-d ...

  4. 1016 Phone Bills (25 分)

    A long-distance telephone company charges its customers by the following rules: Making a long-distan ...

  5. 1016 Phone Bills (25分)

    复建的第一题 理解题意 读懂题目就是一个活,所以我们用观察输出法,可以看出来月份,以及时间和费用之间的关系. 定义过程 然后时间要用什么来记录呢?day hour minute 好麻烦呀..用字符串吧 ...

  6. 【PAT甲级】1016 Phone Bills (25 分)(结构体排序)

    题意: 输入24个正整数代表从0到23每个小时通话一分钟花费的美分.输入一个正整数N(<=1000),然后输入N组字符串,每个字符串包含客户的名字和通话的时刻以及打出或者挂断的状态. 按照字典序 ...

  7. 1016 Phone Bills (25 分)

    1016 Phone Bills (25 分) A long-distance telephone company charges its customers by the following rul ...

  8. PTA - - 06-图1 列出连通集 (25分)

    06-图1 列出连通集   (25分) 给定一个有NN个顶点和EE条边的无向图,请用DFS和BFS分别列出其所有的连通集.假设顶点从0到N-1N−1编号.进行搜索时,假设我们总是从编号最小的顶点出发, ...

  9. 中国大学MOOC-陈越、何钦铭-数据结构-2015秋 01-复杂度2 Maximum Subsequence Sum (25分)

    01-复杂度2 Maximum Subsequence Sum   (25分) Given a sequence of K integers { N​1​​,N​2​​, ..., N​K​​ }. ...

随机推荐

  1. Core Dump总结

    Core Dump总结 查看现在系统dump core的情况 ulimit -c 结果表示core文件的大小.如果显示0,则不会dump core,显示unlimited不限制core文件大小 打开d ...

  2. Shell基本正则表达式和扩展正则表达式

    BRE和ERE的区别 基本正则表达式(BRE)和扩展正则表达式(ERE)的区别仅仅是元字符(meta charactor)的区别而已. BRE: 只有^$.*[]是元字符 ERE: ^$.[]*+() ...

  3. C++——类

    1.类和结构体,只有的默认访问权限的区别 2.类内不能定义和类外类型名相同的类型名.为什么?typedef机制? typedef double money; class Account { priva ...

  4. python:异常处理及程序调试

    1.异常概述 在程序运行过程中,经常会遇到各种各样的错误.这些错误统称为“异常”,在这些一场中有的是由于开发者将关键词写错导致,这类错误产生的是SyntaxError.invalid syntax(无 ...

  5. 梯度提升树GBD

    转自 http://blog.csdn.net/u014568921/article/details/49383379 另外一个很容易理解的文章 :http://www.jianshu.com/p/0 ...

  6. 常用css3属性的ie兼容查看

    记录一下关于css3的各种常用属性对ie各版本浏览器的兼容程度: 最低可兼容ie7 最低可兼容ie8 最低可兼容ie9 最低可兼容ie10 position:fixed clip E:first-le ...

  7. 42-Ubuntu-用户管理-07-修改权限命令介绍

    修改文件权限 序号 命令 作用 01 chown 修改文件/目录拥有者 02 chgrp 修改文件/目录所在主组 03 chmod 修改文件/目录权限   chmod   chown chgrp   ...

  8. 2014 ACM-ICPC Vietnam National First Round

    Contest Link easy: ABDGIJ medium-easy: E medium: H medium-hard: CF A. Cool number 各数位之和不大,枚举即可. E. B ...

  9. velocity 相关

    Apache Velocity 是一个基于java的模板引擎(template engine) 应用场景1.Web 应用:开发者在不使用 JSP 的情况下,可以用 Velocity 让 HTML 具有 ...

  10. Flatty Shadow图标自动产生器——在线生成各种扁平化 ICON

    在扁平化风格越来越流行的今天,网页.软件界面和图标的设计大都采用了扁平化风格.特别是扁平化图标的设计,摒弃了一切3D元素的设计,阴影.纹理.透视神马的统统不要,让图标简洁高效,富有现代感. 今天给大家 ...