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
接下来是AC代码:
#include <cstdio>
#include <cstring>
struct student{
char id[20];
int h,m,s;
}temp,ans1,ans2;
//1的时间大于2的时间返回true
bool big(student ans1,student ans2){
if(ans1.h!=ans2.h) return ans1.h>ans2.h;
if(ans1.m!=ans2.m) return ans1.m>ans2.m;
return ans1.s>ans2.s;
}
int main(void){
int n;
scanf("%d",&n);
//初始化,便于更新时间
ans1.h=24,ans1.m=60,ans1.s=60;
ans2.h=0,ans2.m=0,ans2.s=0;
while(n--){
//先读入签到时间
scanf("%s %d:%d:%d",temp.id,&temp.h,&temp.m,&temp.s);
if(big(temp,ans1)==false){
ans1=temp;
}
//再读入签离时间
scanf("%d:%d:%d",&temp.h,&temp.m,&temp.s);
if(big(temp,ans2)==true){
ans2=temp;
}
}
printf("%s %s\n",ans1.id,ans2.id);
return 0;
}
解题思路:
1.用结构体,里面存放姓名时分秒,写一个比较函数,其参数为两个结构体变量,用来比较两个结构体的时间大小
2.开三个结构体,一个存放最早的一个存放最晚的,最后一个最临时的
3.每读入一个就开始比较,先比较签到时间,再比较签退时间,当所有数据比较完毕后,答案立竿见影
需要注意:
1.时间××:××:××的读入可以按scanf("%d:%d:%d",&temp.h,&temp.m,&temp.s); 的方法读入
2.IDnumber最多15字符,那就意味着存放id的数组要至少开到16
3.比较好理解的写法是先全部读入,然后排序之后取最值,但是算法复杂度大,在练习的时候尽量采用更加优化的算法,比较覆盖是一个好方法