1016. Phone Bills (25)——PAT (Advanced Level) Practise
来源:互联网 发布:淘宝pc流量是什么意思 编辑:程序博客网 时间:2024/05/09 04:59
题目信息:
1016. Phone Bills (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 1010CYLL 01:01:06:01 on-lineCYLL 01:28:16:05 off-lineCYJJ 01:01:07:00 off-lineCYLL 01:01:08:03 off-lineCYJJ 01:01:05:59 on-lineaaa 01:01:01:03 on-lineaaa 01:02:00:01 on-lineCYLL 01:28:15:41 on-lineaaa 01:05:02:24 on-lineaaa 01:04:23:59 off-lineSample Output:
CYJJ 0101:05:59 01:07:00 61 $12.10Total amount: $12.10CYLL 0101:06:01 01:08:03 122 $24.4028:15:41 28:16:05 24 $3.85Total amount: $28.25aaa 0102:00:01 04:23:59 4318 $638.80Total amount: $638.80
代码如下:
#include <iostream>#include <string>#include <map>#include <vector>#include <cstdio>#include <algorithm>using namespace std;struct Record{int mouth;int d, h, m;bool line;int t;Record(){}Record(int tmouth, int td, int th, int tm, bool tline){mouth = tmouth;d = td;h = th;m = tm;t = td * 24 * 60 + h * 60 + m;line = tline;}bool operator < (const Record &b) const{return t < b.t;}};map<string, vector<Record> > RCD;int toll[24];bool cmp(const Record &a, const Record &b){return a.t < b.t;}int get_money(int n){int h = n / 60;int m = n % 60;int re = 0, i;for (i = 0; i < h; ++i)re += toll[i % 24] * 60;re += toll[i % 24] * m;return re;}void print(const string &name, vector<Record> &v){int n = v.size();int tre = 0, ttm = 0, re = 0, tm = 0, k;int mouth;bool has = false;for (int i = 0; i < n - 1; ++i){if (v[i].line == 1 && v[i + 1].line == 0){if (!has){mouth = v[i].mouth;printf("%s %02d\n", name.c_str(), mouth);has = true;}printf("%02d:%02d:%02d %02d:%02d:%02d ", v[i].d, v[i].h, v[i].m, v[i + 1].d, v[i + 1].h, v[i + 1].m);re = get_money(v[i + 1].t) - get_money(v[i].t);tm = v[i + 1].t - v[i].t;tre += re;ttm += tm;printf("%d $%d.%02d\n", tm, re / 100, re % 100);}}if (has)printf("Total amount: $%d.%02d\n", tre / 100, tre % 100);}int main(){int N, i, tm[4];char name[20], state[10];for (i = 0; i < 24; ++i){scanf("%d", &toll[i]);}scanf("%d", &N);for (i = 0; i < N; ++i){scanf("%s %d:%d:%d:%d %s", name, &tm[0], &tm[1], &tm[2], &tm[3], state);Record rcd(tm[0], tm[1], tm[2], tm[3], state[1] == 'n');RCD[name].push_back(rcd);}map<string, vector<Record> >::iterator it;for (it = RCD.begin(); it != RCD.end(); ++it){sort(it->second.begin(), it->second.end(),cmp );print(it->first, it->second);}return 0;}
- 1016. Phone Bills (25)——PAT (Advanced Level) Practise
- 1016. Phone Bills (25) @ PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise 1016. Phone Bills (25)
- PAT (Advanced Level) Practise 1016 Phone Bills (25)
- PAT (Advanced Level) Practise 1016 Phone Bills (25)
- 【PAT Advanced Level】1016. Phone Bills (25)
- 【PAT】【Advanced Level】1016. Phone Bills (25)
- PAT (Advanced Level) 1016. Phone Bills (25) 电话账单
- 浙大 PAT Advanced level 1016. Phone Bills (25)
- 【PAT Practise】1016. Phone Bills (25)
- PAT (Advanced) 1016. Phone Bills (25)
- PAT (Advanced) 1016. Phone Bills (25)
- Pat(Advanced Level)Practice--1016(Phone Bills)
- 1003. Emergency (25)——PAT (Advanced Level) Practise
- 1010. Radix (25)——PAT (Advanced Level) Practise
- 1020. Tree Traversals (25)——PAT (Advanced Level) Practise
- 1029. Median (25)【排序】——PAT (Advanced Level) Practise
- 1032. Sharing (25)【链表】——PAT (Advanced Level) Practise
- xwPython中Radio和CheckButton的使用
- php输出xml格式报错--XML或文本声明不在实体的开头位置
- Mac OS使用技巧十八:Safari碉堡功能之一制作Widget
- MFC小程序003------MFC使用WebBrowser组件,在对话框中创建滚动视图,动态创建一个静态文本控件并设置鼠标单击的消息响应
- HDU 1253 胜利大逃亡
- 1016. Phone Bills (25)——PAT (Advanced Level) Practise
- 2014年的国庆来了
- leetcode--Linked List Cycle--判断链表是否有环
- 基于Jersey的Rest服务记住客户端状态
- 【欧拉函数】【HDU1286】 找新朋友
- MySQL定义异常和异常处理方法
- HYSBZ 1036 树的统计Count(树链剖分)
- |和||、&&和&
- leetcode - Binary Tree Maximum Path Sum