1095. Cars on Campus

原创 2015年11月18日 14:32:43

1095. Cars on Campus (30)

时间限制
220 ms
内存限制
65536 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue

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<iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<string>
#include<stdio.h>
#include<string.h>
using namespace std;

struct Record
{
	int time;
	bool status;
	Record(int t, int s):time(t), status(s) {}
};

bool cmp(Record* r1, Record* r2)
{
	return r1->time < r2->time;
}

int timeToInt(int h, int m, int s)
{
	return h*3600+m*60+s;
}

vector<vector<Record*> > v;
map<string, int> m1;
map<int, string> m2;

int main()
{
	freopen("F://Temp/input.txt", "r", stdin);
	
	int record_num, query_num, m_index = 0;
	cin>>record_num>>query_num;
	
	for(int i = 0; i < record_num; i ++)
	{
		string str, status;
		int hour, min, sec;
		cin>> str;
		scanf("%d:%d:%d", &hour, &min, &sec);
		cin>>status;
		
		Record *rec = new Record(timeToInt(hour, min, sec), status == "in" ? true : false);
		
		if(m1.find(str) == m1.end())
		{
			m2[m_index] = str;
			m1[str] = m_index ++;
			vector<Record*> VR;
			VR.push_back(rec);
			v.push_back(VR);
		}
		else
			v[m1[str]].push_back(rec);
	}
	
	int *sum_time = new int[v.size()];
	
	for(int i = 0; i < v.size(); i ++)
		sum_time[i] = 0;
	
	
	vector<Record*> vt;
	for(int i = 0; i < v.size(); i ++)
	{
		sort(v[i].begin(), v[i].end(), cmp);
		int j = 0;
		for(int j = 0; j < v[i].size()-1; j ++)
		{
			if(v[i][j]->status == true && v[i][j+1]->status == false)
			{
				vt.push_back(v[i][j]);
				vt.push_back(v[i][j+1]);
				sum_time[i] += v[i][j+1]->time - v[i][j]->time;
			}
		}	
	}
	
	sort(vt.begin(), vt.end(), cmp);
	
	int *car_sum = new int[vt.size()];
	car_sum[0] = 1;
	for(int i = 1; i < vt.size(); i ++)
	{
		if(vt[i]->status == true)
			car_sum[i] = car_sum[i-1] + 1;
		else
			car_sum[i] = car_sum[i-1] - 1;
	}
	
	int time_index = 0;//指示上一个查询的时间位置在哪里
	for(int i = 0; i < query_num; i ++)
	{
		int hour, min, sec;
		scanf("%d:%d:%d", &hour, &min, &sec);
		int query_time = timeToInt(hour, min, sec);
		while(time_index < vt.size() && vt[time_index]->time <= query_time)
			time_index ++;
		cout<<car_sum[time_index - 1]<<endl;
	}
	
	int max_time = 0;
	vector<int> vmax_index;
	for(int i = 0; i < v.size(); i ++)
	{
		if(sum_time[i] > max_time)
		{
			vmax_index.clear();
			vmax_index.push_back(i);
			max_time = sum_time[i];
		}
		else if(sum_time[i] == max_time)
			vmax_index.push_back(i);
	}
	
	
	for(int i = 0; i < vmax_index.size(); i ++)
		cout<<m2[vmax_index[i]]<<" ";
	printf("%02d:%02d:%02d", max_time/3600, max_time/60%60, max_time%60);
	
	return 0;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。 举报

相关文章推荐

1095.Cars on Campus

【题意】         给出一些车进出校园的记录,计算特定时间点停在学校里的车的数量,并输出停的时间最长的车的车牌号以及停车时长。 【思路】         这题和1016有点像,都要匹配 i...

1095. Cars on Campus

1095. Cars on Campus (30) 时间限制 220 ms 内存限制 65536 kB 代码长度限制 16000 B...

精选:深入理解 Docker 内部原理及网络配置

网络绝对是任何系统的核心,对于容器而言也是如此。Docker 作为目前最火的轻量级容器技术,有很多令人称道的功能,如 Docker 的镜像管理。然而,Docker的网络一直以来都比较薄弱,所以我们有必要深入了解Docker的网络知识,以满足更高的网络需求。

1095. Cars on Campus (30)

题目: Zhejiang University has 6 campuses and a lot of gates. From each gate we can collect the in...

1095. Cars on Campus (30)

看了几个别人写的,感觉这个还不错 http://blog.csdn.net/xyt8023y/article/details/48029443 写一次理解: 1.首先把这N条记录存储起来,按...

1095. Cars on Campus (30)

重点是对stl的使用,真不知允许使用stl是好是坏

1095. Cars on Campus (30)

题目地址:http://www.patest.cn/contests/pat-a-practise/1095这题处理起来比较繁 下面是24分的代码,可能是题目理解错了#include #inclu...

1095. Cars on Campus (30)

题目如下: Zhejiang University has 6 campuses and a lot of gates. From each gate we can collect the in...

1095. Cars on Campus (30)

注释已经很详细了,我只想说有个坑,同一时间进车出车正好要进行输出,此时是先进出车后再计算车的数量进行输出的#include #include #include #include #include #p...

1095. Cars on Campus (30)

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

1095. Cars on Campus (30)

Zhejiang University has 6 campuses and a lot of gates. From each gate we can collect the in/out time...
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)