【PAT】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

题目大意

给出某天的一组停车场的出入记录，对于K个查询，求查询时刻停车场内的车辆数。出入记录按时间递增排序后，连续的两条记录车牌相同，前一条为进入，后一条为离开，这样的两条记录为有效。其他记录无效。

思路

排序两次，遍历两次。

• 第一次先根据车牌后根据时间排序，遍历筛选出有效的记录，同时计算各个车牌的停留时间和最大停留时间。
• 第二次将记录按时间排序，对于每个查询，从开始时刻遍历到查询时刻的最近的上一条记录，计算停车场内的车辆数（因为查询的时间序列是递增的，所以可以这样计算）。

代码

#include <cstdio>
#include <algorithm>
#include <iostream>
#include <map>
#include <cmath>
#include <set>
using namespace std;
#define MAX_N 10000
struct Record{
   
    bool in;
    int stamp;
    string id;