关闭

1006. Sign In and Sign Out (25)

标签: PAT
86人阅读 评论(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

提交代

法1:

string的比较函数compare();

代码:

#include <iostream>
#include<cstdio>
#include<string.h>
#include<cmath>
using namespace std;
struct node
{
	string name;
	string start;
	string end;
};
int main()
{
	node nod[1001];
	int m,maxx=0,minn=0;
	cin>>m;
	for(int i=0;i<m;i++)
	cin>>nod[i].name>>nod[i].start>>nod[i].end;
	for(int i=1;i<m;i++)
	{
		if(nod[i].start.compare(nod[minn].start)<0)
		minn=i;
		if(nod[i].end.compare(nod[maxx].end)>0)
		maxx=i;
	}
	//cout<<minn<<" "<<maxx<<endl;
	cout<<nod[minn].name<<" "<<nod[maxx].name;
	return 0;
}

法二:

用char[]数组做,自定义一个比较函数即可

#include <iostream>
#include<cstdio>
#include<string.h>
#include<cmath>
using namespace std;
struct node
{
	char name[20];
	char start[10];
	char end[10];
};
bool wan(char a[10],char b[20])///前者晚 
{
	for(int i=0;i<20;i++)
	{
		if(a[i]>b[i])
		return 1;
		if(a[i]<b[i])
		return 0;
	}
}
int main()
{
	node nod[1001];
	int m,maxx=0,minn=0;
    cin>>m;
    for(int i=0;i<m;i++)
    cin>>nod[i].name>>nod[i].start>>nod[i].end;
    for(int i=1;i<m;i++)
    {
    	if(wan(nod[minn].start,nod[i].start))
    	minn=i;
    	if(wan(nod[i].end,nod[maxx].end))
    	maxx=i;
	}
	cout<<nod[minn].name<<" "<<nod[maxx].name;
	return 0;
}


0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:147088次
    • 积分:6185
    • 等级:
    • 排名:第4017名
    • 原创:483篇
    • 转载:0篇
    • 译文:0篇
    • 评论:78条
    最新评论