PAT 1016. Phone Bills
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的更多相关文章
- PAT 1016 Phone Bills[转载]
1016 Phone Bills (25)(25 分)提问 A long-distance telephone company charges its customers by the followi ...
- PAT 1016 Phone Bills(模拟)
1016. Phone Bills (25) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue A long-di ...
- PAT甲级1016. Phone Bills
PAT甲级1016. Phone Bills 题意: 长途电话公司按以下规定向客户收取费用: 长途电话费用每分钟一定数量,具体取决于通话时间.当客户开始连接长途电话时,将记录时间,并且客户挂断电话时也 ...
- 1016. Phone Bills (25)——PAT (Advanced Level) Practise
题目信息: 1016. Phone Bills (25) 时间限制 400 ms 内存限制 32000 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue A l ...
- PAT 甲级 1016 Phone Bills (25 分) (结构体排序,模拟题,巧妙算时间,坑点太多,debug了好久)
1016 Phone Bills (25 分) A long-distance telephone company charges its customers by the following r ...
- PAT 1016
1016. Phone Bills (25) A long-distance telephone company charges its customers by the following rule ...
- 1016 Phone Bills (25 分)
1016 Phone Bills (25 分) A long-distance telephone company charges its customers by the following rul ...
- PAT A 1016. Phone Bills (25)【模拟】
题目:https://www.patest.cn/contests/pat-a-practise/1016 思路:用结构体存储,按照名字和日期排序,然后先判断是否有效,然后输出,时间加减直接暴力即可 ...
- PAT (Advanced Level) 1016. Phone Bills (25)
简单模拟题. #include<iostream> #include<cstring> #include<cmath> #include<algorithm& ...
随机推荐
- HTML 中<style>中</style>里面<!-- -->标签是干嘛的
baidu:没什么用,这个主要是针对低版本的浏览器<!-- -->是html的注释标签,高版本的浏览器会识别<style>标签是样式表,并忽略里面的html注释标签,会解析它, ...
- 头文件的宏定义#ifndef测试
一.入题 在头文件的书写中,都加入了如下内容: #ifndef __头文件名_H #define __头文件名_H #endif 曾经在书中看到的解释是“防止重复定义”,今天突然想到为什么是这样的解释 ...
- Java 泛型快速排序 以sdut 1196为例
oj链接:http://acm.sdut.edu.cn/sdutoj/problem.php?action=showproblem&problemid=1196 Java中,Arrays.so ...
- 【web安全】第四弹:防火墙技术笔记
参考资料: <黑客攻防演习>第二版 Ed SKoudis Tom Liston著 <防火墙.入侵检测与VPN> 马春光 郭方方著 OSI在理论上将网络分为七层,物理层.数 ...
- 三菱plc输出指示灯不亮怎么办(转载)
三菱plc输出指示灯不亮怎么办?三菱plc输出指示灯故障 时间:2015-10-21 07:31:12编辑:电工栏目:三菱plc 导读:三菱plc输出指示灯不亮故障的原因,三菱plc在使用中出现输出指 ...
- 转:Nginx 日志文件切割
http://www.cnblogs.com/benio/archive/2010/10/13/1849935.html 偶然发现access.log有21G大,所以将其切割. Nginx 是一个非常 ...
- UNIX网络编程——套接字选项
http://www.educity.cn/linux/1241288.html 有时候我们需要控制套接字的行为(如修改缓冲区的大小),这个时候我们就要学习套接字选项. int getsockopt( ...
- Perl脚本学习经验(四)--Perl中sftp的使用
使用sftp,需要使用Except模块,该模块需要下载安装在perl目录下,可以上http://www.cpan.org/上下载对应的安装包:1. 用root用户登录环境:2. cd /usr/lib ...
- 17.1.1.4 Obtaining the Replication Master Binary Log Coordinates 得到复制master binary log 位置:
17.1.1.4 Obtaining the Replication Master Binary Log Coordinates 得到复制master binary log 位置: 你需要master ...
- c++ lambda返回类型自动推导的一些需要注意的地方
一句话,lambda返回类型自动推导走的是auto,而不是decltype,注意. class ObjectA { public: ObjectA() { val_ = ++g; } ObjectA( ...