Sign In and Sign Out (25)

Sign In and Sign Out (25)

时间限制 1000 ms 内存限制 32768 KB 代码长度限制 100 KB 判断程序 Standard (来自 小小)
题目描述
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

题解：就是要找出时间1最小值和时间2的最大值可设置结构体然后比较时间
这里比较时间可以有两种方法，一种是可以直接比较string或者就是按照正常逻辑来比较，可以先设定一个最大值和一个最小值，然后不断更新即可。设置比较函数返回时间比较。

#include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
#define vi vector<int>
#define pii pair<int,int>
#define x first
#define y second
#define all(x) x.begin(),x.end()
#define pb push_back
#define mp make_pair
#define SZ(x) x.size()
#define rep(i,a,b) for(int i=a;i<b;i++)
#define per(i,a,b) for(int i=b-1;i>=a;i--)
#define pi acos(-1)
#define mod 1000000007
#define inf 1000000007
#define ll long long
#define DBG(x) cerr<<(#x)<<"="<<x<<"\n";
#define N 200010
template <class U,class T> void Max(U &x, T y){if(x<y)x=y;}
template <class U,class T> void Min(U &x, T y){if(x>y)x=y;}
template <class T> void add(int &a,T b){a=(a+b)%mod;}
using namespace std;
struct st{
   char id[12];
   int hh,mm,ss;
}temp,ans1,ans2;
bool cmp(st s1,st s2)
{
    if(s1.hh!=s2.hh) return s1.hh>s2.hh;
    if(s1.mm!=s2.mm) return s1.mm>s2.mm;
    return s1.ss>s2.ss;
}
int main()
{
    int n;
    cin>>n;
    ans1.hh=24,ans1.mm=60,ans1.ss=60;
    ans2.hh=0,ans2.mm=0,ans2.ss=0;
    rep(i,0,n)
    {
        scanf("%s %d:%d:%d",temp.id,&temp.hh,&temp.mm,&temp.ss);
        if(cmp(temp,ans1)==false) ans1=temp;
        scanf("%d:%d:%d",&temp.hh,&temp.mm,&temp.ss);
        if(cmp(temp,ans2)==true)  ans2=temp;
    }
    cout<<ans1.id<<" "<<ans2.id<<endl;
    return 0;

}