1006. Sign In and Sign Out (25)
来源:互联网 发布:微刊制作软件 编辑:程序博客网 时间:2024/05/29 06:37
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:3CS301111 15:30:28 17:00:10SC3021234 08:00:00 11:25:25CS301133 21:45:00 21:58:40Sample Output:
SC3021234 CS301133
评测结果
时间 结果 得分 题目 语言 用时(ms) 内存(kB) 用户 7月17日 20:16答案正确251006C++ (g++ 4.7.2)1364datrilla测试点
测试点 结果 用时(ms) 内存(kB) 得分/满分 0答案正确12442/21答案正确13644/42答案正确12564/43答案正确13644/44答案正确13645/55答案正确12566/6#include<iostream>#include<string>using namespace std;bool CompareTime(string tmax,string tmin){ if(tmax[0]>tmin[0]) return true; else if(tmax[0]==tmin[0]) { if(tmax[1]>tmin[1]) return true; else if(tmax[1]==tmin[1]) { if(tmax[3]>tmin[3]) return true; else if(tmax[3]==tmin[3]) { if(tmax[4]>tmin[4]) return true; else if(tmax[4]==tmin[4]) { if(tmax[6]>tmin[6]) return true; else if(tmax[6]==tmin[6]&&tmax[7]>tmin[7]) return true; } } } } return false;}int main(){ int M; string ID_number1,Sign_in_time,Sign_out_time,n1,t1,t2,ID_number12; cin>>M; cin>>ID_number1>>Sign_in_time>>Sign_out_time; ID_number12=ID_number1; M--; while(M--) { cin>>n1>>t1>>t2; if(CompareTime(Sign_in_time,t1)) { Sign_in_time=t1; ID_number1=n1; } if(CompareTime(t2,Sign_out_time)) { Sign_out_time=t2; ID_number12=n1; } } cout<<ID_number1<<" "<<ID_number12<<endl; 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)
- 第四天 数组
- 批处理文件
- bj java初学2015-7-17
- 最大公约数和最小公倍数
- 背景图草稿
- 1006. Sign In and Sign Out (25)
- 【小结】强联通分量分解
- Activity四种启动模式 及 Intent Flags 与 栈 的关联分析
- 乘积最大
- 文章标题
- 字符串
- 为什么不要用苹果的@icloud.com邮箱申请你的APP ID
- 字符串排序
- 1024. Palindromic Number