PAT甲级——Cars on Campus

题目描述

Zhejiang University has 6 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.

 

输入描述:

Each input file contains one test case.  Each case starts with two positive integers N (<= 10000), the number of records, and K (<= 80000) 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.

 

输出描述:

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.

 

输入例子:

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

 

输出例子:

1
4
5
2
1
0
1
JH007BD ZD00001 07:20:09

思路：

1. 用Car结构体存放车辆的信息（车牌号、时间、记录类型）。用Car型的all数组存放所有数据，应Car型的valid数组存放有效的数据。
2. 将所有的数据存入all数组，先按车牌号从小到大，车牌相同再按时间从小到大排序。
3. 遍历所有记录，查找有效的记录，并将其存入valid数组。
4. 将valid数组按时间从小到大排序，进入查询阶段，遇到“in”时，numCar加一，遇到“on”时，numcar减一。
5. 遍历parkTime，输出总停留时间等于maxTime的车辆号牌和对应的时间。

代码好像有点小问题，后面再改一下

#include <iostream>
#include<cstring>
#include<string>
#include<map>
#include<algorithm>
using namespace std;
const int maxn = 10010;
struct Car {
	char id[8];
	int time;
	char status[4];
}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()
{
	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];
		valid[num++] = all[i + 1];
		int inTime = all[i + 1].time - all[i].time;
		if (parkTime.count(all[i].id) == 0) {
			parkTime[all[i].id] = 0;
		}
		parkTime[all[i].id] += inTime;
		maxTime = max(maxTime, parkTime[all[i].id]);
	}
	sort(valid, valid + num, cmpByTime);
	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;

}