PAT (Advanced Level) 1016. Phone Bills (25) 电话账单
来源:互联网 发布:java jlabel 鼠标事件 编辑:程序博客网 时间:2024/04/30 02:16
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 1010CYLL 01:01:06:01 on-lineCYLL 01:28:16:05 off-lineCYJJ 01:01:07:00 off-lineCYLL 01:01:08:03 off-lineCYJJ 01:01:05:59 on-lineaaa 01:01:01:03 on-lineaaa 01:02:00:01 on-lineCYLL 01:28:15:41 on-lineaaa 01:05:02:24 on-lineaaa 01:04:23:59 off-lineSample Output:
CYJJ 0101:05:59 01:07:00 61 $12.10Total amount: $12.10CYLL 0101:06:01 01:08:03 122 $24.4028:15:41 28:16:05 24 $3.85Total amount: $28.25aaa 0102:00:01 04:23:59 4318 $638.80Total amount: $638.80
结构体排序,字符串转int,转换时直接按照权重计算总和再相减。最后是输出格式控制,要细心。
/*2015.7.20cyq*/#include <iostream>#include <vector>#include <string>#include <algorithm>#include <fstream>using namespace std;//ifstream fin("case1.txt");//#define cin finvector<int> cost; //全局变量struct record{string name;string time;string onOff;record(string a,string b,string c):name(a),time(b),onOff(c){}bool operator < (const record &kk)const{if(name<kk.name)return true;else if(name==kk.name){if(time<kk.time)return true;else if(time==kk.time){if(onOff=="on-line")return true;}}return false;}};struct bill{//单条账单记录string name;string begin;string end;int time;double money;bill(string n,string b,string e,int t,double m):name(n),begin(b),end(e),time(t),money(m){}};double countMoney(const string s1,const string s2,int &time){int d1=(s1[0]-'0')*10+s1[1]-'0';int h1=(s1[3]-'0')*10+s1[4]-'0';int m1=(s1[6]-'0')*10+s1[7]-'0';int d2=(s2[0]-'0')*10+s2[1]-'0';int h2=(s2[3]-'0')*10+s2[4]-'0';int m2=(s2[6]-'0')*10+s2[7]-'0';time=((d2-d1)*24+h2-h1)*60+m2-m1;double money=0;double money1=0;double money2=0;for(int i=0;i<h1;i++)money1+=cost[i]*60;money1+=cost[h1]*m1+cost[24]*d1;for(int j=0;j<h2;j++)money2+=cost[j]*60;money2+=cost[h2]*m2+cost[24]*d2;money=(money2-money1)/100;return money;}int main(){int x;int sum=0;for(int i=0;i<24;i++){cin>>x;sum+=x;cost.push_back(x);}cost.push_back(sum*60);//一天的总费用int N;cin>>N;vector<record> people;string a,b,c;cin>>a>>b>>c;string billMonth=b.substr(0,2);//输入规定在一个月内,先提取月份people.push_back(record(a,b.substr(3,8),c));for(int i=1;i<N;i++){cin>>a>>b>>c;people.push_back(record(a,b.substr(3,8),c));}sort(people.begin(),people.end());//按照姓名和时间排序vector<bill> bills;for(auto it=people.begin()+1;it!=people.end();++it){if((*it).onOff=="off-line"&&(*(it-1)).onOff=="on-line"){//配对if((*it).name==(*(it-1)).name){string s1=(*(it-1)).time;string s2=(*it).time;int t;double m=countMoney(s1,s2,t);//t用引用返回bills.push_back(bill((*it).name,s1,s2,t,m));//压入一条记录}}}if(bills.empty())return 0;string preName;double totalM=0;for(auto it=bills.begin();it!=bills.end();++it){if((*it).name!=preName){//新人if(it!=bills.begin())printf("Total amount: $%0.2f\n",totalM);//前一个人的总费用totalM=0;cout<<(*it).name<<" "<<billMonth<<endl;//新人姓名和月份}preName=(*it).name;cout<<(*it).begin<<" "<<(*it).end<<" "<<(*it).time<<" ";printf("$%0.2f\n",(*it).money);totalM+=(*it).money;}printf("Total amount: $%0.2f\n",totalM);//最后一个人的总费用return 0;}
- PAT (Advanced Level) 1016. Phone Bills (25) 电话账单
- 【PAT Advanced Level】1016. Phone Bills (25)
- 【PAT】【Advanced Level】1016. Phone Bills (25)
- 1016. Phone Bills (25) @ PAT (Advanced Level) Practise
- 1016. Phone Bills (25)——PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise 1016. Phone Bills (25)
- 浙大 PAT Advanced level 1016. Phone Bills (25)
- [PAT甲级]1016. Phone Bills (25)(统计用户每月电话账单)
- PAT (Advanced) 1016. Phone Bills (25)
- PAT (Advanced) 1016. Phone Bills (25)
- PAT (Advanced Level) Practise 1016 Phone Bills (25)
- PAT (Advanced Level) Practise 1016 Phone Bills (25)
- Pat(Advanced Level)Practice--1016(Phone Bills)
- 1016. Phone Bills (25) 电话费账单结账
- 1016. Phone Bills (25)-PAT
- PAT 1016. Phone Bills (25)
- 【PAT】1016. Phone Bills (25)
- PAT 1016. Phone Bills (25)
- apue《UNIX环境高级编程第三版》第二章答案详解
- hadoop MapReduce - 从作业、任务(task)、管理员角度调优
- ArcGIS教程:Iso 聚类
- find_scratches_bandpass_fft.hdev相关例程学习
- linux内核内存的详细分配
- PAT (Advanced Level) 1016. Phone Bills (25) 电话账单
- Search in Rotated Sorted Array
- Online Judge System For SzNOI 题库 语法百题 C++ d002
- java中keytool生成的jks证书转换为openssl格式证书
- delphi编码
- 网站采取黑白配色的方法
- Java对PHP服务器hmac_sha1签名认证方法的匹配实现
- 堆排序
- 探秘Java中String、StringBuilder以及StringBuffer