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
// 1016pat.cpp : 定义控制台应用程序的入口点。
// #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <string>
#include <iomanip>
using namespace std; struct Call
{
string name;
int month;
int day;
int hour;
int minute;
int total;
string status;
bool operator<(const Call& rhs) const
{
if(name==rhs.name)
return total<rhs.total;
else
return name<rhs.name;
}
}; map<int,int> toll; int calByTime(int time)
{
int hours=time/;
int minute=time%;
int money=;
int i;
for(i=;i<hours;++i)
money+=toll[i%]*;
money+=minute*toll[i%];
return money;
} double calCost(const Call& s,const Call& t)
{
return (double)(calByTime(t.total)-calByTime(s.total))/100.0;
} int calLast(const Call& s,const Call& t)
{
return (t.day-s.day)**+(t.hour-s.hour)*+(t.minute-s.minute);
} int main()
{
int tmp;
for(int i=;i<;++i)
{
cin>>tmp;
toll[i]=tmp;
}
int n;
cin>>n;
Call call;
vector<Call> all_calls;
vector<Call> format_calls;
char c;
while(n--)
{
cin>>call.name;
cin>>call.month;
cin>>c;
cin>>call.day;
cin>>c;
cin>>call.hour;
cin>>c;
cin>>call.minute;
call.total=**call.day+*call.hour+call.minute;
cin>>call.status;
all_calls.push_back(call);
}
sort(all_calls.begin(),all_calls.end()); //delete the dirty data;
bool hasonline=false;
string curname=" ";
for(vector<Call>::iterator iter=all_calls.begin();iter!=all_calls.end();++iter)
{
if(hasonline==false&&iter->status=="on-line")
{
hasonline=true;
curname=iter->name;
format_calls.push_back(*iter);
}
else if(hasonline==true&&iter->status=="on-line")
{
format_calls.pop_back();
format_calls.push_back(*iter);
curname=iter->name;
}
else if(hasonline==true&&iter->status=="off-line"&&curname==iter->name)
{
format_calls.push_back(*iter);
hasonline=false;
}
}
if((format_calls.end()-)->status=="on-line")
format_calls.pop_back(); //output the result;
curname=" ";
double total=0.0;
double fee;
for(vector<Call>::iterator iter=format_calls.begin();iter!=format_calls.end();++iter,++iter)
{
if(iter->name!=curname)
{
if(curname!=" ")
{
cout<<"Total amount: $"<<fixed<<setprecision()<<total<<endl;
total=0.0;
cout<<iter->name<<" "<<setfill('')<<setw()<<iter->month<<endl;
}
else
{
cout<<iter->name<<" "<<setfill('')<<setw()<<iter->month<<endl;
}
curname=iter->name;
}
cout<<setfill('')<<setw()<<iter->day<<":"<<setfill('')<<setw()<<iter->hour<<":"<<setfill('')<<setw()<<iter->minute<<" ";
cout<<setfill('')<<setw()<<(iter+)->day<<":"<<setfill('')<<setw()<<(iter+)->hour<<":"<<setfill('')<<setw()<<(iter+)->minute<<" ";
cout<<calLast(*iter,*(iter+))<<" ";
fee=calCost(*iter,*(iter+));
cout<<"$"<<fixed<<setprecision()<<fee<<endl;;
total+=fee;
}
cout<<"Total amount: $"<<fixed<<setprecision()<<total<<endl;
return ;
}

PAT 1016. Phone Bills的更多相关文章

  1. PAT 1016 Phone Bills[转载]

    1016 Phone Bills (25)(25 分)提问 A long-distance telephone company charges its customers by the followi ...

  2. PAT 1016 Phone Bills(模拟)

    1016. Phone Bills (25) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue A long-di ...

  3. PAT甲级1016. Phone Bills

    PAT甲级1016. Phone Bills 题意: 长途电话公司按以下规定向客户收取费用: 长途电话费用每分钟一定数量,具体取决于通话时间.当客户开始连接长途电话时,将记录时间,并且客户挂断电话时也 ...

  4. 1016. Phone Bills (25)——PAT (Advanced Level) Practise

    题目信息: 1016. Phone Bills (25) 时间限制 400 ms 内存限制 32000 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue A l ...

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

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

  6. PAT 1016

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

  7. 1016 Phone Bills (25 分)

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

  8. PAT A 1016. Phone Bills (25)【模拟】

    题目:https://www.patest.cn/contests/pat-a-practise/1016 思路:用结构体存储,按照名字和日期排序,然后先判断是否有效,然后输出,时间加减直接暴力即可 ...

  9. PAT (Advanced Level) 1016. Phone Bills (25)

    简单模拟题. #include<iostream> #include<cstring> #include<cmath> #include<algorithm& ...

随机推荐

  1. MAC 终端快捷建

    常用的快捷键: Ctrl + d        删除一个字符,相当于通常的Delete键(命令行若无所有字符,则相当于exit:处理多行标准输入时也表示eof) Ctrl + h        退格删 ...

  2. yum使用详细

    1.使用YUM查找软件包 命令:yum search~ 2.列出所有可安装的软件包 命令:yum list 3.列出所有可更新的软件包 命令:yum list updates 4.列出所有已安装的软件 ...

  3. 学一点 mysql 双机异地热备份----快速理解mysql主从,主主备份原理及实践

    双机热备的概念简单说一下,就是要保持两个数据库的状态 自动同步.对任何一个数据库的操作都自动应用到另外一个数据库,始终保持两个数据库数据一致. 这样做的好处多. 1. 可以做灾备,其中一个坏了可以切换 ...

  4. linux安装ruby ruby-devel rubygems bundler

    linux安装ruby ruby-devel rubygems yum install ruby ruby-devel rubygems 安装bundler gem install bundleror ...

  5. zzuli oj 1167逆转数(指针专题)

    Description 任意给你一个整数,这个数可能很大(最长不超过100位),你能求出它的逆转数吗?  逆转数定义如下:  1.一个末尾没有0的整数,它的逆转数就是各位数字逆序输出:  2.一个负数 ...

  6. 基于u-boot源码的简单shell软件实现

    一.概述 1.shell概念 Shell(命令解析器),它用于接收用户输入的命令,进行解析,然后调用相应的应用程序,为使用者提供了使用软件的界面. shell是操作系统最外面的一层.shell管理你与 ...

  7. MVC页面上多个提交按钮提交到不同的Action

    使用mvc扩展类,ActionNameAttribute方法如下: [AttributeUsage(AttributeTargets.Method, AllowMultiple = false, In ...

  8. 关于 jquery.showLoading 中 出现的 图标不在页面中间的问题

    很多人喜欢 showLoading   因为 这个实在是太简单了直接 showLoading() hideLoading() 就可以解决这个问题. 今天我们就来看一下  这个插件里面的一个错误 或者说 ...

  9. mvc4 membership, [Win32Exception (0x80004005): The system cannot find the file specified]

    public class UsersContext : DbContext { public UsersContext() : base("conn1") //change the ...

  10. java 集合(二)

    1.练习题 如果输入的字符里有非英语字母的,不给于执行