PAT A 1006. Sign In and Sign Out (25)
来源:互联网 发布:linux系统移植步骤 编辑:程序博客网 时间:2024/05/19 21:43
原题:
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:
3CS301111 15:30:28 17:00:10SC3021234 08:00:00 11:25:25CS301133 21:45:00 21:58:40
Sample Output:
SC3021234 CS301133
即求最早入和最晚出的学号,直接模拟就可以了。
代码把数据都存了再处理,比较浪费空间,其实依次扫过去就可以了……
代码:
#include <iostream>using namespace std;int get_time();//输入时间,转化为秒int main(){int m,i;int *time_in,*time_out;//入、出时间char **num;//学号int time_in_min=0,time_out_max=0;//最早进入,最晚离开的序号cin>>m;time_in=new int[m];time_out=new int[m];num=new char*[m];for(i=0;i<m;i++)num[i]=new char[16];for(i=0;i<m;i++)//输入数据{cin>>num[i];time_in[i]=get_time();time_out[i]=get_time();if(time_in[i]<time_in[time_in_min])time_in_min=i;if(time_out[i]>time_out[time_out_max])time_out_max=i;}cout<<num[time_in_min]<<" "<<num[time_out_max];for(i=0;i<m;i++)delete[] num[i];delete [] num;delete [] time_in;delete [] time_out;return 0;}int get_time()//获取时间,以秒为单位{int t1,t2;cin>>t1;t1*=60;cin.get();//为跳过时间中的":"分割符,需要一个cin.get()cin>>t2;t1=(t1+t2)*60;cin.get();cin>>t2;t1+=t2;return t1;}
- PAT A 1006. Sign In and Sign Out (25)
- PAT A 1006. Sign In and Sign Out (25)
- PAT-A 1006. Sign In and Sign Out (25)
- PAT(A) - 1006. Sign In and Sign Out (25)
- PAT-A 1006. Sign In and Sign Out (25)
- PAT A 1006. Sign In and Sign Out (25)
- PAT-A-1006. Sign In and Sign Out (25)
- PAT-A 1006. Sign In and Sign Out (25)
- PAT-A 1006. Sign In and Sign Out
- PAT 1006. Sign In and Sign Out
- PAT 1006. Sign In and Sign Out
- 【PAT】1006. Sign In and Sign Out
- PAT-Sign In and Sign Out (25)
- 1006. Sign In and Sign Out (25)-PAT
- 【PAT】1006. Sign In and Sign Out (25)
- 【PAT Advanced Level】1006. Sign In and Sign Out (25)
- PAT 1006. Sign In and Sign Out (25)
- 【PAT (Advanced Level)】1006. Sign In and Sign Out (25)
- Android流量统计TrafficStats类的使用
- Bluetooth in Android 4.2 and 4.3(一):综述
- nefu 677 Gift
- ora-01659 无法分配超出3的MINEXTENTS
- 【仿微盟源码】利用第三方微信营销托管平台快速增加粉丝,形成良好互动,打造精美微信APP。
- PAT A 1006. Sign In and Sign Out (25)
- 移动硬盘文件损坏怎么恢复
- BISS001使用
- 关于报urllib2.HTTPError: HTTP Error 401: Unauthorized错误问题
- git 回滚版本
- 8583报文详细分析
- 你不二之选的Java培训机构
- JS弹出居中的DIV
- iPhone 6年代iWatch热销缘由:可穿戴更有招引力