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.

Input Specification:

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.

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<iostream>
#include<algorithm>
#include<string.h>
#include<string>
#include<map>
using namespace std;
typedef struct{
char id[];
int time;
int in;
}info;
bool cmp(info a, info b){
if(strcmp(a.id, b.id) != )
return strcmp(a.id, b.id) < ;
else return a.time < b.time;
}
bool cmp2(info a, info b){
return a.time < b.time;
}
map <string, int> stay;
info data[], valid[];
int main(){
int N, K;
int hh, mm, ss, tt, maxTime = -;
char in_out[];
string id ;
scanf("%d%d", &N, &K);
for(int i = ; i < N; i++){
scanf("%s %d:%d:%d %s", data[i].id, &hh, &mm, &ss, in_out);
data[i].time = hh * + mm * + ss;
data[i].in = strcmp(in_out, "in") == ? : ;
}
sort(data, data + N, cmp);
int cnt = ;
for(int i = ; i < N - ; i++){
if(strcmp(data[i].id, data[i + ].id) == && data[i].in == && data[i + ].in == ){
id = data[i].id;
if(stay.count(id) == )
stay[id] = ;
stay[id] += (data[i + ].time - data[i].time);
if(stay[id] > maxTime)
maxTime = stay[id];
valid[cnt] = data[i];
strcpy(valid[cnt].id, data[i].id);
cnt++;
valid[cnt] = data[i + ];
strcpy(valid[cnt].id, data[i + ].id);
cnt++;
}
}
sort(valid, valid + cnt, cmp2);
int pt = , cars = ;
for(int i = ; i < K; i++){
scanf("%d:%d:%d", &hh, &mm, &ss);
tt = hh * + mm * + ss;
for( ; valid[pt].time <= tt && pt < cnt; pt++){
if(valid[pt].in == )
cars++;
else cars--;
}
printf("%d\n", cars);
}
map<string, int> :: iterator it;
for(it = stay.begin(); it != stay.end(); it++){
if(it->second == maxTime)
printf("%s ", it->first.c_str());
}
hh = maxTime / ; mm = maxTime % / ; ss = maxTime % ;
printf("%02d:%02d:%02d",hh, mm, ss);
cin >> N;
return ;
}

总结:

1、本题给出一堆车辆的出入信息,要求在任意查询时刻计算出校园内车辆数量,统计最终一天内停留时间最长的车辆。

查询校园内车辆:与A1016电话费计算一样,给出的无序记录中有些记录无法配对,是无效记录,需要处理。可以用两个数组,data数组将所有数据读入,按照车牌id和时间综合排序后,进行筛选,只有两条紧邻的且id一致且前者为in后者为out的数据才是有效数据,将其存入valid数组。然后再对vaild数组仅仅按照时间排序。处理查询时,注意到所给的查询是按照时间顺序给出的,所以可以在前一次查询的基础上累计车辆个数以减小复杂度,依次遍历vaild直至达到所要查询的时间,在过程中out一辆车则减一,in一辆则加一。

    统计停留时间最长的车:利用map存储车牌号与停留时间,车牌作为键值。在填充valid数组时,可以顺便计算该车的停留时间,累加并存在map中。设置maxTime,存储时间最大者。最后,在输出时,遍历map,找出停留时间等于maxTime的即可。

2、map用法:

#include<map>
using namespace std;
map<string, int> mp; //char数组不能作为键 if(mp.count("key_value") == ) //查询是否存在
mp["key_value"] = ; mp["key_value"] = ; // 赋值 map<string, int> :: iterator it; //遍历
for(it = mp.begin(); it != mp.end(); it++){
it->second = ; // 访问值
it->first = "aklsdj"; //访问键
}

3、C++中使用string 需要include<string>

字符数组转string: string str;     char c[10] = {'a', 'b', 'c', '\0'};      str = c;

string转字符数组: string str = “abc”;     char c[10] ;      strcpy(c, str.c_str());

4、将hh:mm:ss转换为秒,可以减少复杂度。

5、注意一辆车反复出入的情况,这时它的总停留时间需要累加。

A1095. Cars on Campus的更多相关文章

  1. A1095 Cars on Campus (30)(30 分)

    A1095 Cars on Campus (30)(30 分) Zhejiang University has 6 campuses and a lot of gates. From each gat ...

  2. 【刷题-PAT】A1095 Cars on Campus (30 分)

    1095 Cars on Campus (30 分) Zhejiang University has 8 campuses and a lot of gates. From each gate we ...

  3. PAT A1095 Cars on Campus (30 分)——排序,时序,从头遍历会超时

    Zhejiang University has 8 campuses and a lot of gates. From each gate we can collect the in/out time ...

  4. A1095 Cars on Campus (30 分)

    Zhejiang University has 8 campuses and a lot of gates. From each gate we can collect the in/out time ...

  5. PAT甲级——A1095 Cars on Campus

    Zhejiang University has 8 campuses and a lot of gates. From each gate we can collect the in/out time ...

  6. PAT_A1095#Cars on Campus

    Source: PAT A1095 Cars on Campus (30 分) Description: Zhejiang University has 8 campuses and a lot of ...

  7. PAT甲级1095. Cars on Campus

    PAT甲级1095. Cars on Campus 题意: 浙江大学有6个校区和很多门.从每个门口,我们可以收集穿过大门的汽车的进/出时间和车牌号码.现在有了所有的信息,你应该在任何特定的时间点告诉在 ...

  8. PAT 1095 Cars on Campus

    1095 Cars on Campus (30 分) Zhejiang University has 8 campuses and a lot of gates. From each gate we ...

  9. PAT甲级——1095 Cars on Campus (排序、映射、字符串操作、题意理解)

    本文同步发布在CSDN:https://blog.csdn.net/weixin_44385565/article/details/93135047 1095 Cars on Campus (30 分 ...

随机推荐

  1. 懒人小工具1:winform自动生成Model,Insert,Select,Delete以及导出Excel的方法

       懒人小工具2:T4自动生成Model,Insert,Select,Delete以及导出Excel的方法    github地址:https://github.com/Jimmey-Jiang/J ...

  2. React.js 开发参见问题 Q&A

    文章中我整理了 React.js 开发过程中一些参见问题的解答汇总,供大家参考. 1. 一些课程资源 课程完整的思维导图请查考文章:React.js 入门与实战课程思维导图,我使用的思维导图软件是 M ...

  3. TRIO-basic指令--FLEXLINK

    Type: Axis Command Syntax: FLEXLINK(base_dist, excite_dist, link_dist, base_in, base_out, excite_acc ...

  4. windows如何查看电脑开关机记录

    如何查看电脑开关机记录 (一)如果你只是想查看一下,从昨天关机到今天开机之间有没有人使用我的计算机,在“开始”菜单的运行”中输入“eventvwr.msc”,或者是按下"开始菜单" ...

  5. 归并排序O(nlogn)

    先分治再合并 代码 #include<bits/stdc++.h> using namespace std; #define ll long long int a[1000],t[1000 ...

  6. LINUX内核分析第八周学习总结——进程的切换和系统的一般执行过程

    LINUX内核分析第八周学习总结——进程的切换和系统的一般执行过程 张忻(原创作品转载请注明出处) <Linux内核分析>MOOC课程http://mooc.study.163.com/c ...

  7. 运行scrapy crawl (文件名)时显示invalid syntax和no modle 'win32api'解决方案

    使用pycharm爬取知乎网站的时候,在terminal端输入scarpy crawl zhihu,提示语法错误,如下: 原因是python3.7中将async设为关键字,根据错误提示,找到manho ...

  8. php配置虚拟主机

    在httpd.conf的目录下,新建一个配置文件virtualhost-host.conf,添加虚拟主机配置 <VirtualHost *:80> DocumentRoot "E ...

  9. 腾讯 xtestserver 基本使用教程~

    刚刚简单录制了下 腾讯demo的基本测试脚本 成功~get新技能成功~开心ing~ 体验就是: 1.各种安卓机找开发者中心选项的usb调试模式太难找了.. 2.不管录制还是播放录制时都感觉好慢... ...

  10. Ajax的注意事项

    case 1: 无论是使用原生的JavaScript,还是JQuery,通过Ajax请求后端程序数据,返回的数据默认是字符串,字符串,字符串,重要的事情说三遍!!! case 2: 不要尝试直接将返回 ...