1006. Sign In and Sign Out (25)解题思路
来源:互联网 发布:linux激活网卡 编辑:程序博客网 时间:2024/05/29 23:24
1006. Sign In and Sign Out (25)解题思路
目录
- Sign In and Sign Out 25解题思路
- 目录
- 原题
- 解题思路
- 复杂度分析
- code
原题
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
解题思路
- 读入M。
- 进行M次循环。设置开门时间char t_open[] = 235959,关门时间char t_close[] = 000000。开门人char id_open[16],关门人id_close[16]。
1.读入身份号码,上班时间和下班时间。
2.使用strcmp将上班时间与t_open进行比较,如果上班时间小于t_open,那么strcpy(t_open,上班时间)。strcpy(id_open, id)。
3.使用strcmp将下班时间与t_close进行比较,如果下班时间大于t_close,那么strcpy(t_close, 下班时间)。strcpy(id_close, id)。
3.输出结果。
复杂度分析
时间复杂度O(n),空间复杂度O(1)。
code
#include <iostream>#include <cstdio>#include <cstring>int main(void){ setvbuf(stdin, new char[1 << 20], _IOFBF, 1 << 20); setvbuf(stdout, new char[1 << 20], _IOFBF, 1 << 20); int m; scanf("%d", &m); char id_open[16], id_close[16], t_open[] = "23:59:59", t_close[] = "00:00:00"; char id[16], arrive[9], depart[9]; for (int i = 0; i < m; i++) { scanf("%s %s %s", id, arrive, depart); if (strcmp(t_open, arrive) > 0) { strcpy(id_open, id); strcpy(t_open, arrive); } if (strcmp(t_close, depart) < 0) { strcpy(id_close, id); strcpy(t_close, depart); } } printf("%s %s\n", id_open, id_close); return 0;}
- 1006. Sign In and Sign Out (25)解题思路
- 1006. Sign In and Sign Out (25)
- 1006. Sign In and Sign Out (25)
- 1006. Sign In and Sign Out (25)
- 1006. Sign In and Sign Out (25)
- 1006. Sign In and Sign Out (25)
- 1006. Sign In and Sign Out (25)
- 1006. Sign In and Sign Out (25)
- 1006. Sign In and Sign Out (25)
- 1006. Sign In and Sign Out (25)
- 1006. Sign In and Sign Out (25)
- 1006. Sign In and Sign Out (25)
- 1006. Sign In and Sign Out (25)
- 1006. Sign In and Sign Out (25)
- 1006. Sign In and Sign Out (25)
- 1006. Sign In and Sign Out (25)
- 1006. Sign In and Sign Out (25)
- 1006. Sign In and Sign Out (25)
- xxxxx
- csdn待改进点之27------>作为用户, 我不懂什么叫参数错误!
- SQL复习笔记一(mysql)
- [Leetcode刷题]Summary Ranges
- erdaicms旅游网站程序模板免费下载(PC站自带手机站,自带3套模板可切换,对接支付宝和微信支付)
- 1006. Sign In and Sign Out (25)解题思路
- 2016年6月22日--6月26日(共15小时,剩下2940小时)
- ubuntu 12.04安装OpenGL
- 基于Hadoop生态圈的数据仓库实践 —— 目录
- 基于Hadoop生态圈的数据仓库实践 —— 概述(一)
- git oschina
- Matlab与单片机的串行通信及数据处理
- css的几种引用方式
- Qt中emit的作用