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. JDOM

    JDOM是什么: To provide a complete, Java-based solution for accessing, manipulating, and outputting XML ...

  2. 移动App双周版本迭代实战--转载备用

    对于移动互联网产品来说,迭代的速度就是生命.我创业时做移动App时是一周一版,而现在是2周1版.相比起小公司,大公司迭代时间虽长,却更为不易,因为大公司流程更多,参与人数更多,需求更多,实现这样的快速 ...

  3. uva_1422 Processor

    题目链接 题意: 有n个任务, 每个任务要在规定的时间[l, r]内完成, 工作量为 w, 每个任务可以分开完成. 求, 使得所有任务都完成的最大速度的最小值. 思路: 最大值最小问题, 二分. 因为 ...

  4. 【原创】Matlab中plot函数全功能解析

    [原创]Matlab中plot函数全功能解析 该帖由Matlab技术论(http://www.matlabsky.com)坛原创,更多精彩内容参见http://www.matlabsky.com 功能 ...

  5. 【技术贴】解决vss中提交pdf下载打开空白乱码

    vss客户端需要安装一个Vss2005的补丁程序,而且之前上传的pdf文件重新删掉,再次上传进Vss中,再下载打卡就ok了. 补丁名称vs80-kb943847-x86-intl.exe 别人的csd ...

  6. 【UVA 10600】 ACM Contest and Blackout(最小生成树和次小生成树)

    [题意] n个点,m条边,求最小生成树的值和次小生成树的值. InputThe Input starts with the number of test cases, T (1 < T < ...

  7. SPRING IN ACTION 第4版笔记-第三章ADVANCING WIRING-003-@Conditional根据条件生成bean及处理profile

    一.用@Conditional根据条件决定是否要注入bean 1. package com.habuma.restfun; public class MagicBean { } 2. package ...

  8. c#调用js,以及js调用C#里的函数, c#自己生成js代码,实现对web的控制

    using mshtml;using System;using System.Collections.Generic;using System.Linq;using System.Security.P ...

  9. android 读写SD卡文件

    参考: http://www.oschina.net/code/snippet_176897_7336#11699 写文件: private void SavedToText(Context cont ...

  10. 查看本机上的端口使用情况netstat -an

    1.查找本机上的端口使用情况 netstat -an 2.查找指定端口的使用情况 C:\Windows\System32>netstat -ano | find "8002" ...