PTA A1016 Phone Bills&A1095 Cars on Campus

B1016 Phone Bills

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-line
结尾无空行
Sample Output:
CYJJ 01
01:05:59 01:07:00 61 $12.10
Total amount: $12.10
CYLL 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
记录点：

1. cmp函数的编写

bool cmp(stu a1,stu b){
	int i=strcmp(a1.name,b.name);
	if(i!=0) return i<0;//优先按照姓名字典顺序从小到大排序 
	else if (a1.MM!=b.MM) return a1.MM<b.MM;
	else if(a1.dd!=b.dd) return a1.dd<b.dd;
}

2. on-line和off-line的寻找配对
3. 同一用户和下一个用户

#include<bits/stdc++.h>
using namespace std;
int a[24];
struct stu{
	char name[20];
	int MM,dd,HH,mm;
	char onoff[20];
}s[1000],temp;
bool cmp(stu a1,stu b){
	int i=strcmp(a1.name,b.name);
	if(i!=0) return i<0;//优先按照姓名字典顺序从小到大排序 
	else if (a1.MM!=b.MM) return a1.MM<b.MM;
	else if(a1.dd!=b.dd) return a1.dd<b.dd;
	else if(a1.HH!=b.HH) return a1.HH<b.HH;
	else if(a1.mm!=b.mm) return a1.mm<b.mm;
	
}
void get_ans(int on,int off,int &time,int &money){
	temp=s[on];
	while(temp.dd<s[off].dd||temp.HH<s[off].HH||temp.mm<s[off].mm){
		time++;
		money+=a[temp.HH];
		temp.mm++;
		if(temp.mm>=60){
			temp.mm=0;
			temp.HH++;
		}
		if(temp.HH>=24){
			temp.HH=0;
			temp.dd++;
		}
	}
}
int main(){
	int n,i;
	for(int i=0;i<24;i++){
		scanf("%d",&a[i]);
	} 
	scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf("%s%d:%d:%d:%d%s",s[i].name,&s[i].MM,&s[i].dd,&s[i].HH,&s[i].mm,s[i].onoff);
	}
	sort(s,s+n,cmp);
	int on=0,off,next;
	while(on<n){
		int needPrint=0;
		next=on;
		while(next<n&&strcmp(s[next].name,s[on].name)==0){//同一个用户 
			if(needPrint==0&&strcmp(s[next].onoff,"on-line")==0) 
				needPrint=1;//找到on
			else if(needPrint==1&&strcmp(s[next].onoff,"off-line")==0) 
				needPrint=2;
			next++;			 
		}
		if(needPrint<2){
			//没有找到对应的on-off
			on=next;continue; 
		}
		int Allmoney=0;
		printf("%s %02d\n",s[on].name,s[on].MM);
		while(on<next){//寻找该用户的所有配对 
			while(on<next-1&&!(strcmp(s[on].onoff,"on-line")==0&&strcmp(s[on+1].onoff,"off-line")==0)) {
				on++;//直到找到连续的on-line and off 
			}
			off=on+1;
			if(off==next){
				on=next;
				break;
			}
			printf("%02d:%02d:%02d ",s[on].dd,s[on].HH,s[on].mm);
			printf("%02d:%02d:%02d ",s[off].dd,s[off].HH,s[off].mm);
			int time=0,money=0;
			get_ans(on,off,time,money);
			Allmoney+=money;
			printf("%d $%.2f\n",time,money/100.0);
			on=off+1;
		}
		printf("Total amount: $%.2f\n",Allmoney/100.0);
	}
    return 0;
}

A1095 Cars on Campus

Zhejiang University has 8 campuses and a lot of gates. From each gate we can collect the in/out times and the plate numbers of the cars crossing the gate. Now with all the information available, you are supposed to tell, at any specific time point, the number of cars parking on campus, and at the end of the day find the cars that have parked for the longest time period.

Input Specification:
Each input file contains one test case. Each case starts with two positive integers N (≤10
4
), the number of records, and K (≤8×10
4
) the number of queries. Then N lines follow, each gives a record in the format:

plate_number hh:mm:ss status
where plate_number is a string of 7 English capital letters or 1-digit numbers; hh:mm:ss represents the time point in a day by hour:minute:second, with the earliest time being 00:00:00 and the latest 23:59:59; and status is either in or out.

Note that all times will be within a single day. Each in record is paired with the chronologically next record for the same car provided it is an out record. Any in records that are not paired with an out record are ignored, as are out records not paired with an in record. It is guaranteed that at least one car is well paired in the input, and no car is both in and out at the same moment. Times are recorded using a 24-hour clock.

Then K lines of queries follow, each gives a time point in the format hh:mm:ss. Note: the queries are given in ascending order of the times.

Output Specification:
For each query, output in a line the total number of cars parking on campus. The last line of output is supposed to give the plate number of the car that has parked for the longest time period, and the corresponding time length. If such a car is not unique, then output all of their plate numbers in a line in alphabetical order, separated by a space.

Sample Input:
16 7
JH007BD 18:00:01 in
ZD00001 11:30:08 out
DB8888A 13:00:00 out
ZA3Q625 23:59:50 out
ZA133CH 10:23:00 in
ZD00001 04:09:59 in
JH007BD 05:09:59 in
ZA3Q625 11:42:01 out
JH007BD 05:10:33 in
ZA3Q625 06:30:50 in
JH007BD 12:23:42 out
ZA3Q625 23:55:00 in
JH007BD 12:24:23 out
ZA133CH 17:11:22 out
JH007BD 18:07:01 out
DB8888A 06:30:50 in
05:10:00
06:30:50
11:00:00
12:23:42
14:00:00
18:00:00
23:59:00
结尾无空行
Sample Output:
1
4
5
2
1
0
1
JH007BD ZD00001 07:20:09
这题意和我理解的不一样啊醉了不要自己臆想
map的操作
统计有效记录

for(i=0;i<n-1;i++){
		if(!strcmp(s[i].name,s[i+1].name)&&
		s[i].f==1&&
		s[i+1].f==0){
			valid[num++]=s[i];
			valid[num++]=s[i+1];
			int intime=s[i+1].time-s[i].time;
			if(parktime.count(s[i].name)==0){
				parktime[s[i].name]=0;//map里面没有这个车牌号，置0,初始化 
			}
			parktime[s[i].name]+=intime;
			maxtime=max(maxtime,parktime[s[i].name]); 	
			}
	}

统计在校车辆的数量

while(now<num&&valid[now].time<=tmp){
			if(valid[now].f==1) numcar++;
			else numcar--;
			now++;
		} 

#include<bits/stdc++.h>
using namespace std;
struct car{
	char name[8];
	int time;
	char in_out[4];
	bool f;
}s[10000],valid[10000];
int num=0;//有效记录的条数
map<string,int> parktime;//车牌号->总停留时间
 
bool cmp(car a,car b){
	if(strcmp(a.name,b.name)) return strcmp(a.name,b.name)<0;
	else if(a.time!=b.time) return a.time<b.time;
}
bool cmpbytime(car a,car b){
	return a.time<b.time;
}
int main(){
	int n,k,i,t1,t2,t3,tmp;
	scanf("%d%d",&n,&k);
	for(i=0;i<n;i++){
		scanf("%s%d:%d:%d%s",s[i].name,&t1,&t2,&t3,s[i].in_out);
		s[i].time=t3+t1*60*60+t2*60;
		if(strcmp(s[i].in_out,"in")==0) s[i].f=true;
		else s[i].f=false;
	}
	sort(s,s+n,cmp);
	int maxtime=-1;//最长停留时间
	for(i=0;i<n-1;i++){
		if(!strcmp(s[i].name,s[i+1].name)&&
		s[i].f==1&&
		s[i+1].f==0){
			valid[num++]=s[i];
			valid[num++]=s[i+1];
			int intime=s[i+1].time-s[i].time;
			if(parktime.count(s[i].name)==0){
				parktime[s[i].name]=0;//map里面没有这个车牌号，置0,初始化 
			}
			parktime[s[i].name]+=intime;
			maxtime=max(maxtime,parktime[s[i].name]); 	
			}
	} 
	sort(valid,valid+num,cmpbytime);
	int now=0,numcar=0;
	//now指向不超过当前查询时间的记录 
	for(i=0;i<k;i++){
		scanf("%d:%d:%d",&t1,&t2,&t3);
		tmp=t3+t2*60+t1*3600;
		while(now<num&&valid[now].time<=tmp){
			if(valid[now].f==1) numcar++;
			else numcar--;
			now++;
		} 
		printf("%d\n",numcar);
	}
	map<string,int>::iterator it;//遍历所有的车牌号
	for(it=parktime.begin();it!=parktime.end();it++){
		if(it->second==maxtime){
			printf("%s ",it->first.c_str());
		}
	} 
	printf("%02d:%02d:%02d\n",maxtime/3600,maxtime%3600/60,maxtime%60);
	return 0;
}