1016. Phone Bills (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

此题略烦!需要注意的是如果一个客户没有记录的话不需要打印出该客户的账单。题目都不说清楚,还给了这么一句“For each test case, you must print a phone bill for each customer.”。

代码

 1 #include <stdio.h>
 2 #include <string.h>
 3 #include <algorithm>
 4 using namespace std;
 5 
 6 typedef struct phoneRecord{
 7     char name[];
 8     int mouth,day,hour,min;
 9     int onOrOffLine;
 }phoneRecord;
 
 int cmp(const phoneRecord &,const phoneRecord &);
 double computeTimeAndCharge(const phoneRecord&,const phoneRecord&,int&);
 phoneRecord record[];
 int toll[];
 
 int main()
 {
     int N;
     int i;
     char str[];
     while(scanf("%d",&toll[]) != EOF){
         for(i=;i<;++i)
             scanf("%d",&toll[i]);
         scanf("%d",&N);
         for(i=;i<N;++i){
             scanf("%s %d:%d:%d:%d %s",record[i].name,&record[i].mouth,&record[i].day,
                 &record[i].hour,&record[i].min,str);
             if(strcmp(str,"on-line") == )
                 record[i].onOrOffLine = ;
             else
                 record[i].onOrOffLine = ;
         }
         sort(record,record+N,cmp);
         char *tempName;
         i = ;
         while(i < N){
             tempName = record[i].name;            
             int time,isFirst = ;
             double eachCharge,totalCharge = 0.0;
             while(i < N && (strcmp(tempName,record[i].name) == )){
                 if(i+ < N && (strcmp(tempName,record[i+].name) == ) && (!record[i].onOrOffLine) 
                     && record[i+].onOrOffLine){
                     if(isFirst == ){
                         isFirst = ;    
                         printf("%s %02d\n",tempName,record[i].mouth);
                     }
                     printf("%02d:%02d:%02d %02d:%02d:%02d",record[i].day,record[i].hour,record[i].min,
                         record[i+].day,record[i+].hour,record[i+].min);
                     eachCharge = computeTimeAndCharge(record[i],record[i+],time);
                     eachCharge /= ;
                     printf(" %d $%.2lf\n",time,eachCharge);
                     totalCharge += eachCharge;
                     i += ;
                 }
                 else
                     ++i;
             }
             if(!isFirst)
                 printf("Total amount: $%.2lf\n",totalCharge);
         }
     }
     return ;
 }
 
 int cmp(const phoneRecord &a,const phoneRecord &b)
 {
     if(strcmp(a.name,b.name) > )
         return ;
     else if(strcmp(a.name,b.name) < )
         return ;
     else{
         int aTime =  *  * a.day +  * a.hour + a.min;
         int bTime =  *  * b.day +  * b.hour + b.min;
         return aTime < bTime;
     }
 }
 
 double computeTimeAndCharge(const phoneRecord &a,const phoneRecord &b,int &time)
 {
     int aTime =  *  * a.day +  * a.hour + a.min;
     int bTime =  *  * b.day +  * b.hour + b.min;
     time = bTime - aTime;
     int i;
     double charge = 0.0;
     for(i = aTime;i<bTime;++i){
         charge += toll[(i%( * ))/];
     }
     return charge;
 }

PAT 1016的更多相关文章

  1. PAT 1016 部分A+B(15)(C++&JAVA&&Python)

    1016 部分A+B(15 分) 正整数 A 的"D​A​​(为 1 位整数)部分"定义为由 A 中所有 D​A​​ 组成的新整数 P​A​​.例如:给定 A=3862767,D​ ...

  2. PAT 1016 Phone Bills[转载]

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

  3. PAT 1016 部分A+B C语言

    1016. 部分A+B (15) 正整数A的“DA(为1位整数)部分”定义为由A中所有DA组成的新整数PA.例如:给定A = 3862767,DA = 6,则A的“6部分”PA是66,因为A中有2个6 ...

  4. PAT——1016. 部分A+B

    正整数A的“DA(为1位整数)部分”定义为由A中所有DA组成的新整数PA.例如:给定A = 3862767,DA = 6,则A的“6部分”PA是66,因为A中有2个6. 现给定A.DA.B.DB,请编 ...

  5. PAT 1016 Phone Bills(模拟)

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

  6. PAT 1016. 部分A+B (15)

    正整数A的"DA(为1位整数)部分"定义为由A中所有DA组成的新整数PA.例如:给定A = 3862767,DA = 6,则A的"6部分"PA是66,因为A中有 ...

  7. PAT 1016. Phone Bills

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

  8. PAT 1016 部分A+B

    https://pintia.cn/problem-sets/994805260223102976/problems/994805306310115328 正整数A的“D~A~(为1位整数)部分”定义 ...

  9. PAT甲级1016. Phone Bills

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

随机推荐

  1. 【 D3.js 高级系列 — 4.0 】 矩阵树图

    矩阵树图(Treemap),也是层级布局的扩展,根据数据将区域划分为矩形的集合.矩形的大小和颜色,都是数据的反映.许多门户网站都能见到类似图1,将照片以不同大小的矩形排列的情形,这正是矩阵树图的应用. ...

  2. [转] MATLAB快捷键

    原文地址:MATLAB快捷键大全 (转载)作者:掷地有声 一.索引混排版 备注:删除了如F1(帮助)等类型的常见快捷命令 SHIFT+DELETE永久删除 DELETE删除 ALT+ENTER属性 A ...

  3. ORACLE的sign函数和DECODE函数

    比较大小函数 sign 函数语法:sign(n) 函数说明:取数字n的符号,大于0返回1,小于0返回-1,等于0返回0 示例:一.select sign( 100 ),sign(- 100 ),sig ...

  4. 查询Table name, Column name, 拼接执行sql文本, 游标, 存储过程, 临时表

    018_Proc_UpdateTranslations.sql: SET ANSI_NULLS ON GO SET QUOTED_IDENTIFIER ON GO if (exists (select ...

  5. HDU 5536 Chip Factory 字典树+贪心

    给你n个数,a1....an,求(ai+aj)^ak最大的值,i不等于j不等于k 思路:先建字典树,暴力i,j每次删除他们,然后贪心找k,再恢复i,j,每次和答案取较大的,就是答案,有关异或的貌似很多 ...

  6. 魅族MX2代理设置

    魅族MX2买了快2年了,今天才知道有这个功能,唉 连接一个无线网络,比如我的centos 长按网络名字 选代理设置,设置自己的代理,再也不用SS 或 VPN 的android端了,老是提示ROOT权限 ...

  7. java web接收POST数据

    新建一个ServerForPOSTMethod的动态网站工程

  8. C#给文件重命名

    使用的主要方法是: File.Move(oldFileDir,newFileDir);//这个是移动文件的方法 Directory.GetFiles(dir);//获取dir路径下的所有文件的全路径 ...

  9. 烧写u_boot系统和linux系统

    今天下午准备烧写一下u_boot还有linux系统,因为是笔记本电脑,吐槽一下,笔记本电脑的usb转串口不是怎么稳定,dnw下对应的驱动也不怎么好用,导致在笔记本电脑上烧写系统的成功率比较低,本来三点 ...

  10. C/C++编译预处理命令详解【转】

    1.       预处理程序  按照ANSI标准的定义,预处理程序应该处理以下指令: #if #ifdef #ifndef #else #elif #endif #define #undef #lin ...