PAT-A 1016. Phone Bills

发表于 | 分类于 |
字数统计: 1,220

运用sort和strcmp，计算通话花费。

A 1016

PAT(Advanced) 1016. Phone Bills

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小时内每个时间段的通话单价。
输入一系列通话记录，包含机主姓名，时间，状态（接通/断开）。需要判断接通/断开的有效性，然后计算机主的每次通话花费以及总的通话费用。

思路

将输入的通话记录先通按机主姓名字典序排序。在单个机主的范围内，按时间从小到大排序，以分钟为计算单位，对有效的每段通话记录计算花费，然后输出。

AC代码

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdlib>
#include <stdio.h>
#include <algorithm>
#include <stdlib.h>

using namespace std;
int toll[24];
struct Record {
	char name[21];
	int month, dd, hh, mm;
	bool status;  //通话状态 on为True off为False
} r[1010];

bool cmp_name(Record a, Record b) {
	return strcmp(a.name, b.name) < 0;
}

bool cmp_time(Record a, Record b) {
	int atime, btime;
	atime = a.month * 1000000 + a.dd * 10000 + a.hh * 100 + a.mm;
	btime = b.month * 1000000 + b.dd * 10000 + b.hh * 100 + b.mm;
	return atime < btime;
}

//计算单个机主的所有账单并输出
void get_bill(int a, int b) {
	bool flag = 1, pairflag = 0;
	int now = a;
	double total = 0;
	for (int i = a + 1; i < b; i++) {
		if (!r[now].status || (r[now].status && r[i].status)) {
			now = i;
		}
		else if(r[now].status && !r[i].status){
			if (flag) {
				printf("%s %02d\n", r[i].name, r[i].month);
				flag = 0;
			}
			pairflag = 1;
			int d1, h1, m1, d2, h2, m2;
			d1 = r[now].dd;
			h1 = r[now].hh;
			m1 = r[now].mm;
			d2 = r[i].dd;
			h2 = r[i].hh;
			m2 = r[i].mm;
			printf("%02d:%02d:%02d %02d:%02d:%02d ", r[now].dd, r[now].hh, r[now].mm, r[i].dd, r[i].hh, r[i].mm);
			int charge = 0, mcount =0;
			while (d1 < d2 || h1 < h2 || m1 < m2) {
				m1++;
				mcount++;
				charge += toll[h1];
				if (m1 == 60) {
					m1 = 0;
					h1++;
				}
				if (h1 == 24) {
					h1 = 0;
					d1++;
				}
			}
			printf("%d $%.2f\n", mcount, (double)charge / 100.00);
			total += (double)charge / 100.00;
			now = i;
		}
	}
	if (pairflag) {
		printf("Total amount: $%.2f\n", total);
	}
}
int main() {
	int n;
	for (int i = 0; i < 24; i++) {
		scanf("%d", &toll[i]);
	}
	scanf("%d", &n);
	for (int i = 0; i < n; i++) {
		char temp[10];
		scanf("%s %d:%d:%d:%d %s", r[i].name, &r[i].month, &r[i].dd, &r[i].hh, &r[i].mm, temp);
		if (temp[1] == 'n') {
			r[i].status = 1;
		}
		else {
			r[i].status = 0;
		}
	}

	sort(r, r + n, cmp_name);

	int begin = 0;
	for (int i = 1; i < n; i++) {
		if (strcmp(r[begin].name, r[i].name) < 0) {
			sort(r + begin, r + i, cmp_time);
			get_bill(begin, i);
			begin = i;
		}
	}
	sort(r + begin, r + n, cmp_time);
	get_bill(begin, n);

	return 0;
}
-------------本文结束 感谢阅读-------------