【PAT】A1095. Cars on Campus(排序、字符串、map)
@(PAT)
链接:https://www.patest.cn/contests/pat-a-practise/1095
需要注意的地方:
1. 时间以s为单位,运算的时候能够极大简化过程。在看完题目后,要表示题目数据的最佳表达,以免产生额外的工作。
2. map中的key最好不要为指针,所以在统计停留时间的时候,使用的是
map<string, int>
而不是map<char*, int>
。
3. map可以直接使用map[key]的形式来进行初始化和赋值,能够极大简化代码。
4. 以前判断map中有没有该key的数据一般用find,其实用count更加简单,配合map[key]来初始化和修改数据非常方便。
5. printf输出支持的是C内置的数据结构,如果要输出string,最好用cout,但是效率会挺低。继续使用printf的话要printf("%s", string.c_str());
My AC code:
#define _CRT_SECURE_NO_DEPRECATE
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <cstdlib>
using namespace std;
struct Car
{
char id[8];
int time;
// 1 for in, 0 for out
bool status;
};
int stringToTime(char *s) {
int h = (s[0] - '0') * 10 + s[1] - '0';
int m = (s[3] - '0') * 10 + s[4] - '0';
int ss = (s[6] - '0') * 10 + s[7] - '0';
int time = h * 60 * 60 + m * 60 + ss;
return time;
}
bool cmp(Car c1, Car c2) {
if (strcmp(c1.id, c2.id) != 0) return strcmp(c1.id, c2.id) < 0;
return c1.time < c2.time;
}
bool cmp1(Car c1, Car c2) {
return c1.time< c2.time;
}
int main() {
int n, k;
scanf("%d%d", &n, &k);
vector<Car> all, valid;
for (int i= 0; i< n; i++) {
Car temp;
scanf("%s", temp.id);
char times[9];
scanf("%s", ×);
char status[4];
scanf("%s", &status);
temp.time = stringToTime(times);
if (status[0] == 'i') {
temp.status = true;
}
else {
temp.status = false;
}
all.push_back(temp);
}
sort(all.begin(), all.end(), cmp);
map<string, int> parkTime;
int maxTime = -1;
for (int i = 0; i < n- 1; i++) {
// printf("%s %d %d\n", all[i].id, all[i].time, all[i].status);
if (strcmp(all[i].id, all[i + 1].id) == 0) {
if (all[i].status == true && all[i + 1].status == false) {
valid.push_back(all[i]);
valid.push_back(all[i + 1]);
int time = all[i + 1].time - all[i].time;
if (parkTime.count(all[i].id) == 0) {
parkTime[all[i].id] = 0;
}
parkTime[all[i].id] += time;
maxTime = max(maxTime, parkTime[all[i].id]);
}
}
}
sort(valid.begin(), valid.end(), cmp1);
for (int i = 0; i < valid.size(); i++) {
// cout << valid[i].id << " " << valid[i].time << " " << valid[i].status << endl;
}
int now = 0;
int n_car_now = 0;
for (int i = 0; i < k; i++) {
char timek[9];
scanf("%s", &timek);
int time = stringToTime(timek);
while (now < valid.size() && valid[now].time <= time) {
if (valid[now].status == true) {
n_car_now++;
}
else {
n_car_now--;
}
now++;
}
printf("%d\n", n_car_now);
}
map<string, int>::iterator it;
for (it= parkTime.begin(); it != parkTime.end(); it++) {
if (it->second == maxTime) {
// cout << it->first << " ";
printf("%s ", it->first.c_str());
}
}
printf("%02d:%02d:%02d", maxTime / 3600, maxTime % 3600 / 60, maxTime % 60);
}