PAT 1016 Phone Bills

1016. Phone Bills (25)

预处理出dp，排序，模拟题关键是逻辑的处理。

#include<cstdio>
#include<string.h>
#include<algorithm>
using namespace std;
const int N=1002;

int bill[25],n,t[N],cnt=0;
int dp[32][25][61];//从月初开始打电话消耗的钱
struct records{
	char name[22],state[20];
	int mon,day,hh,mm;
}rec[N];
int cmp(records a,records b){
	int k=strcmp(a.name,b.name);
	if(k==0){
		if(a.day!=b.day)
			return a.day<b.day;
		if(a.hh!=b.hh)
			return a.hh<b.hh;
		return a.mm<b.mm;
	}
	return k<0;
}

void print(){
	if(cnt==0) return;
	double sum=0,money;
	printf("%s %02d\n",rec[t[0]].name,rec[t[0]].mon);
	for(int i=0;i<cnt;i+=2){
		int x=t[i],y=t[i+1],minute=(rec[y].day-rec[x].day)*1440+(rec[y].hh-rec[x].hh)*60+(rec[y].mm-rec[x].mm);
		money=(dp[rec[y].day][rec[y].hh][rec[y].mm]-dp[rec[x].day][rec[x].hh][rec[x].mm])*0.01;
		sum+=money;
		printf("%02d:%02d:%02d %02d:%02d:%02d %d $%.2lf\n",rec[x].day,rec[x].hh,rec[x].mm,rec[y].day,rec[y].hh,rec[y].mm,minute,money);
	}
	printf("Total amount: $%.2lf\n",sum);
	cnt=0;
}

void solve(){
	char tname[22];
	int state=0,tid;
	for(int i=0;i<=n;i++){
		if(strcmp(tname,rec[i].name))//name不同
			state=0,print();
		if(state==0)
			strcpy(tname,rec[i].name);
		if(!strcmp(rec[i].state,"on-line"))
			tid=i,state=1;
		if(state==1)//有online
			if(!strcmp(rec[i].state,"off-line"))
				t[cnt++]=tid,t[cnt++]=i,state=0;
	}
}

int main(){
	for(int i=0;i<24;i++) 
		scanf("%d",&bill[i]);
	for(int day=1;day<32;day++){
		for(int hh=0;hh<24;hh++)
			for(int mm=0;mm<60;mm++){
				if(day==1&&hh==0&&mm==0)
					dp[day][hh][mm]=0;
				else if(hh==0&&mm==0)
					dp[day][hh][mm]=dp[day-1][23][59]+bill[23];
				else if(mm==0)
					dp[day][hh][mm]=dp[day][hh-1][59]+bill[hh-1];
				else
					dp[day][hh][mm]=dp[day][hh][mm-1]+bill[hh];
			}
	}
	scanf("%d",&n);
	for(int i=0;i<n;i++)
		scanf("%s %d:%d:%d:%d %s",rec[i].name,&rec[i].mon,&rec[i].day,&rec[i].hh,&rec[i].mm,rec[i].state);
	sort(rec,rec+n,cmp);
	solve();
	return 0;
}