PAT(甲) 1006. Sign In and Sign Out (25)

1006. Sign In and Sign Out (25)

题目地址：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.

---

• 输入格式：
  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.

---

解题方法：
这道题目属于简单题，只要判断一下比较一下就好了。不过这里可以用“秒”作为单位来对各个时间进行比较，从而达到简化代码的效果。

程序：

#include <stdio.h>

int CalculateTime(int H, int M, int S)
{   /* 计算时间以秒为单位 */
    return H*3600 + M*60 + S; 
}

int main(int argc, char const *argv[])
{
    int N, Inhour, Outhour, Inmin, Outmin, Insec, Outsec;
    int FirstInID, LastOutID, First = 86400, Last = 0;
    scanf("%d", &N);
    getchar();
    char ID[N][16]; /* 保存名字 */
    for (int i = 0; i < N; i++)
    {   
        int In, Out;    /* 保存每个人进入的时间和出去的时间 */
        scanf("%s %d:%d:%d %d:%d:%d", ID[i], &Inhour, &Inmin
              , &Insec, &Outhour, &Outmin, &Outsec);
        In = CalculateTime(Inhour, Inmin, Insec);
        Out = CalculateTime(Outhour, Outmin, Outsec);
        if (In < First)
        {   /* 如果有更早的进入的人，更新最早时间 */
            First = In;
            FirstInID = i;
        }
        if (Out > Last)
        {   /* 如果有更晚进入的人，更新最晚时间 */
            Last = Out;
            LastOutID = i;
        }
    }
    printf("%s %s\n", ID[FirstInID], ID[LastOutID]);
    return 0;
}