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-lineSample 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
题意就是根据几条包含用户，时间及是否是on-line或off-line的记录，以及对应时间段的话费，来计算每个用户的账单。根据题意，主要是先要把记录进行排序，我先用一个结构体来保存一条记录，然后用sort来对记录先按名字再按时间先后进行排序。因为有无效记录，所以要使on-line与off-line 一一对应，把在on-line前输入的off-line都舍去，遇到off-line时取之前最近的on-line，然后再根据读入的时间，计算相应的金额，并最终相加，代码如下:
#include <iostream>
#include <vector>
#include <string>
#include <iomanip>
#include <algorithm>
using namespace std;
struct Record {
string id;
string date;
bool isOnline;
};
int tolls[24];
bool compara(const Record a,const Record b)
{
if (a.id < b.id)
return true;
else if (a.id == b.id)
{
if (a.date <= b.date)
return true;
else
return false;
}
else
return false;
}
int calculateCharge(string start, string end)
{
int charge = 0;
int day1 = atoi(start.substr(0, 2).c_str());
int day2 = atoi(end.substr(0, 2).c_str());
int hour1 = atoi(start.substr(3, 5).c_str());
int hour2 = atoi(end.substr(3, 5).c_str());
int minute1 = atoi(start.substr(6, 8).c_str());
int minute2 = atoi(end.substr(6, 8).c_str());
while (day1 < day2)
{
charge += (60 - minute1) * tolls[hour1];
minute1 = 0;
if (hour1 == 23)
{
hour1 = 0;
day1++;
}
else
hour1++;
}
while (hour1 < hour2)
{
if (hour1 + 1 == hour2)
{
charge += (60 - minute1) * tolls[hour1] + minute2 * tolls[hour2];
hour1 = hour2;
minute1 = minute2;
}
else
{
charge += (60 - minute1)*tolls[hour1];
hour1++;
minute1 = 0;
}
}
if (minute1 < minute2)
{
charge += (minute2 - minute1) * tolls[hour1];
}
return charge;
}
int main()
{
vector<Record>records;
Record temp;
string s;
int N;
for (int i = 0;i < 24;i++)
{
cin >> tolls[i];
}
cin >> N;
for (int i = 0;i < N;i++)
{
cin >> temp.id;
cin >> temp.date;
cin >> s;
if (s == "on-line")
temp.isOnline = true;
else
temp.isOnline = false;
records.push_back(temp);
}
sort(records.begin(), records.end(), compara);
int charge;
double sum = 0;
int minute;
int customer;
int i = 0;
while (i < records.size())
{
customer = i;
cout << records[customer].id << " " << records[customer].date[0] << records[customer].date[1] << endl;
while (records[i].isOnline == false) //一开始直接是off-line则是无效的记录
{
i++;
}
while (i < records.size() && records[i].id == records[customer].id) //同一个用户都在这个循环中处理
{
while (i < records.size() && records[i].id == records[customer].id && records[i].isOnline == true)
{
customer = i;
i++;
}
if (i < records.size() && records[i].id == records[customer].id && records[i].isOnline == false)
{
cout << records[customer].date.substr(3, 11) << " " << records[i].date.substr(3, 11) << " ";
minute = (atoi(records[i].date.substr(3, 5).c_str()) - atoi(records[customer].date.substr(3, 5).c_str())) * 24 * 60
+ (atoi(records[i].date.substr(6, 8).c_str()) - atoi(records[customer].date.substr(6, 8).c_str())) * 60
+ (atoi(records[i].date.substr(9, 11).c_str()) - atoi(records[customer].date.substr(9, 11).c_str()));
cout << minute << " $";
charge = calculateCharge(records[customer].date.substr(3, 11), records[i].date.substr(3, 11));
cout << fixed << setprecision(2) << (double)charge / 100.0 << endl;
sum += (double)charge / 100.0;
i++;
}
}
cout << "Total amount: $" << sum << endl;
sum = 0;
}
return 0;
}这样的做法只对了用例0：
后来去查阅了网上的资料。发现首先如果该用户一条正确记录都没有，应该不输出，而不是像我之前的那样输出总金额为0。然后我在处理on-line后两个off-line的时候按我的代码会把两次记录都输出，所以应该把false那段的循环加入到下面一个顾客的大循环中，这样修改后代码如下:
#include <iostream>
#include <vector>
#include <string>
#include <iomanip>
#include <algorithm>
using namespace std;
struct Record {
string id;
string date;
bool isOnline;
};
int tolls[24];
bool compara(const Record a,const Record b)
{
if (a.id < b.id)
return true;
else if (a.id == b.id)
{
if (a.date <= b.date)
return true;
else
return false;
}
else
return false;
}
int calculateCharge(string start, string end)
{
int charge = 0;
int day1 = atoi(start.substr(0, 2).c_str());
int day2 = atoi(end.substr(0, 2).c_str());
int hour1 = atoi(start.substr(3, 5).c_str());
int hour2 = atoi(end.substr(3, 5).c_str());
int minute1 = atoi(start.substr(6, 8).c_str());
int minute2 = atoi(end.substr(6, 8).c_str());
while (day1 < day2)
{
charge += (60 - minute1) * tolls[hour1];
minute1 = 0;
if (hour1 == 23)
{
hour1 = 0;
day1++;
}
else
hour1++;
}
while (hour1 < hour2)
{
if (hour1 + 1 == hour2)
{
charge += (60 - minute1) * tolls[hour1] + minute2 * tolls[hour2];
hour1 = hour2;
minute1 = minute2;
}
else
{
charge += (60 - minute1)*tolls[hour1];
hour1++;
minute1 = 0;
}
}
if (minute1 < minute2)
{
charge += (minute2 - minute1) * tolls[hour1];
}
return charge;
}
int main()
{
vector<Record>records;
Record temp;
string s;
int N;
for (int i = 0;i < 24;i++)
{
cin >> tolls[i];
}
cin >> N;
for (int i = 0;i < N;i++)
{
cin >> temp.id;
cin >> temp.date;
cin >> s;
if (s == "on-line")
temp.isOnline = true;
else
temp.isOnline = false;
records.push_back(temp);
}
sort(records.begin(), records.end(), compara);
int charge;
double sum = 0;
int minute;
int customer;
int i = 0;
bool k = false;
while (i < records.size())
{
customer = i;
while (i < records.size() && records[i].id == records[customer].id) //同一个用户都在这个循环中处理
{
while (i < records.size() && records[i].isOnline == false) //一开始直接是off-line则是无效的记录
{
i++;
}
while (i < records.size() && records[i].id == records[customer].id && records[i].isOnline == true)
{
customer = i;
i++;
}
if (i < records.size() && records[i].id == records[customer].id && records[i].isOnline == false)
{
if (!k)
{
cout << records[customer].id << " " << records[customer].date[0] << records[customer].date[1] << endl;
k = true;
}
cout << records[customer].date.substr(3, 11) << " " << records[i].date.substr(3, 11) << " ";
minute = (atoi(records[i].date.substr(3, 5).c_str()) - atoi(records[customer].date.substr(3, 5).c_str())) * 24 * 60
+ (atoi(records[i].date.substr(6, 8).c_str()) - atoi(records[customer].date.substr(6, 8).c_str())) * 60
+ (atoi(records[i].date.substr(9, 11).c_str()) - atoi(records[customer].date.substr(9, 11).c_str()));
cout << minute << " $";
charge = calculateCharge(records[customer].date.substr(3, 11), records[i].date.substr(3, 11));
cout << fixed << setprecision(2) << (double)charge / 100.0 << endl;
sum += (double)charge / 100.0;
i++;
}
}
if(k)
cout << "Total amount: $" << sum << endl;
sum = 0;
k = false;
}
return 0;
}这样修改后就通过了全部用例。这题还是比较复杂的。
扫一扫
280
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
