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
#include <iostream>
#include<cstdio>
using namespace std;
typedef struct Biao
{
char bianhao[15];
int inhh;
int inmm;
int inss;
int outhh;
int outmm;
int outss;
}Biao;
int main()
{
int m=0;
while(scanf("%d",&m)!=EOF)
{
int temp=m;
Biao biao[m];
//m--;
while(m--)
{
scanf("%s",biao[m].bianhao);
scanf("%d:%d:%d",&biao[m].inhh,&biao[m].inmm,&biao[m].inss);
scanf("%d:%d:%d",&biao[m].outhh,&biao[m].outmm,&biao[m].outss);
// printf("%s %d:%d:%d %d:%d:%d",biao[m].bianhao,biao[m].inhh,biao[m].inmm,biao[m].inss,biao[m].outhh,biao[m].outmm,biao[m].outss);
}
m=temp;
//比较进入的时间最早,和出去的时间最短。
m--;
Biao in=biao[m];
Biao out=biao[m];
while(m--)
{
if(in.inhh>biao[m].inhh)
{
in=biao[m];
}
else if(in.inmm>biao[m].inmm&&in.inhh==biao[m].inhh)
{
in=biao[m];
}
else if(in.inss>biao[m].inss&&in.inmm==biao[m].inmm)
{
in=biao[m];
}
if(out.outhh<biao[m].outhh)
{
out=biao[m];
}
else if(out.outmm<biao[m].outmm&&out.outhh==biao[m].outhh)
{
out=biao[m];
}
else if(out.outss<biao[m].outss&&out.outmm==biao[m].outmm)
{
out=biao[m];
}
}
printf("%s %s",in.bianhao,out.bianhao);
}
return 0;
}
错误一次,输出格式错误,粗心大意。
在输入时用“:”分割开整型,减少了进一步的处理。但如果将时间类型设置成字符,应该更简单,这样一次就可以比较出大小,有兴趣的读者可以试一下。