PAT_ADVANCED LEVEL 1006 Sign In and Sign Out (25) 排序

本文深入探讨了信息技术领域的多个细分技术领域,包括前端开发、后端开发、移动开发、游戏开发等,涵盖了从基础到进阶的技术知识,为读者提供了一个全面的视角。
摘要由CSDN通过智能技术生成

1006. Sign In and Sign Out (25)

时间限制
400 ms
内存限制
32000 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue

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<vector>
#include<string>
#include<algorithm>

using namespace std;

struct Times{
	int hour;
	int min;
	int sec;

	
	void setTimes(string input){
		int bits = 3;
		this->hour = num_val(input[0])*10 + num_val(input[1]) * 1;
		this->min = num_val(input[3]) * 10 + num_val(input[4]) * 1;
		this->sec = num_val(input[6]) * 10 + num_val(input[7]) * 1;
	}
	int num_val(char ch){
		return ch - '0';
	}
};

struct Record{
	string name;
	string signInTime;
	string signOutTime;
	
	Times inTime;
	Times outTime;

	Record(string name,string signIn,string signOut){
		this->name = name;
		this->inTime.setTimes(signIn);
		this->outTime.setTimes(signOut);
	}
};


inline bool compare(Record record1,Record record2){
	Times time1 = record1.inTime;
	Times time2 = record2.inTime;
	bool ans = 0;
	if( time1.hour != time2.hour){
		ans = time1.hour < time2.hour;
	}else if( time1.min != time2.min){
		ans = time1.min < time2.min;
	}else{
		ans = time1.sec < time2.sec;
	}
	return ans;
}
inline bool compareOut(Record record1,Record record2){
		Times time1 = record1.outTime;
		Times time2 = record2.outTime;
	bool ans = 0;
	if( time1.hour != time2.hour){
		ans = time1.hour > time2.hour;
	}else if( time1.min != time2.min){
		ans = time1.min > time2.min;
	}else{
		ans = time1.sec > time2.sec;
	}
	return ans;
}
int main(){
	int N = 0;
	cin>>N;
	vector<Record> records;
	for(int i = 0; i<N; i++){
		string name,signIn,signOut;
		cin>>name>>signIn>>signOut;
		Record rec = Record(name,signIn,signOut);
		records.push_back(rec);
	}

	sort(records.begin(), records.end(),compare);
	cout<<records[0].name<<" ";

	sort(records.begin(), records.end(),compareOut);
	cout<<records[0].name<<endl;

	return 0;
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值