1095. Cars on Campus (30)

最新推荐文章于 2021-08-23 21:19:48 发布
最新推荐文章于 2021-08-23 21:19:48 发布
阅读量1.5k 收藏
点赞数
分类专栏： C++ vector pat_advanced_level string printf sort 二分法 scanf 文章标签： C++ pat_advanced_level sort
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/u014646950/article/details/47781961
版权
C++ 同时被 3 个专栏收录
124 篇文章 1 订阅
订阅专栏
pat_advanced_level
102 篇文章 0 订阅
订阅专栏
vector
37 篇文章 0 订阅
订阅专栏
 

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
输入
N个车辆进出记录  K个要查询的时间点
N行  车牌  时间（00：00：00~23：59：59）  进in/出out
……
K行  查询的时间（对应输出这个时间点停车场的车辆数。这个时间点如果正好有车有操作，那么车辆数是操作后的 【进+1/出-1/无0】）
……
最后给出一天中累计停放的时间最长的车牌号（多个按字母序输出）   并输出这个最长时间
PS：由于K行的查询是按时间顺序进行的，那么可以直接从头搜到尾。也可以用统计放到数组里面再用二分法，测试出来的时间差不多，内存有点区别。但是如果全部用cin，cout会偶尔提交AC偶尔超时。
下面代码，一：无二分法scanf-printf；
        二：二分法scanf-prinft；
        三:二分法cin-cout（第三个看一下时间，就是会偶尔超时的那个，太酸爽了）
评测结果

  
  
时间结果得分题目语言用时(ms)内存(kB)用户
8月19日
 15:35答案正确301095C++
 (g++ 4.7.2)48948datrilla
测试点

  
  
测试点结果用时(ms)内存(kB)得分/满分
0答案正确129618/18
1答案正确119483/3
2答案正确115643/3
3答案正确13841/1
4答案正确488203/3
5答案正确108202/2
#include<iostream> 
#include<string.h>
#include<string>
#include<vector> 
#include<algorithm> 
using namespace std;  
struct carslist
{
  char plate[9];
  int time;
  bool in;
};
void readln(vector<carslist>*cars, int N)
{
  int hh, mm, ss;
  char in_out[5];
  int index; 
  for (index = 0; index < N; index++)
  { 
    scanf("%s%d:%d:%d%s", (*cars)[index].plate, &hh, &mm, &ss,in_out);  
    //cin >> (*cars)[index].plate >> hh >> in_out[0] >> mm >> in_out[0] >> ss >> in_out; 
    (*cars)[index].time = hh * 3600 + mm * 60 + ss;
    (*cars)[index].in = in_out[0] == 'i' ? true : false; 
  }
}
bool everycarsTimecmp(const carslist&A, const carslist&B)
{
  if (strcmp(A.plate,B.plate)==0)return A.time < B.time;
  else return strcmp(A.plate, B.plate)<0;
}
bool TotalTimesort(const carslist&A, const carslist&B)
{
  return A.time < B.time;
}
int KickWrong_Addlongest(vector<carslist>*cars, vector<string>*staylongest)
{
  int maxTime = 0,ThecarmaxT=0;
  string Precar=(*cars)[0].plate;
  for (vector<carslist>::iterator iter = (*cars).begin(); iter != (*cars).end(); )
  {
    if (iter->in&&iter + 1 != (*cars).end() && strcmp(iter->plate, (iter + 1)->plate)== 0 && !(iter + 1)->in) /*in_out一定成对存在，题目要求*/
    {

      if (Precar == iter->plate) 
          ThecarmaxT += (iter + 1)->time - iter->time;/*累记一整天的停车时长*/ 
      else
      {
        Precar = iter->plate;
        ThecarmaxT = (iter + 1)->time - iter->time; 
      }
      if (maxTime < ThecarmaxT)
      {
        (*staylongest).clear();
        (*staylongest).push_back(Precar);
        maxTime = ThecarmaxT;
      }
      else if (maxTime == ThecarmaxT)
        (*staylongest).push_back(Precar);
      iter += 2;
    }
    else iter = (*cars).erase(iter); 
  }
  return maxTime;
} 
void read_ans(int K, vector<carslist>*cars)
{
  int hh, mm, ss,firstindex=0,cnt=0; 
  while (K--)
  {
    //cin >> hh >>maohao>> mm>>maohao >> ss;
    scanf("%d:%d:%d", &hh, &mm, &ss); 
    hh=hh*3600+mm*60+ss;
    for (; firstindex< (*cars).size()&&(*cars)[firstindex].time<=hh;firstindex++)  
      if ((*cars)[firstindex].in)
         cnt++; 
           else cnt--;   
      printf("%d\n",cnt);
  }
} 
int main()
{  
  int N, K;
  scanf("%d%d", &N, &K); 
  vector<carslist>cars(N);
  readln(&cars, N); 
  sort(cars.begin(), cars.end(), everycarsTimecmp);  
  vector<string>staylongest;
    N=KickWrong_Addlongest(&cars,&staylongest);
  sort(cars.begin(), cars.end(), TotalTimesort);   
  read_ans(K, &cars);
  for (vector<string>::iterator iter = staylongest.begin(); iter != staylongest.end(); iter++)
     printf("%s ", (*iter).c_str());
  printf("%02d:%02d:%02d\n", N / 3600, N % 3600 / 60, N % 60); 
  system("pause");
  return 0;
}
评测结果

   
   
时间结果得分题目语言用时(ms)内存(kB)用户
8月19日
 15:00答案正确301095C++
 (g++ 4.7.2)501012datrilla
测试点

   
   
测试点结果用时(ms)内存(kB)得分/满分
0答案正确129618/18
1答案正确1110123/3
2答案正确116923/3
3答案正确14121/1
4答案正确509483/3
5答案正确109482/2

#include<iostream> 
#include<string.h>
#include<string>
#include<vector> 
#include<algorithm> 
using namespace std;  
struct carslist
{
  char plate[9];
  int time;
  bool in;
};
void readln(vector<carslist>*cars, int N)
{
  int hh, mm, ss;
  char in_out[5];
  int index; 
  for (index = 0; index < N; index++)
  { 
    scanf("%s%d:%d:%d%s", (*cars)[index].plate, &hh, &mm, &ss,in_out);  
    //cin >> (*cars)[index].plate >> hh >> in_out[0] >> mm >> in_out[0] >> ss >> in_out; 
    (*cars)[index].time = hh * 3600 + mm * 60 + ss;
    (*cars)[index].in = in_out[0] == 'i' ? true : false; 
  }
}
bool everycarsTimecmp(const carslist&A, const carslist&B)
{
  if (strcmp(A.plate,B.plate)==0)return A.time < B.time;
  else return strcmp(A.plate, B.plate)<0;
}
bool TotalTimesort(const carslist&A, const carslist&B)
{
  return A.time < B.time;
}
int KickWrong_Addlongest(vector<carslist>*cars, vector<string>*staylongest)
{
  int maxTime = 0,ThecarmaxT=0;
  string Precar=(*cars)[0].plate;
  for (vector<carslist>::iterator iter = (*cars).begin(); iter != (*cars).end(); )
  {
    if (iter->in&&iter + 1 != (*cars).end() && strcmp(iter->plate, (iter + 1)->plate)== 0 && !(iter + 1)->in) /*in_out一定成对存在，题目要求*/
    {

      if (Precar == iter->plate) 
          ThecarmaxT += (iter + 1)->time - iter->time;/*累记一整天的停车时长*/ 
      else
      {
        Precar = iter->plate;
        ThecarmaxT = (iter + 1)->time - iter->time; 
      }
      if (maxTime < ThecarmaxT)
      {
        (*staylongest).clear();
        (*staylongest).push_back(Precar);
        maxTime = ThecarmaxT;
      }
      else if (maxTime == ThecarmaxT)
        (*staylongest).push_back(Precar);
      iter += 2;
    }
    else iter = (*cars).erase(iter); 
  }
  return maxTime;
}
void numbercount(vector<int>*number, vector<carslist>*cars)
{
  int index, len = (*cars).size(),cnt;
  for (cnt=index = 0; index < len; index++)
  {
    if ((*cars)[index].in)cnt++; else cnt--;
    (*number).push_back(cnt); 
  }
}
int binaryFind_noMoretime(vector<carslist>*cars, int time,int firstindex)
{
  int lastindex = (*cars).size() - 1;
  if (lastindex == -1 || time<(*cars)[0].time)return -1;
  else if (time>(*cars)[lastindex].time) 
    return lastindex;  
  int midindex;
  while (firstindex <= lastindex)
  {
    midindex = (lastindex + firstindex) / 2;
    if ((*cars)[midindex].time > time)lastindex = midindex - 1;  
    else firstindex = midindex + 1;
  }
  return lastindex;
}
void read_ans(int K, vector<carslist>*cars, vector<int>*number)
{
  int hh, mm, ss,firstindex=0; 
  while (K--)
  {
    //cin >> hh >>maohao>> mm>>maohao >> ss;
    scanf("%d:%d:%d", &hh, &mm, &ss);
    firstindex=binaryFind_noMoretime(cars, hh * 3600 + mm * 60 + ss,firstindex);
    if (firstindex == -1) printf("0\n");
    else  printf("%d\n", (*number)[firstindex]);
  }
} 
int main()
{  
  int N, K;
  scanf("%d%d", &N, &K); 
  vector<carslist>cars(N);
  readln(&cars, N); 
  sort(cars.begin(), cars.end(), everycarsTimecmp);  
  vector<string>staylongest;
    N=KickWrong_Addlongest(&cars,&staylongest);
  sort(cars.begin(), cars.end(), TotalTimesort);  
  vector<int>number;
  numbercount(&number, &cars);
  read_ans(K, &cars, &number);
  for (vector<string>::iterator iter = staylongest.begin(); iter != staylongest.end(); iter++)
     printf("%s ", (*iter).c_str());
  printf("%02d:%02d:%02d\n", N / 3600, N % 3600 / 60, N % 60); 
  system("pause");
  return 0;
}


评测结果

   
   
时间结果得分题目语言用时(ms)内存(kB)用户
8月19日
 13:41答案正确301095C++
 (g++ 4.7.2)217948datrilla
测试点

   
   
测试点结果用时(ms)内存(kB)得分/满分
0答案正确130418/18
1答案正确418963/3
2答案正确356923/3
3答案正确13081/1
4答案正确2178803/3
5答案正确199482/2
#include<iostream> 
#include<string.h>
#include<string>
#include<vector>
#include<queue>
#include<algorithm>
#include<iomanip>
using namespace std;  
struct carslist
{
  char plate[9];
  int time;
  bool in;
};
void readln(vector<carslist>*cars, int N)
{
  int hh, mm, ss;
  char in_out[4];
  int index;
  for (index = 0; index < N; index++)
  {
    cin >> (*cars)[index].plate >> hh >> in_out[0] >> mm >> in_out[0] >> ss >> in_out; 
    (*cars)[index].time = hh * 3600 + mm * 60 + ss;
    (*cars)[index].in = in_out[0] == 'i' ? true : false; 
  }
}
bool everycarsTimecmp(const carslist&A, const carslist&B)
{
  if (strcmp(A.plate, B.plate) == 0)return A.time < B.time;
  else return strcmp(A.plate, B.plate) < 0;
}
bool TotalTimesort(const carslist&A, const carslist&B)
{
  return A.time < B.time;
}
int KickWrong_Addlongest(vector<carslist>*cars, vector<string>*staylongest)
{
  int maxTime = 0,ThecarmaxT=0;
  string Precar=(*cars)[0].plate;
  for (vector<carslist>::iterator iter = (*cars).begin(); iter != (*cars).end(); )
  {
    if (iter->in&&iter + 1 != (*cars).end() && strcmp(iter->plate, (iter + 1)->plate)== 0 && !(iter + 1)->in) /*in_out一定成对存在，题目要求*/
    {

      if (Precar == iter->plate) 
          ThecarmaxT += (iter + 1)->time - iter->time;/*累记一整天的停车时长*/ 
      else
      {
        Precar = iter->plate;
        ThecarmaxT = (iter + 1)->time - iter->time; 
      }
      if (maxTime < ThecarmaxT)
      {
        (*staylongest).clear();
        (*staylongest).push_back(Precar);
        maxTime = ThecarmaxT;
      }
      else if (maxTime == ThecarmaxT)
        (*staylongest).push_back(Precar);
      iter += 2;
    }
    else iter = (*cars).erase(iter); 
  }
  return maxTime;
}
void numbercount(vector<int>*number, vector<carslist>*cars)
{
  int index, len = (*cars).size(),cnt;
  for (cnt=index = 0; index < len; index++)
  {
    if ((*cars)[index].in)cnt++; else cnt--;
    (*number).push_back(cnt); 
  }
}
int binaryFind_noMoretime(vector<carslist>*cars, int time)
{
  int lastindex = (*cars).size() - 1;
  if (lastindex == -1 || time<(*cars)[0].time)return -1;
  else if (time>(*cars)[lastindex].time)return lastindex;  
  int firstindex = 0,midindex;
  while (firstindex <= lastindex)
  {
    midindex = (lastindex + firstindex) / 2;
    if ((*cars)[midindex].time > time)lastindex = midindex - 1;
    else firstindex = midindex + 1;
  }
  return lastindex;
}
void read_ans(int K, vector<carslist>*cars, vector<int>*number)
{
  int hh, mm, ss;
  char maohao;
  while (K--)
  {
    cin >> hh >>maohao>> mm>>maohao >> ss;
    hh=binaryFind_noMoretime(cars, hh * 3600 + mm * 60 + ss);
    if (hh == -1)cout << "0" << endl;
    else cout << (*number)[hh] << endl;
  }
}
void format(int t)
{
  cout << setw(2) << setfill('0') << t;
}
int main()
{  
  int N, K;
  cin >> N >> K;
  vector<carslist>cars(N);
  readln(&cars, N); 
  sort(cars.begin(), cars.end(), everycarsTimecmp);  
  vector<string>staylongest;
    N=KickWrong_Addlongest(&cars,&staylongest);
  sort(cars.begin(), cars.end(), TotalTimesort);  
  vector<int>number;
  numbercount(&number, &cars);
  read_ans(K, &cars, &number);
  for (vector<string>::iterator iter = staylongest.begin(); iter != staylongest.end(); iter++)
    cout << (*iter) << " "; 
  format(N / 3600); 
  N %= 3600;
  cout << ":";
  format(N / 60);
  cout << ":";
  format(N % 60);
  cout << endl;
  system("pause");
  return 0;
}
Datrilla
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
PTA Cars on Campus
05-30
小组proj
Ship.Cars Loadboard Extension-crx插件
04-03
使用ship.cars载牌板扩展为中央调度和JTracker ship.cars加载板扩展| ship.car.如果您是自动运输载体，则Ship.cars Load Board Assions是将中央调度汽车运输订单导入您的Ship.cars帐户的最佳方式。如果您是托运人/...
PAT甲级 1095 Cars on Campus (30分) map/C++
qq_43955154的博客
06-28 211
1095 Cars on Campus (30分) 题目大意：给定车的进出时间，要求去掉不合法的数据（只有进没有出，只有出没有进）。问query中的时间点校园内有多少辆车，并且输出在校园中停留时间最长的车序列。 这道题真的很需要耐心和细心，考察stl的使用 捋一捋思路： 去掉不合法的数据，也就是in和out要配对：先对时间进行排序，排完以后必定是一进一出配对的出现，如果不成对出现则舍弃； 计算停留时间最长的车：在去掉不合法数据的同时，计算其停留时间，使用map来存放，以便下一次直接找到并增加停留时长； q
PAT甲级1095 Cars on Campus (30 分)
qq_44682929的博客
08-23 126
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 num
错误代码记录1095 Cars on Campus (30 分)
weixin_43694297的博客
07-31 152
#define _CRT_SECURE_NO_WARNINGS #include<cstdio> #include<bits/stdc++.h> using namespace std; typedef struct MyStruct { char name[8]; int hh; int mm; int ss; bool isIn; }Car; bool cmp1(Car c1, Car c2) { float t=strcmp(c1.name, c2.name).
PAT 甲级 1095  Cars on Campus
漫浸天空的雨色的备忘录~
02-14 726
1095 Cars on Campus （30 point(s)） 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 a...
1095 Cars on Campus（30 分）
Become hunger become strong
08-27 354
1095 Cars on Campus（30 分） 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 i...
Cars on Campus_C语言_
10-04
本项目“Cars on Campus”正是一个利用C语言来实现对校园车辆动态进行追踪和管理的案例。通过理解和运用C语言，我们可以构建高效的数据结构，从而有效地分析车辆在各个时间点和地点的状态。 首先，我们要明确C语言...
Cars.zip_cars
09-14
"Cars.zip_cars"这个压缩包文件似乎与一个驾驶学校的在线平台有关，它可能包含了构建这样一个专业网站所需的各种资源。本文将深入探讨构建驾驶学校网站的关键知识点，帮助您了解其背后的技术细节。 首先，一个驾驶...
cars.rar_cars_in
09-24
标题中的“cars.rar_cars_in”表明这是一个关于汽车数据的压缩文件，可能包含了与汽车相关的各种信息。描述中提到“所有汽车信息以Excel格式提供”，这提示我们内部的文件“cars.xls”是一个Excel电子表格，通常用于...
【PAT甲级】1095 Cars on Campus
Y_CanFly的小小博客
11-01 701
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 a...
1095 Cars on Campus (30)
ysq96的博客
07-30 324
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 a...
pat-A 1095. Cars on Campus (30)
dream_never_giveup的博客
12-24 765
水题一个，不是很难 直接将记录按时间排序，连续出现两个或者多个in只保存最后那个，出现out时直接把上个保存的值取出来。需要一个in时间，in时间为0表示没有存in，这种out需要舍弃。这里赌了一把，我赌测试用例里面没有0点整in的。。。我这个in时间为0会被舍弃，然后就有两个测试点过不去。把0整点的情况提取出来特殊处理就行 还有一个地方不小心超时了，开始没看见测试时间是递增的(其实是英语不好
1095 Cars on Campus (30 point(s))
coderwait
08-30 198
1095Cars on Campus(30point(s)) 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 a...
A1095 Cars on Campus
qq_35785913的博客
03-02 146
第一次用map的题目，好好回味！#include&lt;cstdio&gt; #include&lt;vector&gt; #include&lt;string&gt; #include&lt;map&gt; #include&lt;algorithm&gt; using namespace std; struct car { char id[8]; int time; int status...
STL_1095 Cars on Campus （30 分）
A_Bo的博客
02-25 525
1095 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 i...
PAT A 1095 Cars on Campus (30 分)
Siumai's Blog
08-29 254
要求 1、统计给定时间点的，停车场内车数； 2、找到最长停车时间的车辆。
【PAT-A】1095. Cars on Campus 写题记录
weixin_43456345的博客
01-27 358
这题倒数第二个点一直过不去，加上期末考了，也就没有管他。放假重新看代码，一下就看出哪里错了。。 主要思路就是先把所有的信息录入，然后遍历一遍，把符合规则的记录valid值设成true。之后就检查valid==true的记录。 符合规则：in和out先后成对，若有多个In，取离out最近的in。 注意最后的查询时间是增序，只用一次遍历，不然会超时。 #include &lt;cstdio&...
解释range(len(self.cars))
最新发布
03-21
range(len(self.cars))是一个Python中的内置函数，它返回一个包含从0到len(self.cars)-1的整数序列的可迭代对象。在这个序列中，每个整数都可以用作索引来访问self.cars列表中的元素。

“相关推荐”对你有帮助么？

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值