1095 Cars on Campus (第一次使用map)
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
#include<cstdio>
#include<string>
#include<algorithm>
#include<map>
using namespace std;
struct record
{
char plate_number[10];
int time;
int flag;
}re[10010],valid[10010];
int hh = 0;
int mm = 0;
int ss = 0;
int num = 0; //valid
bool cmp_record(record r1, record r2)
{
if (strcmp(r1.plate_number, r2.plate_number) != 0)
{
return strcmp(r1.plate_number, r2.plate_number) < 0;
}
else
{
return r1.time < r2.time;
}
}
bool cmp_valid(record r1, record r2)
{
return r1.time < r2.time;
}
map<string, int> cars_time;
int main()
{
int num_of_record;
int num_of_query;
scanf_s("%d%d", &num_of_record, &num_of_query);
int num_of_cars = 0;
for (int i = 0; i < num_of_record; i++)
{
char flag[5] ;
scanf_s("%s %d:%d:%d %s", &re[i].plate_number, sizeof(char) * 10, &hh, &mm, &ss, &flag, sizeof(char) * 5);
if (strcmp(flag, "in") == 0)
{
re[i].flag = 0;
}
else
{
re[i].flag = 1;
}
re[i].time = hh * 3600 + mm * 60 + ss;
}
sort(re, re + num_of_record, cmp_record);
int maxtime = -1;
for (int i = 0; i < num_of_record-1; i++)
{
if (strcmp(re[i].plate_number, re[i + 1].plate_number) == 0 && re[i].flag == 0 && re[i + 1].flag == 1)
{
valid[num++] = re[i];
valid[num++] = re[i + 1];
int time_stay = re[i + 1].time - re[i].time;
if (cars_time.count(re[i].plate_number) == 0)
{
cars_time[re[i].plate_number] = 0;
}
cars_time[re[i].plate_number] += time_stay;
maxtime = max(maxtime, cars_time[re[i].plate_number]);
}
}
sort(valid, valid + num, cmp_valid);
for (int i = 0; i < num_of_query; i++)
{
scanf_s("%d:%d:%d", &hh, &mm, &ss);
int time_now = hh * 3600 + mm * 60 + ss;
int now = 0;
int num_cars = 0;
while (now < num && valid[now].time <= time_now)
{
if (valid[now].flag == 0)
{
num_cars++;
}
else
{
num_cars--;
}
now++;
}
printf("%d\n", num_cars);
}
map<string, int>::iterator it = cars_time.begin();
for (; it != cars_time.end(); it++)
{
if (it->second == maxtime)
{
printf("%s ", it->first.c_str());
}
}
hh = maxtime / 3600;
maxtime = maxtime % 3600;
mm = maxtime / 60;
ss = maxtime % 60;
printf("%02d:%02d:%02d\n", hh, mm, ss);
}