PAT Advanced 1006. Sign In and Sign Out (25) (C语言实现)

本文介绍了一道PAT竞赛中的签到签退问题,通过分析输入输出规格,提出了解决方案,即找出最早签到和最晚签出的人。使用C语言实现,通过将时间转换为秒数进行比较。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

我的PAT系列文章更新重心已移至Github,欢迎来看PAT题解的小伙伴请到Github Pages浏览最新内容。此处文章目前已更新至与Github Pages同步。欢迎star我的repo

题目

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

思路

基本和PAT Basic 1028. 人口普查(20)(C语言实现)思路一致。

找到最早签到和最晚签出的即可。

代码

最新代码@github,欢迎交流

#include <stdio.h>
#include <string.h>

int main()
{
    int N, HH, MM, SS;
    int firsttime = 86400, lasttime = -1, time;
    char firstname[16], lastname[16], name[16];

    scanf("%d", &N);
    for(int i = 0; i < N; i++)
    {
        scanf("%s %d:%d:%d", name, &HH, &MM, &SS);
        time = (HH * 60 + MM) * 60 + SS;
        if(time < firsttime)
        {
            firsttime = time;
            strcpy(firstname, name);
        }

        scanf("%d:%d:%d", &HH, &MM, &SS);
        time = (HH * 60 + MM) * 60 + SS;
        if(time > lasttime)
        {
            lasttime = time;
            strcpy(lastname, name);
        }
    }

    printf("%s %s", firstname, lastname);

    return 0;
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值