1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
| #include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <sstream>
#include <map>
#include <set>
#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<30
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
vector<string> split(const string &str, char delim) {
vector<string> res;
size_t current = 0, found;
while((found = str.find_first_of(delim, current)) != string::npos) {
res.push_back(string(str, current, found - current));
current = found + 1;
}
res.push_back(string(str, current, str.size() - current));
return res;
}
// s1 - s2
int f(string s1, string s2) {
int a = (s1[0] - '0') * 10 + (s1[1] - '0');
int b = (s1[3] - '0') * 10 + (s1[4] - '0');
int c = (s2[0] - '0') * 10 + (s2[1] - '0');
int d = (s2[3] - '0') * 10 + (s2[4] - '0');
if(a == c) {
return b - d;
} else {
return (a - (c + 1)) * 60 + (60 - d) + b;
}
}
int main() {
int n;
while(cin >> n && n) {
map<string, vector<pair<string, string> > > IN, OUT;
rep(i, n) {
string a, b, c, d;
cin >> a >> b >> c >> d;
if(c == "I") {
IN[d].push_back(mp(a, b));
} else {
OUT[d].push_back(mp(a, b));
}
}
int ans = 0;
vector<pair<string, string> > gin = IN["000"];
vector<pair<string, string> > gout = OUT["000"];
map<string, vector<pair<string, string> > >::iterator in, out;
for(in = IN.begin(), out = OUT.begin(); in != IN.end() && out != OUT.end(); in++, out++) {
if(in->first == "000") continue;
vector<pair<string, string > > v = in->second;
vector<pair<string, string > > v2 = out->second;
int res = 0;
rep(i, v.size()) {
rep(j, gin.size()) {
if(v[i].first != gin[j].first) continue;
string a = v[i].second, b = v2[i].second, c = gin[j].second, d = gout[j].second;
if(c <= a && b <= d) {
res += f(b, a);
} else if(a <= c && d <= b) {
res += f(d, c);
} else if(c <= a && a <= d && d <= b) {
res += f(d, a);
} else if(a <= c && c <= b && b <= d) {
res += f(b, c);
}
}
}
ans = max(ans, res);
}
cout << ans << endl;
}
return 0;
}
|