码迷,mamicode.com
首页 > 其他好文 > 详细

PATA 1006. Sign In and Sign Out (25)

时间:2018-02-13 20:58:05      阅读:177      评论:0      收藏:0      [点我收藏+]

标签:can   its   pac   include   bit   visit   post   ace   mes   

#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
struct visitor{
	char ID[20];
	int in_h,in_m,in_s;
	int out_h,out_m,out_s;
}v[N]; 

int main(){
	int m,i;
	struct visitor late,early;//最晚,最早
	int latenum,earlynum; 
	scanf("%d",&m);
	for( i = 0;i < m; i++)
	{
		scanf("%s %d:%d:%d %d:%d:%d",v[i].ID,&v[i].in_h,&v[i].in_m,&v[i].in_s,&v[i].out_h,&v[i].out_m,&v[i].out_s);
		
	}
	late = v[0];
	early = v[0];
	for(i = 1;i < m; i++)
	{
		if(v[i].in_h < early.in_h) {
			early = v[i];
			earlynum = i;
		}
		else if(v[i].in_h == early.in_h) {
			if(v[i].in_m < early.in_m){
				early = v[i]; 
				earlynum = i;
			}
			else if(v[i].in_m == early.in_m){
				if(v[i].in_s < early.in_s ){
					early = v[i];
					earlynum = i;
				}
			}
			
		}
		
		if(v[i].out_h > late.out_h)	{late = v[i];latenum = i;}
		else if(v[i].out_h == late.out_h){
			if(v[i].out_m > late.out_m){
				late = v[i]; 
				latenum = i;
			}
			else if(v[i].out_m == late.out_m){
				if(v[i].out_s > late.out_s)
				{
					late = v[i];
					latenum = i;
				}
			}
			 
		}
	}
	printf("%s %s",v[earlynum].ID,v[latenum].ID);
	return 0;
}

  

PATA 1006. Sign In and Sign Out (25)

标签:can   its   pac   include   bit   visit   post   ace   mes   

原文地址:https://www.cnblogs.com/qiangz/p/8447338.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!