1006. Sign In and Sign Out (25)

最新推荐文章于 2024-10-10 14:51:35 发布

原创最新推荐文章于 2024-10-10 14:51:35 发布 · 428 阅读

0 ·

CC 4.0 BY-SA版权

ACM训练+实训+大学编程练习专栏收录该内容

362 篇文章

订阅专栏

本文介绍了一个简单的签到与签退系统的设计与实现，该系统能够记录用户的签到和签退时间，并确定每天第一个签到和最后一个签退的人。输入包含多个用户的签到与签退记录，通过比较这些记录的时间戳来找出解锁和锁门的人。

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:40

Sample Output:

SC3021234 CS301133

#include <bits/stdc++.h>
using namespace std;
struct node
{
  char ma[1232];
  int unlock;
  int lock;
}t[123123];
int cmp(struct node a, struct node b)
{
  return a.unlock<b.unlock;
}
int comp(struct node a, struct node b)
{
  return a.lock>b.lock;
}
int main()
{
  int n;
  cin>>n;
  int a1, a2, a3, b1, b2, b3;
  for(int i=0;i<n;i++)
  {
     scanf("%s %d:%d:%d %d:%d:%d", t[i].ma, &a1, &a2, &a3, &b1, &b2, &b3);
     int a = a1 * 3600 + a2 * 60 + a3;
     int b = b1 * 3600 + b2 * 60 + b3;
     t[i].lock = b;
     t[i].unlock = a;
  }
  sort(t, t+n, cmp);
  printf("%s ", t[0].ma);
  sort(t, t+n, comp);
  printf("%s\n", t[0].ma);
  return 0;
}