PAT:A1006 Sign In and Sign Out (25 分)
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<stdio.h>
struct Time{
char id[20];
int hh, mm, ss;
} early, late, temp;
bool earlyThan(Time a, Time b) {
if(a.hh != b.hh) return a.hh < b.hh;
else if(a.mm != b.mm) return a.mm < b.mm;
else if(a.ss != b.ss) return a.ss < b.ss;
}
void init() {
early.hh = 24, early.mm = 60, early.ss = 60;
late.hh = 0, late.mm = 0, late.ss = 0;
}
int main() {
init();
int n;
scanf("%d", &n);
for(int i = 0; i < n; i++) {
scanf("%s %d:%d:%d", temp.id, &temp.hh, &temp.mm, &temp.ss);
if( earlyThan(early, temp) == false ) {
early=temp;
}
scanf("%d:%d:%d", &temp.hh, &temp.mm, &temp.ss);
if( earlyThan(late, temp) == true ) {
late = temp;
}
}
printf("%s %s", early.id, late.id);
return 0;
}
本文介绍了一个基于签到和签退时间记录来确定每天开门和关门人员的算法实现。该算法通过比较时间戳来找出最早签到和最晚签退的人,并详细展示了如何使用C语言进行实现。
6万+

被折叠的 条评论
为什么被折叠?



