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
/*思路:先按车牌->时间排序,排序完后删去无用信息,再按时间->车牌排序,这是为了后面搭配按时间顺序
递增的查询,用map来保存最长时间的车牌,最后输出即可*/
#include <bits/stdc++.h>
using namespace std;
struct cars
{
string id;
int hh,mm,ss,time;
bool flag;
};
bool cmp1(cars a,cars b)
{
if(a.id!=b.id) return a.id<b.id;
else return a.time<b.time;
}
bool cmp2(cars a,cars b)
{
if(a.time!=b.time) return a.time<b.time;
else return a.id<b.id;
}
int main()
{
int n,k;
scanf("%d %d",&n,&k);
vector<cars> v;
for(int i=0;i<n;i++)
{
cars car;
string temp;
cin>>car.id;
//mp[car.tempid]=i;
scanf("%d:%d:%d",&car.hh,&car.mm,&car.ss);
car.time=car.hh*3600+car.mm*60+car.ss;
cin>>temp;
car.flag=(temp=="in")?true:false;
v.push_back(car);
}
sort(v.begin(),v.end(),cmp1);
/*printf("\n");
for(int i=0;i<v.size();i++)
{
cout<<v[i].id;
printf(" %02d:%02d:%02d ",v[i].hh,v[i].mm,v[i].ss);
if(v[i].flag==true) printf("in\n");
else printf("out\n");
}*/
vector<cars> change;
map<string,int> mp;
int longest=0;
for(int i=1;i<v.size();i++)
{
if((v[i].id==v[i-1].id)&&((v[i-1].flag==true)&&(v[i].flag==false)))
{
change.push_back(v[i-1]);
change.push_back(v[i]);
longest=max(longest,mp[v[i].id]+(v[i].time-v[i-1].time)); //注意时间最长的车可能是多次进出的累加值(测试点4)
mp[v[i].id]+=(v[i].time-v[i-1].time);
}
}
sort(change.begin(),change.end(),cmp2);
/*printf("\n");
for(int i=0;i<change.size();i++)
{
cout<<change[i].id;
printf(" %02d:%02d:%02d ",change[i].hh,change[i].mm,change[i].ss);
if(change[i].flag==true) printf("in\n");
else printf("out\n");
}*/
int st=0,cnt=0;//st为目前遍历到的车,cnt为当前学校里车的数量
for(int i=0;i<k;i++) //如果用双重顺序循环会超时
{
int temph,tempm,temps,temptime;
scanf("%d:%d:%d",&temph,&tempm,&temps);
temptime=temph*3600+tempm*60+temps;
while(st<change.size())
{
if(change[st].time<=temptime) //如果在时间范围内
{
if(change[st].flag==true) cnt++;
else cnt--;
st++; //记录下次访问的位序
}
else break;
}
printf("%d\n",cnt);
}
for(auto it:mp)
{
if(it.second==longest) cout<<it.first<<" ";
}
int hour=longest/3600;
int minute=(longest-hour*3600)/60;
int second=longest-hour*3600-minute*60;
printf("%02d:%02d:%02d\n",hour,minute,second);
system("pause");
return 0;
}