[PAT甲级]1006 Sign In and Sign Out 详细题解+AC 代码

[PAT甲级]1006 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.

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.

---

##题解
转秒之后进行比较即可，本题测试点比较简单，也不要求输出某个人的具体签到签退时间，所以仅仅进行比较即可完成本题。

#include <bits/stdc++.h>
using namespace std;
#define MAX 86401
#define MIN 0
int M;
map<string, pair<int, int>> record;
string open_id;
string close_id;
int earliest=MAX;
int latest=MIN;
int TimetoInt(string time)
{
    int hour = (time[0] - '0') * 10 + time[1] - '0';
    int minutes = (time[3] - '0') * 10 + time[4] - '0';
    int seconds = (time[6] - '0') * 1 - +time[7] - '0';
    return hour * 3600 + minutes * 60 + seconds;
}
int main()
{
    cin >> M;
    string ID;
    string times; // 开始时间
    string timee; // 结束时间
    for (int i = 0; i < M; i++)
    {
        cin >> ID >> times >> timee;
        if(TimetoInt(times)<earliest)
        {
            earliest=TimetoInt(times);
            open_id=ID;
        }
        if(TimetoInt(timee)>latest)
        {
            latest=TimetoInt(timee);
            close_id=ID;
        }
        // if (record.find(ID) == record.end())
        // {
        //     record[ID] = make_pair(TimetoInt(times), TimetoInt(timee));
        // }

        // else
        // {
        //     record[ID].first = record[ID].first < TimetoInt(times) ? record[ID].first : TimetoInt(times);
        //     record[ID].second = record[ID].second > TimetoInt(timee) ? record[ID].second : TimetoInt(timee);
        // }
    }
    cout<<open_id<<" "<<close_id;
    
}

---

AC结果：

---