标签：item input sort namespace distance text sum term 不同
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.
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.
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.
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
分析：排序题，有些复杂，参考了晴神笔记。。
1 #include<cstdio>
2 #include<string.h>
3 #include<algorithm>
4 using namespace std;
5 const int maxn = 1010;
6 int toll[25];//资费
7 struct Record
8 {
9 char name[25];//姓名
10 int month, dd, hh, mm;//月份、日、时、分
11 bool status;//status==true表示该记录为on-line，否则为off-line
12 }rec[maxn],temp;
13 bool cmp(Record a, Record b)
14 {
15 int s = strcmp(a.name, b.name);
16 if (s != 0)return s < 0;//优先按名字典序从小到大排序
17 else if (a.month != b.month)return a.month < b.month;//按月份从小到大排序
18 else if (a.dd != b.dd)return a.dd < b.dd;//按日期从小到大排序
19 else if (a.hh != b.hh)return a.hh < b.hh;//按小时从小到大排序
20 else return a.mm < b.mm;//按分钟从小到大排序
21 }
22 void get_ans(int on, int off, int &time, int &money)
23 {
24 temp = rec[on];
25 while (temp.dd < rec[off].dd || temp.hh < rec[off].hh || temp.mm < rec[off].mm)
26 {
27 time++;//该次记录总时间加一分钟
28 money += toll[temp.hh];//话费增加toll[temp.hh]
29 temp.mm++;//当前时间加1min
30 if (temp.mm >= 60)//当前分钟数达到60
31 {
32 temp.mm = 0;//进入下一个小时
33 temp.hh++;
34 }
35 if (temp.hh >= 24)//当前小时数达到24
36 {
37 temp.hh = 0;//进入下一天
38 temp.dd++;
39
40 }
41 }
42 }
43
44 int main()
45 {
46 #ifdef ONLINE_JUDGE
47 #else
48 freopen("1.txt", "r", stdin);
49 #endif
50
51 for (int i = 0; i < 24; i++)
52 {
53 scanf("%d", &toll[i]);//资费
54 }
55 int n;
56 scanf("%d", &n);//记录数
57 char line[10];//临时存放on-line或off-line的输入
58 for (int i = 0; i < n; i++)
59 {
60 scanf("%s", rec[i].name);
61 scanf("%d:%d:%d:%d", &rec[i].month, &rec[i].dd, &rec[i].hh, &rec[i].mm);
62 scanf("%s", line);
63 if (strcmp(line, "on-line") == 0)
64 {
65 rec[i].status = true;//如果是on-line，则令status为true
66 }
67 else
68 {
69 rec[i].status = false;//如果是off-line，则令status为false
70 }
71 }
72 sort(rec, rec + n, cmp);//排序
73 int on = 0, off, next;//on和off为配对的两条记录，next为下一个用户
74 while (on < n)
75 {
76 int needPrint = 0;//needPrint表示该用户是否需要输出
77 next = on; //从当前位置开始寻找下一个用户
78 while (next < n&&strcmp(rec[next].name, rec[on].name) == 0)
79 {
80 if (needPrint == 0 && rec[next].status == true)
81 {
82 needPrint = 1;//找到on，置needPrint为1
83 }
84 else if (needPrint == 1 && rec[next].status == false)
85 {
86 needPrint = 2;//在on之后如果找到off，置needPrint为2
87 }
88 next++;//next自增，直到找到不同名字，即下一个用户
89 }
90 if (needPrint < 2)//没有找到配对的on-off
91 {
92 on = next;
93 continue;
94 }
95 int AllMoney = 0;//总共花费的钱
96 printf("%s %02d\n", rec[on].name, rec[on].month);
97 while (on < next)//寻找该用户的所有配对
98 {
99 while (on < next - 1 && !(rec[on].status == true && rec[on + 1].status == false))
100 {
101 on++;//直到找到连续的on-line和off-line
102 }
103 off = on +1;//off必须是on的下一个
104 if (off == next)//已经输出完毕所有配对的on-line和off-line
105 {
106 on = next;
107 break;
108 }
109 printf("%02d:%02d:%02d ", rec[on].dd, rec[on].hh, rec[on].mm);
110 printf("%02d:%02d:%02d ", rec[off].dd, rec[off].hh, rec[off].mm);
111 int time = 0, money = 0;//时间、单次记录花费的钱
112 get_ans(on, off, time, money);//计算on到off内的时间和金钱
113 AllMoney += money;//总金额加上该次记录的钱
114 printf("%d $%.2f\n", time, money / 100.0);
115 on = off + 1;//完成一个配对,从off+1开始找下一对
116 }
117 printf("Total amount: $%.2f\n", AllMoney / 100.0);
118 }
119 return 0;
120 }
标签：item input sort namespace distance text sum term 不同
原文地址：https://www.cnblogs.com/Mered1th/p/10432228.html
