1 /****************************************************
 2 PAT A1095 Cars on Campus
 3 ****************************************************/
 4 #include <iostream>
 5 #include <algorithm>
 6 #include <vector>
 7 #include <map>
 8 
 9 using namespace std;
10 
11 struct ParkRecord {
12     string num;
13     int time;
14     string state;
15 };
16 
17 bool cmpByNumAndState(ParkRecord a, ParkRecord b) {
18     return (a.num == b.num ? a.time < b.time : a.num < b.num);
19 }
20 
21 bool ccmpByTime(ParkRecord a, ParkRecord b) {
22     return a.time < b.time;
23 }
24 
25 int main() {
26     int recordCnt = 0, askTime = 0, maxParkTime = -1;
27 
28     cin >> recordCnt >> askTime;
29 
30     map<string, int> ParkTime;
31     vector<ParkRecord> EffectRecord;
32     vector<ParkRecord> OriginRecord(recordCnt);
33 
34     //读入原始的记录
35     int hour = 0, min = 0, sec = 0, time = 0;
36     for (int i = 0; i < recordCnt; ++i) {
37         cin >> OriginRecord[i].num;
38         scanf("%d:%d:%d", &hour, &min, &sec);
39         cin >> OriginRecord[i].state;
40 
41         time = hour * 3600 + min * 60 + sec;
42         OriginRecord[i].time = time;
43     }
44 
45     //对原始记录进行排序
46     sort(OriginRecord.begin(), OriginRecord.end(), cmpByNumAndState);
47 
48     //将有效的记录存入新的容器中
49     for (int i = 0; i < OriginRecord.size() - 1; ++i) {
50         if (OriginRecord[i].num == OriginRecord[i + 1].num &&
51             OriginRecord[i].state == "in" && OriginRecord[i + 1].state == "out") {
52             EffectRecord.push_back(OriginRecord[i]);
53             EffectRecord.push_back(OriginRecord[i + 1]);
54 
55             if (ParkTime[OriginRecord[i].num] == 0) {
56                 ParkTime[OriginRecord[i].num] = 0;
57             }
58 
59             ParkTime[OriginRecord[i].num] += OriginRecord[i + 1].time - OriginRecord[i].time;
60 
61             if (maxParkTime < ParkTime[OriginRecord[i].num]) {
62                 maxParkTime = ParkTime[OriginRecord[i].num];
63             }
64         }
65     }
66 
67     //对有效记录进行排序
68     sort(EffectRecord.begin(), EffectRecord.end(), ccmpByTime);
69 
70     //输出查询时间点的车辆数目
71     int now = 0, carCnt = 0;
72     for (int i = 0; i < askTime; ++i) {
73         scanf("%d:%d:%d", &hour, &min, &sec);
74 
75         time = hour * 3600 + min * 60 + sec;
76 
77         for (; now < EffectRecord.size() && EffectRecord[now].time <= time; ++now) {
78             EffectRecord[now].state == "in" ? carCnt++: carCnt--;
79         }
80 
81         cout << carCnt << endl;
82     }
83 
84     //输出停车时间最长的车辆牌号和最长时间
85     for (map<string, int>::iterator itr = ParkTime.begin(); itr != ParkTime.end(); ++itr) {
86         if (itr->second == maxParkTime) {
87             cout << itr->first << ‘ ‘;
88         }
89     }
90 
91     printf("%02d:%02d:%02d", maxParkTime / 3600, (maxParkTime % 3600) / 60, maxParkTime % 60);
92 
93     return 0;
94 }