PAT甲级(Advanced Level)练习题 Sign In and Sign Out

题目描述

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.

输入描述:

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.

输出描述:

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.

输入例子:

3
CS301111 15:30:28 17:00:10
SC3021234 08:00:00 11:25:25
CS301133 21:45:00 21:58:40

输出例子:

SC3021234 CS301133

题目分析

寻找出最早到和最晚走的人，寻找最小值的问题，可以转化为排序问题。只需要比较每个人到的时间和离开的时间，进行排序，即可得到正确结果。

代码实现（C++版本）

#include <iostream>
#include <algorithm>
using namespace std;

struct Person{
    string id;
    string signin;
    string signout;
};

bool cmp1(Person a, Person b){
    int ahour = (a.signin[0]-'0')*10+ (a.signin[1]-'0');
    int aminute = (a.signin[3]-'0')*10 + (a.signin[4]-'0');
    int asecond = (a.signin[6]-'0')*10 + (a.signin[7]-'0');
    int atime = ahour*3600+aminute*60+asecond;

    int bhour = (b.signin[0]-'0')*10+ (b.signin[1]-'0');
    int bminute = (b.signin[3]-'0')*10 + (b.signin[4]-'0');
    int bsecond = (b.signin[6]-'0')*10 + (b.signin[7]-'0');
    int btime = bhour*3600+bminute*60+bsecond;
    return atime < btime;
}

bool cmp2(Person a, Person b){
    int ahour = (a.signout[0]-'0')*10+ (a.signout[1]-'0');
    int aminute = (a.signout[3]-'0')*10 + (a.signout[4]-'0');
    int asecond = (a.signout[6]-'0')*10 + (a.signout[7]-'0');
    int atime = ahour*3600+aminute*60+asecond;

    int bhour = (b.signout[0]-'0')*10+ (b.signout[1]-'0');
    int bminute = (b.signout[3]-'0')*10 + (b.signout[4]-'0');
    int bsecond = (b.signout[6]-'0')*10 + (b.signout[7]-'0');
    int btime = bhour*3600+bminute*60+bsecond;
    return atime > btime;
}

int main()
{
    int n;
    cin >> n;
    Person person[n];
    for(int i =0;i < n;i++){
        cin  >> person[i].id >> person[i].signin >> person[i].signout;
    }
    sort(person,person+n,cmp1);
    cout<<person[0].id << " ";
    sort(person,person+n,cmp2);
    cout<<person[0].id<<endl;
    return 0;
}