1006. Sign In and Sign Out (25)
来源:互联网 发布:64位sql安装提示错误 编辑:程序博客网 时间:2024/06/18 02:15
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#include<iostream>#include<algorithm>#include<vector>#include<map>#include<string>using namespace std;typedef struct record{string name;int inh,inm,ins;int outh,outm,outs;}record;bool a_less_b(record & a,record & b){if(a.inh==b.inh)if(a.inm==b.inm)return a.ins<b.ins;elsereturn a.inm<b.inm;elsereturn a.inh<b.inh;}bool a_more_b(const record & a,const record & b){if(a.outh==b.outh)if(a.outm==b.outm)return a.outs>b.outs;elsereturn a.outm>b.outm;elsereturn a.outh>b.outh;}int strtoint(string str){int temp,sum=0;for(int i=0;i<str.length();i++){temp=str[i]-'0';sum*=10;sum+=temp;}return sum;}int main(){string str1,str2,str3,str4;int num,temph,tempm,temps;vector<record> vec;cin>>num;while(num){record rec;cin>>str1>>str2>>str3;rec.name=str1;str4=str2.substr(0,2);temph=strtoint(str4);rec.inh=temph;str4=str2.substr(3,2);tempm=strtoint(str4);rec.inm=tempm;str4=str2.substr(6,2);temps=strtoint(str4);rec.ins=temps;str4=str3.substr(0,2);temph=strtoint(str4);rec.outh=temph;str4=str3.substr(3,2);temph=strtoint(str4);rec.outm=temph;str4=str3.substr(6,2);temph=strtoint(str4);rec.outs=temph;vec.push_back(rec);num--;}sort(vec.begin(),vec.end(),a_less_b);cout<<vec[0].name<<' ';sort(vec.begin(),vec.end(),a_more_b);cout<<vec[0].name;}
- 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)
- 取一个整数数组中最大和次大的二个数
- Tcl -- variable
- 责任型模式之Singleton(单例)模式
- SDAU 搜索专题 06 Line belt
- NFS
- 1006. Sign In and Sign Out (25)
- poj1017(贪心)
- 2016-04-06
- 多表联合操作
- LeetCode--max-points-on-a-line
- KMP字符串匹配算法(二)—KMP要点和证明
- 整数之循环节点求和
- Django Project在apache部署配置信息
- jQuery 效果(2)——停止动画