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 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:40Sample Output:
SC3021234 CS301133
题目不难,意思是根据时间判断,找出第一个来的人和最后一个走的人。直接根据HH:MM:SS这种时间格式不好比较大小,我的想法是先将时间统一成秒,1h = 3600s,1m = 60s,以00:00:00为基准,将所有人来的时间排序,再将所有人走的时间排序,就可以输出结果了。
没什么特别注意的地方,一次就AC了。
#include <iostream>
#include <algorithm>
#include <vector>
#include <cstring>
using namespace std;
typedef struct {
char ID[16];
int in;
int out;
} Person;
int cmp1( void const *p1,void const *p2 ) {
return ((Person *)(p1))->in > ((Person *)(p2))->in;
}
int cmp2( void const *p1,void const *p2 ) {
return ((Person *)(p1))->out < ((Person *)(p2))->out;
}
int main() {
//freopen( "123.txt", "r", stdin );
int m;
scanf( "%d", &m );
vector<Person> vec;
Person p;
int i;
char id[16];
int inHH, inMM, inSS;
int outHH, outMM, outSS;
for( i = 0; i < m; i++ ) {
scanf( "%s%d:%d:%d %d:%d:%d", id, &inHH, &inMM, &inSS, &outHH, &outMM, &outSS );
strcpy( p.ID, id );
p.in = inHH * 3600 + inMM * 60 + inSS;
p.out = outHH * 3600 + outMM * 60 + outSS;
vec.push_back( p );
}
qsort( &vec[0], m, sizeof( Person ), cmp1 );
printf( "%s ", vec[0].ID );
qsort( &vec[0], m, sizeof( Person ), cmp2 );
printf( "%s", vec[0].ID );
return 0;
}