关闭

1006. Sign In and Sign Out (25)

标签: 1006. Sign In and Si
67人阅读 评论(0) 收藏 举报
分类:

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;
}


 

 

 

 

0
0

猜你在找
【套餐】Hadoop生态系统零基础入门
【套餐】嵌入式Linux C编程基础
【套餐】2017软考系统集成项目——任铄
【套餐】Android 5.x顶级视频课程——李宁
【套餐】深度学习入门视频课程——唐宇迪
【直播】广义线性模型及其应用——李科
【直播】从0到1 区块链的概念到实践
【直播】计算机视觉原理及实战——屈教授
【直播】机器学习之凸优化——马博士
【直播】机器学习&数据挖掘7周实训--韦玮
查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:33347次
    • 积分:2833
    • 等级:
    • 排名:第12664名
    • 原创:266篇
    • 转载:4篇
    • 译文:0篇
    • 评论:0条
    文章分类
    最新评论