PTA甲级 1095 Cars on Campus (30point(s))

首先,先贴柳神的博客

https://www.liuchuo.net/ 这是地址

想要刷好PTA,强烈推荐柳神的博客,和算法笔记

这一篇博客大部分都是借鉴（抄袭）的算法笔记

题目原文

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 (≤104), the number of records, and K (≤8×104) 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

生词如下

gates 大门

ascending 上升的

queries 查询

unique 独一无二的

any in records that are not paired with an out record are ignored

任何没有与out记录配对的in记录都会被忽略

翻译为,in的下一个必须是out,不然就错误

题目大意

给出N条记录，每条记录给出一辆车的的车牌号，当前时刻以及出入校情况（入校（in))还是出校（out），然后给出K个查询，每个查询给出一个时刻，输出在这个时刻校园内的车辆数，查询完毕后输出在学校内停留时间最长的车辆的车牌号（如果有多个，就一并输出）和对应的停留时间。注意：对同一辆车来讲，配对的on和off必须满足把这辆车的记录按时间顺序排列后，在他们之间，不允许出现其他的on或则off 的记录，否则，将被视为无效记录

注意点:

① 在线处理那个进入的车辆,用一个num来代表校园里面有的车辆

② 用map可以简化许多许多操作

③ 英文不行,思路也差,我这题没有写出来,都是借鉴的.

代码如下

#include<cstdio>
#include<cstring>
#include<string>
#include<map>
#include<algorithm>
using namespace std;
const int maxn = 10010;
struct Car {
	char id[10];		//车牌号
	int time;			//记录的时刻(以S作为单位）
	char status[4];		//in或者out
}all[maxn],valid[maxn];
int num = 0;
map<string, int>parktime;	//车牌号-->总记录时间
//timeToInt将时间转换位以s为单位
int timeToInt(int hh, int mm, int ss) {
	return hh * 3600 + mm * 60 + ss;
}
//先按车牌号字典序从小到大排序,若车牌号相同,则按时间从小到大排序
bool cmpByIdAndTime(Car a, Car b) {
	if (strcmp(a.id, b.id))return strcmp(a.id, b.id) < 0;
	else return a.time < b.time;
}
bool cmpByTime(Car a, Car b) {
	return a.time < b.time;
}
int main(void) {
	int n, k, hh, mm, ss;
	scanf("%d%d", &n, &k);		//记录数
	for (int i = 0; i < n; i++) {
		scanf("%s %d:%d:%d %s", all[i].id, &hh, &mm, &ss, all[i].status);
		all[i].time = timeToInt(hh, mm, ss);
	}
	sort(all, all + n, cmpByIdAndTime);
	int maxTime = -1;
	for (int i = 0; i < n - 1; i++) {	//遍历所有的记录
		if (!strcmp(all[i].id, all[i + 1].id) && !strcmp(all[i].status, "in") && !strcmp(all[i + 1].status, "out")) {
			valid[num++] = all[i];		//i和i+1是配对的,存入valid数组
			valid[num++] = all[i + 1];
			int inTime = all[i + 1].time - all[i].time;	//此次停留时间
			if (parktime.count(all[i + 1].id) == 0) {
				parktime[all[i].id] = 0;			//map中还没有这个车牌号,置零
			}
			parktime[all[i].id] += inTime;			//增加该车牌号的总停留时间
			maxTime = max(maxTime, parktime[all[i].id]);	//更新最大停留时间
		}
	}

	sort(valid, valid + num, cmpByTime);			//把有效记录按时间大小排序
	//now指向不超过当前查询时间的记录,numCar为当前校园内车辆数
	int now = 0, numCar = 0;
	for (int i = 0; i < k; i++) {
		scanf("%d:%d:%d", &hh, &mm, &ss);
		int time = timeToInt(hh, mm, ss);
		//让now处理当前查询时间
		while (now < num && valid[now].time <= time) {
			if (!strcmp(valid[now].status, "in"))
				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;

}

1095 Cars on Campus (30point(s))