PAT 甲级 1157 Anniversary

最新推荐文章于 2023-05-10 10:19:23 发布

漫浸天空的雨色

最新推荐文章于 2023-05-10 10:19:23 发布

阅读量976

点赞数 2

CC 4.0 BY-SA版权

分类专栏： PAT甲级 PAT甲级/乙级机试经验文章标签： PAT甲级 Anniversary 1157

本文链接：https://blog.csdn.net/a845717607/article/details/88083618

PAT甲级/乙级机试经验同时被 2 个专栏收录

254 篇文章

订阅专栏

PAT甲级

159 篇文章

订阅专栏

为庆祝浙江大学122周年校庆，本篇博客介绍了一种算法，用于从参加庆典的人群中识别并计数校友数量。通过输入校友和嘉宾的ID，算法能够找出校友，并确定最年长的校友或嘉宾。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

1157 Anniversary （25 分）

Zhejiang University is about to celebrate her 122th anniversary in 2019. To prepare for the celebration, the alumni association （校友会） has gathered the ID's of all her alumni. Now your job is to write a program to count the number of alumni among all the people who come to the celebration.

Input Specification:

Each input file contains one test case. For each case, the first part is about the information of all the alumni. Given in the first line is a positive integer N (≤105). Then N lines follow, each contains an ID number of an alumnus. An ID number is a string of 18 digits or the letter X. It is guaranteed that all the ID's are distinct.

The next part gives the information of all the people who come to the celebration. Again given in the first line is a positive integer M (≤105). Then M lines follow, each contains an ID number of a guest. It is guaranteed that all the ID's are distinct.

Output Specification:

First print in a line the number of alumni among all the people who come to the celebration. Then in the second line, print the ID of the oldest alumnus -- notice that the 7th - 14th digits of the ID gives one's birth date. If no alumnus comes, output the ID of the oldest guest instead. It is guaranteed that such an alumnus or guest is unique.

Sample Input:

5
372928196906118710
610481197806202213
440684198612150417
13072819571002001X
150702193604190912
6
530125197901260019
150702193604190912
220221196701020034
610481197806202213
440684198612150417
370205198709275042

Sample Output:

3
150702193604190912

经验总结：

题目不难，就是，嗯.....逻辑得理清楚，这一题我没有追求速度使用字符数组，而是string类型，因为考试主要追求的是高效的实现目标。要注意两个人年龄的比较，以及整体的代码逻辑，不太好叙述= =，详细的请看代码吧~~

AC代码

#include <cstdio>
#include <cmath>
#include <map>
#include <string>
#include <iostream>
using namespace std;
map<string, bool> mp;
bool cmp(string a, string b)
{
	if (a.substr(6, 4) != b.substr(6, 4))
		return a.substr(6, 4) < b.substr(6, 4);
	if (a.substr(10, 2) != b.substr(10, 2))
		return a.substr(10, 2) < b.substr(10, 2);
	return a.substr(12, 2) < b.substr(12, 2);
}
int main()
{
	int n,m;
	string str,temp;
	scanf("%d", &n);
	for (int i = 0; i < n; ++i)
	{
		cin >> str;
		mp[str] = true;
	}
	scanf("%d", &m);
	bool flag=false;
	int count = 0;
	for (int i = 0; i < m; ++i)
	{
		cin >> str;
		if (mp[str] == true)
		{
			if (flag == false)
			{
				flag = true;
				temp = str;
			}
			else
			{
				if (cmp(temp, str) == false)
					temp = str;
			}
			++count;
		}
		else
		{
			if (i == 0)
				temp = str;
			else
			{
				if (flag==false&&cmp(temp, str) == false)
					temp = str;
			}
		}
	}
	if (flag == true)
		printf("%d\n%s", count, temp.c_str());
	else
		printf("0\n%s", temp.c_str());
	return 0;
}