浙大 PAT 甲级 1095 Cars on Campus

一看到这题，不仅让我回想到被Table Tennis等等系列难题支配的恐惧…不过好在有了前面的经验，这题也相对简单，因此一遍AC。下面贴上AC代码

 

#include<stdio.h>
#include<vector>
#include<map>
#include<string>
#include<string.h>
#include<algorithm>
#include<memory.h>
using namespace std;

struct Record
{
	string name;
	int time;
	int state;
};
vector<Record> records;
map<string, int> TT; // Total Time
map<string, int> IN; // The queue of cans have been in
int cars[90000];

bool cmp(Record a, Record b)
{
	if (a.time != b.time)
	{
		return a.time < b.time;
	}
	else if (a.state != b.state)
	{
		return a.state < b.state;
	}
	else
	{
		return a.name < b.name;
	}
}

bool cmpMap(pair<string, int> a, pair<string, int> b)
{
	if (a.second != b.second)
	{
		return (a.second>b.second);
	}
	else
	{
		return (a.first < b.first);
	}
}

int main()
{
	memset(cars, 0, sizeof(int)* 90000);
	int N, K, size = 0;
	scanf("%d%d", &N, &K);
	for (int i = 0; i < N; i++)
	{
		char name[10];
		int h, m, s;
		char state[5];
		scanf("%s %d:%d:%d %s", name, &h, &m, &s, state);
		Record record;
		record.name = name;
		record.time = h * 60 * 60 + m * 60 + s;
		record.state = (state[0] == 'i') ? 1 : -1;
		records.push_back(record);
	}
	sort(records.begin(), records.end(), cmp);
	for (int i = 0; i < N; i++)
	{
		if (records[i].state == 1)
		{
			IN[records[i].name] = records[i].time;
		}
		else
		{
			if (IN.count(records[i].name) == 1)
			{
				if (TT.count(records[i].name) == 0)
				{
					TT[records[i].name] = records[i].time - IN[records[i].name];
				}
				else
				{
					TT[records[i].name] += records[i].time - IN[records[i].name];
				}
				for (int j = IN[records[i].name]; j < records[i].time; j++)
				{
					cars[j]++;
				}
				IN.erase(records[i].name);
			}
		}
	}
	for (int i = 0; i < K; i++)
	{
		int h, m, s;
		scanf("%d:%d:%d", &h, &m, &s);
		printf("%d\n", cars[h * 60 * 60 + m * 60 + s]);
	}
	vector<pair<string, int>> TTVector(TT.begin(), TT.end());
	sort(TTVector.begin(), TTVector.end(), cmpMap);
	int LT = TTVector[0].second;
	for (int i = 0; i < TTVector.size(); i++)
	{
		if (TTVector[i].second == LT)
		{
			printf("%s ",TTVector[i].first.c_str());
		}
	}
	printf("%02d:%02d:%02d\n", LT / 3600, (LT / 60) % 60, LT % 60);
	return 0;
}

最近开始去学校机房刷题了，因为机房里是台式机和长键程键盘，熟悉下环境。