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.

解析

给出m条数据,每条包含 人名、到达时间、离开时间。
输出最早到教室的人和最迟离开教室的人

代码

#include<bits/stdc++.h>

using namespace std;

int n;
string unlock_man, lock_man;
char unlock_time[15], lock_time[15];

int compare(const char *time1, const char *time2) {
    int hour1, min1, sec1;
    int hour2, min2, sec2;
    sscanf(time1, "%d:%d:%d", &hour1, &min1, &sec1);
    sscanf(time2, "%d:%d:%d", &hour2, &min2, &sec2);
    int tm1, tm2;
    tm1 = hour1 * 3600 + min1 * 60 + sec1;
    tm2 = hour2 * 3600 + min2 * 60 + sec2;
    if (tm1 != tm2) return (tm1 > tm2) ? 1 : 0;
    return 2;
}

void pat1006() {

    cin >> n;
    for (int i = 0; i < n; ++i) {
        if (i == 0) {
            cin >> unlock_man >> unlock_time >> lock_time;
            lock_man = unlock_man;
            continue;
        }

        char time1[15], time2[15];
        string man;
        cin >> man >> time1 >> time2;
        int r = compare(time1, unlock_time);
        if (r == 0) {
            unlock_man = man;
            strcpy(unlock_time, time1);
        }
        int r2 = compare(time2, lock_time);
        if (r2 == 1) {
            lock_man = man;
            strcpy(lock_time, time2);
        }
    }
    cout << unlock_man << " " << lock_man;
}


int main() {
    pat1006();
    return 0;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值