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 (≤), the number of records, and K (≤) 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 <iostream>
#include <vector>
#include <string>
#include <unordered_map>
#include <algorithm>
using namespace std;
struct Node
{
string ID;
bool flag;//1是进,0是出
int time;
Node(string s, bool f, int t) :ID(s), flag(f), time(t) {}
};
vector<Node>Cars;
unordered_map<string, vector<Node>>map;//一辆车不止一个记录
vector<string>res;
int N, K, maxTime = ;
int main()
{
cin >> N >> K;
string ID, flag;
int h, m, s;
while (N--)
{
cin >> ID;
scanf("%d:%d:%d", &h, &m, &s);
cin >> flag;
map[ID].push_back(Node(ID, flag == "in", h * + m * + s));
}
for (auto ptr = map.begin(); ptr != map.end(); ++ptr)
{
sort(ptr->second.begin(), ptr->second.end(), [](Node a, Node b) {return a.time < b.time; });
int t = ;
for (int i = ; i < ptr->second.size()-; ++i)
{
if (ptr->second[i].flag == && ptr->second[i + ].flag == )//一进一出
{
Cars.push_back(ptr->second[i]);//记录合法时间
Cars.push_back(ptr->second[i + ]);//记录合法时间
t += ptr->second[i + ].time - ptr->second[i].time;//累加停车时间
}
}
if (t > maxTime)
{
maxTime = t;
res.clear();
res.push_back(ptr->first);
}
else if(t==maxTime)
res.push_back(ptr->first);
}
sort(Cars.begin(), Cars.end(), [](Node a, Node b) {return a.time < b.time; });
int num = , i = ;
while (K--)
{
scanf("%d:%d:%d", &h, &m, &s);
int time = h * + m * + s;
for (; i < Cars.size() && Cars[i].time <= time; ++i)
num += Cars[i].flag ? : -;//使用用-1表示该车开出去了
cout << num << endl;
}
sort(res.begin(), res.end());
for (auto v : res)
cout << v << " ";
printf("%02d:%02d:%02d\n", maxTime / , maxTime % / , maxTime % );
return ;
}
最新文章
- 部署 OpenStack VirtualBox
- PostgreSQL Replication之第十一章 使用Skytools(1)
- Linux下通过crontab及expect实现自动化处理
- 黄聪:wordpress如何使用get_avatar禁止调用gravatar头像,替换为自定义头像
- CCJ PRML Study Note - Chapter 1.6 : Information Theory
- CSMA/CD协议——学习笔记
- javascript中的简单三角函数
- C#语法糖: 扩展方法(常用)
- jbpmAPI-1
- 从头学起android&;lt;android基本的绘图.四十六.&;gt;
- 一般处理程序装配数据到html页的原理
- SmartCoder每日站立会议02
- Lua中使用table实现的其它5种数据结构
- C++小结:迟到的小结和重新起航的故事
- 复制CentOS虚拟机网络配置
- MYSQL 问题小总结
- follow me
- Flume NG初次使用
- 简述 ascii、unicode、utf-8、gbk 的关系 (全网最全!!!)
- Linux的用户及权限相关