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;
}


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

pat-A 1095. Cars on Campus (30)

水题一个,不是很难 直接将记录按时间排序,连续出现两个或者多个in只保存最后那个,出现out时直接把上个保存的值取出来。需要一个in时间,in时间为0表示没有存in,这种out需要舍弃。这里赌了一把...
  • dream_never_giveup
  • dream_never_giveup
  • 2016年12月24日 09:26
  • 305

PAT 1095 Cars on Campus 模拟

题目链接: PAT1095 题意 : 有一个学校,每天会有很多车进出;给出N条车辆进出情况和M条询问 每条询问输出当前校园有多少辆车,时间从0点24点  最后输出停留最久的车的...
  • AXuan_K
  • AXuan_K
  • 2015年07月17日 17:47
  • 1345

1095. Cars on Campus

题意 :有一个学校,每天会有很多车进出;给出N条车辆进出情况和M条询问每条询问输出当前校园有多少辆车,时间从0点24点 最后输出停留最久的车的车牌号和停留时间, 如果有多个,则按字典序输出车牌号注...
  • u012963126
  • u012963126
  • 2015年10月28日 17:32
  • 222

1095. Cars on Campus (30)

题目: Zhejiang University has 6 campuses and a lot of gates. From each gate we can collect the in...
  • Yangsongtao1991
  • Yangsongtao1991
  • 2015年03月16日 11:27
  • 1907

1095. Cars on Campus 解析

当前时刻停车厂有多少车,然后一天下来停的最久的车是哪几辆,时间是多久。 注意: in、out是有不匹配的情况的。 还有题目里面说一辆车不会同时进出。我理解成几辆车不会同时进出了。结果发现样例都有...
  • sheepyWYY
  • sheepyWYY
  • 2017年05月05日 17:17
  • 191

【PAT】1095. Cars on Campus

考查点:排序,模拟题 提交情况:第一次错误,在m次查询过程同时优化和更新最大值冲突,搞了半天才发现,第二次超时,主要没用到m次查询是递增这一条件,这里每次查询不能都把整个数组都遍历一般,数组遍历只需...
  • KID_LWC
  • KID_LWC
  • 2017年02月23日 19:50
  • 164

PAT 1095. Cars on Campus

Zhejiang University has 6 campuses and a lot of gates. From each gate we can collect the in/out time...
  • solin205
  • solin205
  • 2015年03月19日 13:17
  • 467

PAT 1095. Cars on Campus

#include&lt;iostream&gt; #include&lt;algorithm&gt; #include&lt;vector&gt; #i...
  • dingxm_
  • dingxm_
  • 2018年02月10日 18:28
  • 11

PAT1095Cars on Campus

题目链接: http://www.nowcoder.com/pat/5/problem/4319 题目大意:1.是统计每个时间校园内有多少辆车2.是找出在校园内呆的时间最久的车比较肉的模拟类问题,...
  • codeTZ
  • codeTZ
  • 2015年11月19日 18:18
  • 739

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...
  • qq_33193309
  • qq_33193309
  • 2017年07月27日 21:55
  • 89
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:1095. Cars on Campus
举报原因:
原因补充:

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