Not Only Algorithm,不仅仅是算法,关注数学、算法、数据结构、程序员笔试面试以及一切涉及计算机编程之美的内容 。。
你的位置:NoAlGo博客 » 题解 » 

PAT 1006. Sign In and Sign Out

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

解答

#include <cstdio>
#include <cstring>

int main()
{
	char in[20], out[20];
	int tin = -1, tout = -1;

	int m; scanf("%d", &m);
	while (m--)
	{
		char id[20], x[10], y[10]; scanf("%s%s%s", id, x, y);

		int t1 = ((x[0]-'0')*10 + (x[1]-'0')) * 3600 + ((x[3]-'0')*10 + (x[4]-'0')) * 60 + (x[6]-'0')*10 + (x[7]-'0');
		int t2 = ((y[0]-'0')*10 + (y[1]-'0')) * 3600 + ((y[3]-'0')*10 + (y[4]-'0')) * 60 + (y[6]-'0')*10 + (y[7]-'0');

		if (tin == -1 || t1 < tin)
		{
			tin = t1; strcpy(in, id);
		}

		if (tout == -1 || t2 > tout)
		{
			tout = t2; strcpy(out, id);
		}
	}

	printf("%s %s\n", in, out);
	return 0;
}
上一篇: 下一篇:

我的博客

NoAlGo头像编程这件小事牵扯到太多的知识,很容易知其然而不知其所以然,但真正了不起的程序员对自己程序的每一个字节都了如指掌,要立足基础理论,努力提升自我的专业修养。

站内搜索

最新评论