PAT甲级1016 【Phone Bills】 (25)

分析：时间模拟总是让人头痛，感觉这题是WA最多发的一题，坑点在于如果用户没有有效通话记录则不需要输出，我一开始注意到了就没输出开头，结果大意输出了“Total amount..."，我还一直以为是时间或者其他出了问题导致WA哭。。以后还是要仔细审题aaaaaa

#include<iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std; 

typedef struct Record{
	int mon, day, h, m, status; //status 1-online 0-offline
	string name;
}Record;
Record rec[1010];
int toll[25];
bool cmp(Record a, Record b){
	if(a.name != b.name) return a.name < b.name;
	if(a.day != b.day) return a.day < b.day;
	if(a.h != b.h) return a.h < b.h;
	return a.m < b.m;
}
int getT(Record a, Record b){
	return b.day*24*60+b.h*60+b.m - a.day*24*60-a.h*60-a.m;
}
double getM(Record a, Record b){
	double money = 0;
	while(a.day != b.day || a.h != b.h || a.m != b.m){
		money += toll[a.h];
		a.m++;
		if(a.m > 59){
			a.m -= 60;
			a.h++;
		}
		if(a.h > 23){
			a.h -= 24;
			a.day++;
		}
	}
	return money/100.0;
}
int main(){
	//freopen("in.txt", "r", stdin);
	int n, i, j;
	string status;
	for(i = 0; i<24; i++)
		cin >> toll[i];		
	cin >> n;
	for(i = 0; i<n; i++){
		cin >> rec[i].name;
		scanf("%d:%d:%d:%d", &rec[i].mon, &rec[i].day, &rec[i].h, &rec[i].m);
		cin >> status;
		rec[i].status = status == "on-line" ? 1 : 0;
	}
	sort(rec, rec+n, cmp);
	for(i = 0; i<n; i++){
		bool flag = true;
		double sum = 0;
		for(j = i; j+1 < n && rec[j+1].name == rec[j].name; j++){
			if(rec[j].status == 1 && rec[j+1].status == 0){
				if(flag) {
					flag = false;
					printf("%s %02d\n", rec[i].name.c_str(), rec[i].mon);
				}
				double money = getM(rec[j], rec[j+1]);
				printf("%02d:%02d:%02d %02d:%02d:%02d %d $%.2f\n", rec[j].day, 
					rec[j].h, rec[j].m, rec[j+1].day, rec[j+1].h, rec[j+1].m, getT(rec[j], rec[j+1]), money);	
				sum += money;
			}
		}
		if(!flag) printf("Total amount: $%.2f\n", sum);
		i = j;
	}
	return 0;
}