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 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 COUNT 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 <cstdio>
#include<string>
#include<map>
#include<vector>
#include<stdio.h>
#include<iostream>
#include <algorithm>
using namespace std;
int price[25];
struct ZZ
{
string id;
int mark;
int mouth,d,h,m;
bool operator < (const ZZ &A) const
{
if(d!=A.d) return d<A.d;
if(h!=A.h) return h<A.h;
return m<A.m;
}
};
struct SS
{
string id;
bool operator < (const SS &A ) const
{
return id<A.id;
}
}name[10005];
vector<ZZ> node[10005];
map<string,int> M;
int p=0;
double pricee(int x1,int x2,int x3,int y1,int y2,int y3)
{
double sum=0;
while(x1!=y1||x2!=y2||x3!=y3)
{
x3++;
sum+=price[x2];
if(x3==60) {x3=0;x2++;}
if(x2==24) {x2=0;x1++;}
}
sum/=100;
return sum;
}
void gogo(int i)
{
if(node[i].begin()==node[i].end()) return; //重要
cout<<node[i][0].id<<' ';
double sum=0;
printf("%02d\n",node[i][0].mouth);
for(int j=0;j<node[i].size();j+=2)
{
int x1,x2,x3;
int y1,y2,y3;
x1=node[i][j].d;
x2=node[i][j].h;
x3=node[i][j].m;
y1=node[i][j+1].d;
y2=node[i][j+1].h;
y3=node[i][j+1].m;
double zz=pricee(x1,x2,x3,y1,y2,y3);
int cha=(y1-x1)*24*60+(y2-x2)*60+(y3-x3);
printf("%02d:%02d:%02d %02d:%02d:%02d %d $%.2lf\n",x1,x2,x3,y1,y2,y3,cha,zz);
sum+=zz;
}
printf("Total amount: $%.2lf\n",sum);
sum=0;
}
intmain()
{
for(int i=0;i<24;i++)
cin>>price[i];
int n; cin>>n;
for(int i=0;i<n;i++)
{
int now;
string s;
cin>>s;
if(M.find(s)==M.end())
{
now=p;
M[s]=p++;
}
else now=M[s];
name[now].id=s;
int x,y,z,w;
scanf("%d:%d:%d:%d",&x,&y,&z,&w);
ZZ tmp;
tmp.id=s;
cin>>s;
tmp.mouth=x;
tmp.d=y;
tmp.h=z;
tmp.m=w;
if(s[1]=='n') tmp.mark=0;
else tmp.mark=1;
node[now].push_back(tmp);
}
vector<ZZ>::iterator it;
for(int i=0;i<p;i++)
{
sort(node[i].begin(),node[i].end());
for(it=node[i].begin();it!=node[i].end();) //Pay attention to the following processing
{
// cout<<"AAA"<<it->id<<endl;
if( it->mark==1 || it->mark==0&&(it+1)==node[i].end()||it->mark==0&& (it+1)->mark==0 )
node[i].erase(it);
else {if(it!=node[i].end()) it++;
if(it!=node[i].end()) it++;}
}
}
sort(name,name+p);
for(int i=0;i<p;i++)
{
string aa=name[i].id;
// cout<<aa<<endl;
for(int j=0;j<p;j++)
{
//cout<<"SSS "<<node[j][0].id<<' '<<node[j][0].h<<endl;
if(node[j][0].id==aa)
{
gogo (j);
break;
}
}
}
return 0;
}
Referring to other people's code, there is a simpler sorting scheme.
Analysis: Sort the given data first by name, and then in chronological order. In this way, when traversing, the two names before and after the same and the previous state is on-line and the latter state is off-line are qualified data ~
Note: [About the last test point] The calculation cost from 00:00:00 to dd:hh:mm can avoid the problem of crossing the sky, such as 01:12:00 to 02:02:00
#include <iostream>
#include <map>
#include <vector>
#include <algorithm>
using namespace std;
struct node {
string name;
int status, month, time, day, hour, minute;
};
bool cmp(node a, node b) {
return a.name != b.name ? a.name < b.name : a.time < b.time;
}
double billFromZero(node call, int *rate) {
double total = rate[call.hour] * call.minute + rate[24] * 60 * call.day;
for (int i = 0; i < call.hour; i++)
total += rate[i] * 60;
return total / 100.0;
}
int main() {
int rate[25] = {0}, n;
for (int i = 0; i < 24; i++) {
scanf("%d", &rate[i]);
rate[24] += rate[i];
}
scanf("%d", &n);
vector<node> data(n);
for (int i = 0; i < n; i++) {
cin >> data[i].name;
scanf("%d:%d:%d:%d", &data[i].month, &data[i].day, &data[i].hour, &data[i].minute);
string temp;
cin >> temp;
data[i].status = (temp == "on-line") ? 1 : 0;
data[i].time = data[i].day * 24 * 60 + data[i].hour * 60 + data[i].minute;
}
sort(data.begin(), data.end(), cmp);
map<string, vector<node> > custom;
for (int i = 1; i < n; i++) {
if (data[i].name == data[i - 1].name && data[i - 1].status == 1 && data[i].status == 0) {
custom[data[i - 1].name].push_back(data[i - 1]);
custom[data[i].name].push_back(data[i]);
}
}
for (auto it : custom) {
vector<node> temp = it.second;
cout << it.first;
printf(" %02d\n", temp[0].month);
double total = 0.0;
for (int i = 1; i < temp.size(); i += 2) {
double t = billFromZero(temp[i], rate) - billFromZero(temp[i - 1], rate);
printf("%02d:%02d:%02d %02d:%02d:%02d %d $%.2f\n", temp[i - 1].day, temp[i - 1].hour, temp[i - 1].minute, temp[i].day, temp[i].hour, temp[i].minute, temp[i].time - temp[i - 1].time, t);
total += t;
}
printf("Total amount: $%.2f\n", total);
}
return 0;
}