读入每条记录,输出每个用户的账单。需要按用户名字典序排序。将每条记录存储到对应用户的节点中,根据时间顺序排序,选择相连的两条分别为online和offline的记录输出。计算话费的时候注意有可能是跨天的。时间的读入格式是月:日:时:分。最后筛选有效记录和输出如果分开会超时,所以就并一起了,加个flag判断该用户是否存在有效记录。
写这种题总是很累,老是要扣很久的细节,瘫
#include <stdio.h>
#include <vector>
#include <string>
#include <string.h>
#include <algorithm>
#include <math.h>
using namespace std;
struct Rec{
bool online;
int time;
Rec(bool on,int t):time(t),online(on){};
friend bool operator <(Rec a,Rec b){
return a.time<b.time;
}
};
struct Node{
int month;
string name;
vector<Rec> record;
friend bool operator <(Node a,Node b){
return a.name<b.name;
}
};
int cost[24];
int cnt(int time1,int time2){//单位分钟
int sum=0.0;
int day1=time1/60/24,day2=time2/60/24;
while(time1/60!=time2/60){//不在同一个小时
sum+=((time1/60+1)*60-time1)*cost[(time1/60)%24];
time1=(time1/60+1)*60;
day1=time1/60/24,day2=time2/60/24;
}
sum+=(time2-time1)*cost[time1/60%24];
return sum;
}
vector<Node> users;
int findUser(string name,int month){
for(int i=0;i<users.size();i++){
if(strcmp(users[i].name.c_str(),name.c_str())==0 && users[i].month==month)return i;
}
Node node;
node.name=name;
node.month=month;
users.push_back(node);
return users.size()-1;
}
int main() {
for(int i=0;i<24;i++) scanf("%d",&cost[i]);
int rcdNum;
scanf("%d",&rcdNum);
int month;
for(int i=0;i<rcdNum;i++){
string name,state;
name.resize(25);
state.resize(10);
int h,m,day;
scanf("%s %d:%d:%d:%d %s",&name[0],&month,&day,&h,&m,&state[0]);
int idx=findUser(name,month);
users[idx].record.push_back(Rec(strcmp(state.c_str(),"on-line")==0,day*24*60+h*60+m));
}
sort(users.begin(),users.end());
for(int i=0;i<users.size();i++){
int fl=-1;
sort(users[i].record.begin(),users[i].record.end());
int sum=0;
for(int j=0;j<users[i].record.size()-1;j++){
if(users[i].record[j].online && !users[i].record[j+1].online){
if(fl==-1)fl=1;
int time1=users[i].record[j].time;
int time2=users[i].record[j+1].time;
int cst=cnt(time1,time2);
sum+=cst;
if(fl==1){
printf("%s %02d\n",users[i].name.c_str(),users[i].month);
fl=0;
}
printf("%02d:%02d:%02d %02d:%02d:%02d %d $%.2f\n",time1/(24*60),time1%(24*60)/60,time1%60,time2/(24*60),time2%(24*60)/60,time2%60,time2-time1,cst/100.0);
}
}
if(fl==0)printf("Total amount: $%.2f\n",sum/100.0);
}
}