A1016 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

思路

这里面时间轴的思想非常重要。

日期和时间的排序,以及,分钟数计算时间差的手段

K&R的书里竟然有错,在strcmp函数介绍里,不过总算是明白cmp函数返回值得原理。

升序是a>b返回正值

降序是a<b返回正值

分钟计时的代码也很不错

while(temp.dd < rec[off].dd || temp.hh < rec[off].hh || temp.mm < rec[off].mm) {
(*time)++;
(*money)+= toll[temp.hh];
temp.mm++;
if(temp.mm >= 60) {
temp.mm = 0;
temp.hh++;
}
if(temp.hh >= 24) {
temp.hh = 0;
temp.dd++;
}
}

AC代码

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <stdbool.h>
#define maxn 1010
int toll[25];
struct Record {
char name[25];
int month, dd, hh, mm;
bool status;
} rec[maxn], temp;
int cmp(const void* a, const void* b) {
struct Record*aa=(Record*)a;
struct Record*bb=(Record*)b;
// struct Record*aa=a;
// struct Record*bb=b; int s = strcmp(aa->name, bb->name);
/* aa->name<bb->name时,返回负值,aa->name=bb->name时,返回0 ,aa->name>bb->name时,返回正值
if(s != 0) return s > 0;*/
/* 为使qsort达成升序排列
在函数cmp中,如果第一个参数小于第二个参数,它必须返回一个负值;
如果第一个参数等于第二个参数,它必须返回0;
如果第一个参数大于第二个参数,它必须返回一个正值。
*/ if(s != 0) return s>0 ? 1:-1;/*客户的名字,字典序,升序*/
else if(aa->month != bb->month) return aa->month > bb->month;/*月份升序*/
else if(aa->dd != bb->dd) return aa->dd > bb->dd;/*日期升序*/
else if(aa->hh != bb->hh) return aa->hh > bb->hh;/*钟点升序*/
else return aa->mm > bb->mm;/*分钟升序,数据限制,没有到分钟都全部相同的记录*/
}
void get_ans(int on, int off, int* time, int* money) {
temp = rec[on];
while(temp.dd < rec[off].dd || temp.hh < rec[off].hh || temp.mm < rec[off].mm) {
(*time)++;
(*money)+= toll[temp.hh];
temp.mm++;
if(temp.mm >= 60) {
temp.mm = 0;
temp.hh++;
}
if(temp.hh >= 24) {
temp.hh = 0;
temp.dd++;
}
}
}
int main() {
for(int i = 0; i < 24; i++) {
scanf("%d", &toll[i]);
}
int n;
scanf("%d", &n);
char line[10];
for(int i = 0; i < n; i++) {
scanf("%s", rec[i].name);
scanf("%d:%d:%d:%d", &rec[i].month, &rec[i].dd, &rec[i].hh, &rec[i].mm);
scanf("%s", line);
if(strcmp(line, "on-line") == 0) {/*字符串相等*/
rec[i].status = true;
} else {
rec[i].status = false;
}
}
qsort(rec, n, sizeof (struct Record), cmp);/*排序有问题*/
// for(int i=0;i<n;i++){
// printf("%s ",rec[i].name);
// printf("%d:%d:%d:%d\n",rec[i].month,rec[i].dd,rec[i].hh,rec[i].mm);
// // printf("%s",rec[i].status);
//
// }
int on = 0, off, next;//next下一位客户
while(on < n) {
int needPrint = 0;
next = on;
while(next < n && strcmp(rec[next].name, rec[on].name) == 0) {
if(needPrint == 0 && rec[next].status == true) {
needPrint = 1;
} else if(needPrint == 1 && rec[next].status == false) {
needPrint = 2;
}
next++;
}/*在同一客户记录中寻找有无匹配的时间轴记录*/
if(needPrint < 2) {/*没有成对的,时间轴相邻的on-line 与off-line*/
on = next;
continue;/*跳过这些记录*/
}
int AllMoney = 0;
printf("%s %02d\n", rec[on].name, rec[on].month);/*该用户存在有效通话记录*/
while(on < next) {
while(on < next - 1
&& !(rec[on].status == true && rec[on + 1].status == false)) {
on++;/*直到找到连续的on-line和off-line*/
}
off = on + 1;
if(off == next) {
on = next;
break;
}
printf("%02d:%02d:%02d ", rec[on].dd, rec[on].hh, rec[on].mm);
printf("%02d:%02d:%02d ", rec[off].dd, rec[off].hh, rec[off].mm);
int time = 0, money = 0;
get_ans(on, off, &time, &money);
AllMoney += money;
printf("%d $%.2f\n", time, money / 100.0);
on = off + 1;
}
printf("Total amount: $%.2f\n", AllMoney / 100.0);
}
return 0;
}

A1016 Phone Bills (25)(25 分)的更多相关文章

  1. PAT A1016 Phone Bills (25 分)——排序,时序

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

  2. 1016 Phone Bills (25 分)

    1016 Phone Bills (25 分) A long-distance telephone company charges its customers by the following rul ...

  3. 怎么设置BarTender中二维码大小为25*25

    有小伙伴近期问了小编一个问题,说客户需要25*25大小的QR Code二维码,用BarTender怎么做出来?想要指定条形码的大小,还得BarTender符号与版本选项来帮忙.本文小编就来给大家详细讲 ...

  4. JAVA题目:正整数n若是其平方数的尾部,则称n为同构数 如:5*5=25, 25*25=625 问: 求1~99中的所有同构数

    1 /*题目:正整数n若是其平方数的尾部,则称n为同构数 2 如:5*5=25, 25*25=625 3 问: 求1~99中的所有同构数 4 */ 5 //分析:将1-99分为1-9和10-99,用取 ...

  5. A1016 Phone Bills (25 分)

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

  6. PAT A1016 Phone Bills (25)

    题目描述 A long-distance telephone company charges its customers by the following rules: Making a long-d ...

  7. A1016. Phone Bills

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

  8. PAT甲级——A1016 Phone Bills

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

  9. [C++]PAT乙级1010. 一元多项式求导 (25/25)

    /* 1010. 一元多项式求导 (25) 设计函数求一元多项式的导数.(注:x^n(n为整数)的一阶导数为n*x^n-1.) 输入格式: 以指数递降方式输入多项式非零项系数和指数(绝对值均为不超过1 ...

随机推荐

  1. 第十一章 GUI 上

     第11章 GUI程序设计 11.1 JFC简介 JFC(Java Foundation Class) 作为CUI(Graphic User Interface)设计的基础.JFC包含AWT(Abst ...

  2. JSON 与JAVA对象之间的转换(转)

    JSON与XML两者目前在数据交互方面都有很高的使用率,随着现在SOA的兴起,异构系统的整合地位相应提高,本篇文章主要介绍JSON与JAVA对象之间的相互转换. 一.对普通类型的JSON模式的转换 一 ...

  3. FC网络学习笔记02 -网络配置方法

    随着新一代飞机的综合化航电系统对通信需求的不断提高,传统的ARINC429.1553B总线的传输速率分别只有100Kbps和1Mbps,其带宽已远远不 论文联盟 http://Www.LWlm.cOm ...

  4. U盘安装ubuntu时出现的gfxboot.c32:not a COM32R image问题

    方法特别简单:只需在提示后面输入   live  然后回车 就OK了

  5. HeadFirst设计模式读书笔记(3)-装饰者模式(Decorator Pattern)

    装饰者模式:动态地将责任附件到对象上.若要扩展功能,装饰者提东了比继承更有弹性的替代方案. 装饰者和被装饰对象有相同的超类型 你可以用一个或者多个装饰者包装一个对象. 既然装饰者和被装饰对象有相同的超 ...

  6. sharepoint 2013 配件控制FileUpload如何检查是否图像的方法

    它记录的附件控制FileUpload如何检查是否图像的方法: function checkImg() { var fileObj =document.getElementById('<%=Fil ...

  7. [cocos2d-x 3.0] 触摸显示器

    一.基本使用 1.首先,声明一个监听器 有两种,EventListenerTouchOneByOne 和 EventListenerTouchAllAtOnce,前者是单点触控.后者是多点触控.后者我 ...

  8. Html标签及各种属性(持续更新)

    <!--Html标签属性之:required (必须的)--> <input type="file" id="Images" required ...

  9. 【LOJ 2542】【PKUWC2018】 随机游走(最值反演 + 树上期望dp)

    哇我太菜啦555555 不妨钦定我们需要访问的点集为$S$,在$S$已知的情况下,我们令$f(x) $表示从$x$走到点集$S$中任意一点的期望步数. 若$x∈S$,则显然$f(x)=0$,否则$f[ ...

  10. 【SPOJ】QTREE6(Link-Cut-Tree)

    [SPOJ]QTREE6(Link-Cut-Tree) 题面 Vjudge 题解 很神奇的一道题目 我们发现点有黑白两种,又是动态加边/删边 不难想到\(LCT\) 最爆力的做法,显然是每次修改单点颜 ...