1016 Phone Bills (25)(25 分)提问

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

//看见这种这么长的题目,都不想看,又是字符串处理和模拟仿真的题目,啊!

输出每月的电话费。每一个测试用例都是在同一月份。

输入:24小时每小时的长途话费单价(美分/分钟)

人名 时间 上线/下线    说明:如果一个on-line没有off-line匹配,那么就忽略,off-line也是如此,

输出:按字典序的人名,月份 使用时间段及每段花费,总费用。

//代码来自:https://blog.csdn.net/ysq96/article/details/80438014

#include <iostream>
#include <map>
#include <vector>
#include <algorithm>
#include <string>
#include <cstdio>
using namespace std; struct customer
{
customer(){
this->month=;
this->dd=;
this->hh=;
this->mm=;
}
string name;//名字
int month,dd,hh,mm;//月 天 时 分
bool status;
}; bool cmp(customer a, customer b){
int x = a.name.compare(b.name);
if(x!=){
return x<;//首先按照名字字母排序
}else if(a.month!=b.month)
{//再按照月份排序
return a.month<b.month;
}else if (a.dd!=b.dd)
{//再按照号
return a.dd<b.dd;
}else if(a.hh!=b.hh){//再按照小时
return a.hh<b.hh;
}else
{//再按照分钟
return a.mm<b.mm;
}
}
int prize[];
double get_ans(customer a, customer b,int& time){
int money=;
while (a.dd>b.dd||a.hh>b.hh||a.mm>b.mm)
{
time++;
money+=prize[b.hh];
b.mm++;
if (b.mm>=)
{
b.mm=;
b.hh++;
}
if (b.hh>=)
{
b.hh=;
b.dd++;
}
}
return money/100.0;
}
int main(){
for (int i=;i<;i++)
{
cin>>prize[i];
}
int n;
string name,status;
int month,dd,hh,mm;
cin>>n;
vector<customer> data(n);
for(int i=;i<n;i++){
cin>>name;
scanf("%d:%d:%d:%d",&month,&dd,&hh,&mm);//可以这样按照格式输入!,那就不用处理字符串了!
cin>>status;
data[i].name=name;
data[i].month=month;
data[i].dd=dd;
data[i].hh=hh;
data[i].mm=mm;
if(status.compare("on-line")==){
data[i].status=true;//开始标记为true;
}else
{
data[i].status=false;
}
}
sort(data.begin(),data.end(),cmp);
//先读取第一个人
customer temp;
temp=data[];
int on=-,off;
bool flag=false;
if (temp.status)
{
on=;
}
double total=0.0;
for (int i=;i<n;i++)
{ if (data[i].name.compare(temp.name)==)//若此数据名字和上一个数据相同
{
if (data[i].status)
{
on=i;//记录on下标
}else
{
off=i;//记录off下标
}
if (off==on+)//若此数据为off 上一个数据为on,如果没有符合的话,那么就什么也不输出。
{
if (!flag)
{
cout<<data[i].name<<" ";
printf("%02d\n",data[i].month);//注意这里的输出格式!
flag=true;
}
int time=;
double bills=0.0;
bills=get_ans(data[i],temp,time);
total += bills;
printf("%02d:%02d:%02d %02d:%02d:%02d",temp.dd,temp.hh,temp.mm,data[i].dd,data[i].hh,data[i].mm);
cout<<" "<<time;
printf(" $%.2f\n",bills);
}
}else{
if (flag)
{
printf("Total amount: $%.2f\n",total);
flag=false;
total=0.0;
} }
temp=data[i];
if (data[i].status)
{
on=i;//记录on下标
}else
{
off=i;//记录off下标
}
if (i==n-)
{
if (flag)
{
printf("Total amount: $%.2f\n",total);
}
}
}
return ;
}

//相当厉害!

//经过测试用例表明,如果有多个on,只有一个off,那么就和最接近off的配对。

如果测试用例如下:


CYLL ::: on-line
CYLL ::: on-line
CYLL ::: off-line
CYLL ::: off-line

那么输出:

CYLL
:: :: $0.40
Total amount: $0.40

也就是说,如果有多个,第一个on和最后一个off就不匹配了。按时间排序之后,如果当前是on,下一个还是on,那么当前的on就会被抛弃。

PAT 1016 Phone Bills[转载]的更多相关文章

  1. PAT 1016 Phone Bills(模拟)

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

  2. PAT 1016. Phone Bills

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

  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甲题题解-1016. Phone Bills (25)-模拟、排序

    博主欢迎转载,但请给出本文链接,我尊重你,你尊重我,谢谢~http://www.cnblogs.com/chenxiwenruo/p/6789229.html特别不喜欢那些随便转载别人的原创文章又不给 ...

随机推荐

  1. 【转】 编写C#调用的C++DLL

    最近一段时间,经常遇到这些问题,前一阵子研究了一下,没有记下来,没想到最近研究又有些不记得了,今天把它写下来以备忘. 一般我们提供给其他语言调用的DLL,都是用C或者C++编写,然后封装.我这边也是采 ...

  2. IOS 怎么用UIScrollView来滚动和缩放他的内容第一篇

    本篇文章来自于互联网资料翻译 UIScrollView是在IOS最有用的控件之一.他是一个来展现超过一个屏幕的内容的很好的方式.下面有很多的技巧来使用他. 这篇文章就是关于UIScrollView的, ...

  3. 日记整理---->2016-11-21

    2016-11-21简单的总结一下学到的知识点.作为一个目标而存在的东西,总是那么美丽而优雅. 一.PE中事务的编写 getTransactionTemplate().execute(new Tran ...

  4. 题目1447:最短路(Floyd算法)

    题目链接:http://ac.jobdu.com/problem.php?pid=1447 详解链接:https://github.com/zpfbuaa/JobduInCPlusPlus 参考代码: ...

  5. laravel 查看sql

    方法一: 我们有时候想测试一段代码生产的 SQL 语句,比如: 我们想看 App\User::all(); 产生的 SQL 语句,我们简单在 routes.php 做个实验即可: //app/Http ...

  6. Css中!important的用法

    !important为开发者提供了一个增加样式权重的方法.应当注意的是!important是对整条样式的声明,包括这个样式的属性和属性值 <!DOCTYPE HTML> <html& ...

  7. 原生JS实现ajax 发送post请求

    1. [代码]原生JS实现ajax 发送post请求 <script> var oStr = ''; var postData = {}; var oAjax = null; //post ...

  8. Asp.net MVC]Asp.net MVC5系列——在模型中添加

    目录 概述 在模型中添加验证规则 自定义验证规则 伙伴类的使用 总结 系列文章 [Asp.net MVC]Asp.net MVC5系列——第一个项目 [Asp.net MVC]Asp.net MVC5 ...

  9. UI自动化--PageObjects(页面对象)

    核心的核心:减少了重复代码的数量,减少变更涉及面:做到如果UI发生更改,则只需在一个位置应用此修复程序. PageObject:将页面作为一个对象,进行封装,包括元素定位,封装获取各元素.操作的方法: ...

  10. OpenCV学习笔记之课后习题练习2-3

    3.使用例2-10中的视频捕捉和存储方法,结合例2-5中的doPyrDown()创建一个程序,使其从摄像机读入视频数据并将缩放变换后的彩色图像存入磁盘. 例2-10中所用的方法虽然能正常运行,但却不能 ...