zoukankan      html  css  js  c++  java
  • 1006. Sign In and Sign Out

    1006. Sign In and Sign Out (25)

    时间限制
    400 ms
    内存限制
    65536 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
     1 #include<stdio.h>
     2 #include<math.h>
     3 #include<stdlib.h>
     4 #include<string.h>
     5 
     6 struct man
     7 {
     8     char id[20];
     9     int in_h, in_m, in_s, out_h, out_m, out_s;
    10 };
    11 man a[10000];
    12 int main()
    13 {
    14     int m, i;
    15     man earlest, lastest, temp;
    16     earlest.in_h = 24;
    17     earlest.in_m = 59;
    18     earlest.in_s = 59;
    19     lastest.out_h = 0;
    20     lastest.out_m = 0;
    21     lastest.out_s = 0;
    22     bool isearly(man x, man y);
    23     bool islastly(man x, man y);
    24     scanf("%d", &m);
    25     for(i = 0; i < m; i++)
    26     {
    27         scanf("%s%d:%d:%d%d:%d:%d", temp.id, &temp.in_h, &temp.in_m, &temp.in_s, &temp.out_h, &temp.out_m, &temp.out_s);
    28         if(isearly(temp, earlest))
    29             earlest = temp;
    30         if(islastly(temp, lastest))
    31             lastest = temp;
    32     }
    33     printf("%s %s
    ", earlest.id, lastest.id);
    34     return 0;
    35 }
    36 
    37 bool isearly(man x, man y)
    38 {
    39     if(x.in_h != y.in_h)
    40         return x.in_h <= y.in_h;
    41     else if(x.in_m != y.in_m)
    42         return x.in_m <= y.in_m;
    43     else
    44         return x.in_s <= y.in_s;
    45 }
    46 
    47 bool islastly(man x, man y)
    48 {
    49     if(x.out_h != y.out_h)
    50         return x.out_h >= y.out_h;
    51     else if(x.out_m != y.out_m)
    52         return x.out_m >= y.out_m;
    53     else
    54         return x.out_s >= y.out_s;
    55 }
  • 相关阅读:
    JavaScript实现继承的几种方式总结一
    MyISAM key 压缩
    Visual Studio2010英文版安装中文帮助文档
    回忆我是怎样走上程序之路的(上)起因
    hdu2054 A==B
    顺序表的增删排序
    hdu2145 zz's Mysterious Present
    hdu 2141 Can you find it?
    hdu1162 Eddy's picture
    hdu1142 A Walk Through the Forest
  • 原文地址:https://www.cnblogs.com/yomman/p/4269755.html
Copyright © 2011-2022 走看看