1006. Sign In and Sign Out (25)

原创 2016年08月30日 15:16:16

1006. Sign In and Sign Out (25)

 

时间限制
400 ms
内存限制
65536 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue

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


 

注意时间格式不一定是标准的。可能是这种25:61:61

 

#include <stdio.h>
#include <stdlib.h>

typedef struct data
{
	char ID[20];
	int InH,InM,InS;
	int OutH,OutM,OutS;
}DATA;


int main()
{
	DATA p1,p2,p3;
	int m,i;
	int sec1,sec2;
	scanf("%d",&m);
	scanf("%s %d:%d:%d %d:%d:%d",p3.ID,&p3.InH,&p3.InM,&p3.InS,&p3.OutH,&p3.OutM,&p3.OutS);
	m--;
	p1 = p3;
	p2 = p3;
	for(i=0;i<m;i++)
	{
		scanf("%s %d:%d:%d %d:%d:%d",p3.ID,&p3.InH,&p3.InM,&p3.InS,&p3.OutH,&p3.OutM,&p3.OutS);
		sec1 = p3.InH*3600+p3.InM*60+p3.InS;
		sec2 = p1.InH*3600+p1.InM*60+p1.InS;
		if(sec1 < sec2)
		{
			p1 = p3;
		}
		sec1 = p3.OutH*3600+p3.OutM*60+p3.OutS;
		sec2 = p2.OutH*3600+p2.OutM*60+p2.OutS;
		if(sec1 > sec2)
		{
			p2 = p3;
		}
	}
	printf("%s %s",p1.ID,p2.ID);
	//system("pause");
	return 0;
}


 

 

 

 

版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

PAT (Advanced Level) Practise 1006 Sign In and Sign Out (25)

1006. Sign In and Sign Out (25) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 1...

1006. Sign In and Sign Out (25)

题目如下: At the beginning of every day, the first person who signs in the computer room will unloc...

[PAT]1006. Sign In and Sign Out (25)

/************************************************************** 1006. Sign In and Sign Out (25) 时间限...

浙江大学PAT上机题解析之1006. Sign In and Sign Out (25)

浙江大学PAT题解之1006. Sign In and Sign Out (25)

PAT甲级 1006.Sign In and Sign Out(25) 题目翻译与答案

1006.签到和签出 在每天的开始,第一个在机房签到的人会负责开门,最后一个签出的人负责锁门。提供签到和签出的记录,你应该找出当天开门的那个人和锁门的那个人。 输入说明: 每个输入文件包含一个测试...

PAT甲级真题及训练集(8)--1006. Sign In and Sign Out (25)

1006. Sign In and Sign Out (25) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 1...

pat 1006. Sign In and Sign Out (25)

1006. Sign In and Sign Out (25) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 1...

PAT_ADVANCED LEVEL 1006 Sign In and Sign Out (25) 排序

1006. Sign In and Sign Out (25) 时间限制 400 ms 内存限制 32000 kB 代码长度限制 1...

PAT A 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 ...

1006. Sign In and Sign Out (25)

1006. Sign In and Sign Out (25) 时间限制 400 ms 内存限制 32000 kB 代码长度限制 16000 B 判题程序 Standar...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)