1095 Cars on Campus (30 分)

1095 Cars on Campus (30 分)

思路有空更新

#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
struct node{
	string id;
	int time, flag;
}a[10010]; 
vector<node> v;
map<string, int> m; 
bool cmp1(node x, node y) {
	if(x.id != y.id)
		return x.id < y.id;
	else
		return x.time < y.time;
}
bool cmp2(node x, node y) {
	return x.time < y.time;
}
int main() {
	int n, k, x, y, z, maxn = 0, ret[10010] = {0};
	string s;
	cin >> n >> k;
	for(int i = 0; i < n; ++i) {
		cin >> a[i].id;
		scanf("%d:%d:%d", &x, &y, &z);
		cin >> s;
		a[i].time = x * 3600 + y * 60 + z;
		a[i].flag = s == "in" ? 1 : -1;
	}
	sort(a, a + n, cmp1);
	for(int i = 0; i < n - 1; ++i) {
		if(a[i].id == a[i + 1].id && a[i].flag == 1 && a[i + 1].flag == -1){
			v.push_back(a[i]);
			v.push_back(a[i + 1]);
			m[a[i].id] += a[i + 1].time - a[i].time;
			maxn = max(maxn, m[a[i].id]);
		}
	}
	sort(v.begin(), v.end(), cmp2);
	ret[0] = v[0].flag;
	for(int i = 1; i < v.size(); ++i)
		ret[i] = ret[i - 1] + v[i].flag;
	int i = 0;
	while(k--) {
		scanf("%d:%d:%d", &x, &y, &z);
		int time = x * 3600 + y * 60 + z;
		for(; i < v.size(); ++i) {
			if(time < v[i].time){
				printf("%d\n", ret[i - 1]);
				break;
			}
		}
		if(i == v.size()) printf("%d\n", ret[i - 1]);
	}
	for(auto it = m.begin(); it != m.end(); ++it)
		if(it->second == maxn)
			printf("%s ", it->first.c_str());
	printf("%02d:%02d:%02d", maxn / 3600, maxn % 3600 / 60, maxn % 60);
}