PAT A1006

最新推荐文章于 2022-11-13 18:23:03 发布

52Tiramisu

最新推荐文章于 2022-11-13 18:23:03 发布

阅读量185

点赞数

分类专栏： PAT

本文链接：https://blog.csdn.net/gsj9086/article/details/85384176

版权

PAT 专栏收录该内容

80 篇文章 9 订阅

订阅专栏

1006 Sign In and Sign Out （25 分）

At the beginning of every day, the first person who signs in the computer room will unlock the door, and the last one who signs out will lock the door. Given the records of signing in's and out's, you are supposed to find the ones who have unlocked and locked the door on that day.

Input Specification:

Each input file contains one test case. Each case contains the records for one day. The case starts with a positive integer M, which is the total number of records, followed by M lines, each in the format:

ID_number Sign_in_time Sign_out_time

where times are given in the format HH:MM:SS, and ID_number is a string with no more than 15 characters.

Output Specification:

For each test case, output in one line the ID numbers of the persons who have unlocked and locked the door on that day. The two ID numbers must be separated by one space.

Note: It is guaranteed that the records are consistent. That is, the sign in time must be earlier than the sign out time for each person, and there are no two persons sign in or out at the same moment.

Sample Input:

3
CS301111 15:30:28 17:00:10
SC3021234 08:00:00 11:25:25
CS301133 21:45:00 21:58:40

Sample Output:

SC3021234 CS301133

在每一天的开始，第一个进入机房的人将把门打开，最后一个离开的人把门锁住。给出进入和退出机房的人的记录，你将在那天找到谁开门和关门

输入格式

每个文件包含一个测试用例，每个用例包含一天的记录。用例从 M 开始，M——总共M条记录，然后下面接着 M 行，每行的格式是这样的：每个时间的格式都是 HH:MM:SS，每个 id number 都是一个不多于15个字符的字符串

输出格式：

对于每一个测试用例，在一行输出那天谁开门锁门，两个 idnumber 必须以空格分隔开

注意：记录都是保证一致的，意味着，登录的时间必须比退出机房时间早对于每个人来说，然后没有两个人在同一时间登录和退出

思路：

把每个人的登录时间和退出时间都和00:00:00相减，最后的差值（以秒为单位），比较看谁的差值最小，谁就是第一个机房的人，谁的差值最大就是最后一个离开机房的人。

#include <cstdio>
struct{
	char name[20];
	int etime;
	int ltime;
}per[10010];
int main(){
	int m;
	scanf("%d", &m);
	int h1, h2, m1, m2, s1, s2, temp1, temp2;
	int k = 0;
	for(int i = 0; i < m; i++){
		scanf("%s %d:%d:%d %d:%d:%d", per[i].name, &h1, &m1, &s1, &h2, &m2, &s2);
		temp1 = h1 * 3600 + m1 * 60 + s1;
		temp2 = h2 * 3600 + m2 * 60 + s2;
		per[i].etime = temp1;
		per[i].ltime = temp2;
		k++;
	}
	int max = -1;
	int min = 86401;
	int kmax = 0;
	int kmin = 0;
	for(int i = 0; i < k; i++){
		if(per[i].etime < min){
			min = per[i].etime;
			kmin = i;
		}			
		if(per[i].ltime > max){
			max = per[i].ltime;
			kmax = i;
		}
	}
	printf("%s %s", per[kmin].name, per[kmax].name);
	return 0;
}