1016 Phone Bills

最新推荐文章于 2025-12-18 16:28:22 发布

原创最新推荐文章于 2025-12-18 16:28:22 发布 · 139 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#c++ #算法

PAT甲级算法专栏收录该内容

24 篇文章

订阅专栏

该问题是一个编程任务，要求根据给定的费率结构和电话通话记录，计算并输出客户的电话账单。输入包括24小时的费率和多个电话记录，输出需按客户姓名和时间顺序列出账单详情及总费用。算法涉及时间戳处理、话费计算和数据排序。

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

代码长度限制

16 KB

时间限制

200 ms

内存限制

64 MB

汉化版本

长途电话公司按以下规则向客户收费：

拨打长途电话每分钟要花费一定的费用，具体收费取决于拨打电话的时间。

客户开始拨打长途电话的时间将被记录，客户挂断电话的时间也将被记录。

每个月都要给客户发送一次话费账单，账单中应包含每次通话记录以及相关收费等信息。

给定一组电话记录，你的工作是为客户准备帐单。

输入格式

输入包含两部分：费率结构和电话记录。

费率结构由一行组成，该行包含24个非负整数，分别表示从 00:00-01:00 的收费（分/分钟），从 01:00-02:00 的收费，以此类推…

下一行包含一个正整数 NN。

接下来 NN 行，每行包含一条记录。

每个记录由客户名称（最多 2020 个字符的字符串，不带空格），时间和日期（mm:dd:hh:mm）以及单词 on-line 或 off-line 组成。

所有日期都在同一个月内，每个 on-line 记录都与按时间顺序排列的同一位客户的下一条记录配对，但前提是这条记录是 off-line。

所有未与 off-line 记录配对的 on-line 记录以及未与 on-line 记录配对的 off-line 记录都必须忽略。

输入中至少包含一个成功的配对。

同一客户在同一时间不会有两个或以上的电话记录。

使用 2424 小时制记录时间。

输出格式

你需要为每个客户打印电话费。

账单必须按照客户姓名的字母顺序（按ASCII码顺序，大写字母在前，小写字母在后）打印。

对于每个客户，首先以示例显示的格式在一行中打印客户名称和帐单月份。

然后，对于每个通话时间段，在一行中分别打印开始和结束时间和日期（dd:hh:mm），持续时间（以分钟为单位）和通话费用。

通话必须按时间顺序列出。

最后，以示例显示的格式打印该月的总费用。

注意，没有任何有效通话记录的客户直接忽略，不予打印账单。

数据范围

1≤N≤10001≤N≤1000

输入样例：

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

输出样例：

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

#include <iostream>
#include <map>
#include <vector>
#include <algorithm>

using namespace std;

const int MINUTE = 31*24*60+10;
int rates[24];
int counts[MINUTE];     // 时间戳以分钟为单位的费率累计

struct record {
    int minutes;
    string format_time;
    string status;

    bool operator< (const record& t) const {
        return minutes < t.minutes;
    }
};

map<string, vector<record>> persons;

int to_minutes(int day, int hour, int minute){
    return (day-1)*60*24 + hour * 60 + minute;
}

int main() {
    for (int i = 0; i < 24 ; i++) cin >> rates[i];
    for (int i = 1; i < MINUTE; i++) counts[i] = counts[i-1] + rates[(i-1)%1440/60];

    int N;
    cin >> N;
    char user[30],format_time[30],status[20];
    int month,day,hour,minute;
    for (int i = 0; i < N; i++) {
        scanf("%s %d:%d:%d:%d %s", user, &month, &day, &hour, &minute, status);
        sprintf(format_time,"%02d:%02d:%02d",day,hour,minute);
        int minutes = to_minutes(day,hour,minute);
        persons[user].push_back({minutes,format_time,status});
    }

    for (auto &person : persons){   // 加&表直接引用，而非复制，提高效率
        auto records = person.second;
        auto user = person.first;
        sort(records.begin(),records.end());
        double total = 0;
        for(int i = 0; i + 1 < records.size(); i++){
            auto a = records[i], b = records[i+1];
            if(a.status == "on-line" && b.status == "off-line"){
                if (!total) printf("%s %02d\n", user.c_str(), month);
                cout << a.format_time << ' ' << b.format_time;
                double cost = counts[b.minutes] - counts[a.minutes];
                printf(" %d $%.2lf\n", b.minutes-a.minutes, cost/100);
                total += cost;
            }
        }
        if (total) printf("Total amount: $%.2lf\n", total/100);
    }
	return 0;
}