• 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:

    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

     1 import java.util.*;
     2 public class Main {
     3 
     4     public static void main(String[] args) {
     5         Scanner in = new Scanner(System.in);
     6         String M=in.nextLine();
     7         String early="24:00:00",late="00:00:00";
     8         String earlyPerson="",latePerson="";
     9         for(int i=0;i<Integer.parseInt(M);i++){
    10             String []line=in.nextLine().split(" ");
    11             if(line[1].compareTo(early)<0){
    12                 early=line[1];
    13                 earlyPerson=line[0];
    14             }
    15             if(line[2].compareTo(late)>0){
    16                 late=line[2];
    17                 latePerson=line[0];
    18             }
    19         }
    20         System.out.println(earlyPerson+" "+latePerson);
    21 
    22     }
    23 }
  • 相关阅读:
    bfs两种记录路径方法
    次小生成树
    2018 ICPC 区域赛 焦作场 D. Keiichi Tsuchiya the Drift King(计算几何)
    数组分组
    POJ
    数位DP详解
    2018ICPC青岛 E
    HDU
    Google工程师打造Remix OS系统 桌面版安卓下载
    使用angular封装echarts
  • 原文地址:https://www.cnblogs.com/BJUT-2010/p/5568172.html
Copyright © 2020-2023  润新知