1006. Sign In and Sign Out (25)
来源:互联网 发布:网络听课神器 编辑:程序博客网 时间:2024/04/28 05:54
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
题目很简单,但是当我使用字符串进行比较的时候,出现了错误。对比AC代码,在原理上完全一致,不知道哪里出了问题。
#include<iostream>#include<string>using namespace std;bool cmp(string t1,string t2){ int j=0; string cmp1="",cmp2=""; while(cmp1==cmp2&&j!=6){ cmp1=t1.substr(j,j+2); cmp2=t2.substr(j,j+2); j+=2; } if(cmp1>cmp2) return true; else return false;}struct record{ int hi,mi,si; char id[20]; record(){} record(int h,int m,int s){ hi=h,mi=m,si=s; }};bool great(record a,record b){ if(a.hi!=b.hi) return a.hi>b.hi; else if(a.mi!=b.mi) return a.mi>b.mi; else return a.si>b.si;}int main(){ freopen("in.txt","r",stdin); int n; cin>>n; record come=record(24,60,60),left=record(0,0,0); while(n--){ record t; scanf("%s %d:%d:%d",&t.id,&t.hi,&t.mi,&t.si); if (great(come,t)) come=t; scanf("%d:%d:%d",&t.hi,&t.mi,&t.si); if(great(t,left)) left=t; } cout<<come.id<<" "<<left.id; /* string name,firstname,lastname,firsttime,lasttime,come,left; cin>>name>>firsttime>>lasttime; firstname=name,lastname=name; for(int i=1;i<n;i++){ cin>>name>>come>>left; if(cmp(left,lasttime)){ lastname=left,lastname=name; } if(cmp(firsttime,come)){ firsttime=come,firstname=name; } } cout<<firstname<<" "<<lastname<<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)
- 数据库复习三
- bzoj1597 土地购买
- Nodejs Assert
- 嵌入式代码结构
- 年终总结(15-16)
- 1006. Sign In and Sign Out (25)
- android:Activity启动模式之singleTop
- oracle 归档日志满处理
- Python安装——Windows
- 杂谈
- left join on and与left join on where的区别
- 1.1.2抽象数据类型举例
- Android 网络编程--socket tcp/ip udp http之间的关系
- github 提交更新