ZOJ 3787 Access System
来源:互联网 发布:电脑软件制作 编辑:程序博客网 时间:2024/06/06 11:38
Description
For security issues, Marjar University has an access control system for each dormitory building.The system requires the students to use their personal identification cards to open the gate if they want to enter the building.
The gate will then remain unlocked for L seconds. For example L = 15, if a student came to the dormitory at 17:00:00 (in the format of HH:MM:SS) and used his card to open the gate. Any other students who come to the dormitory between [17:00:00, 17:00:15) can enter the building without authentication. If there is another student comes to the dorm at 17:00:15 or later, he must take out his card to unlock the gate again.
There are N students need to enter the dormitory. You are given the time they come to the gate. These lazy students will not use their cards unless necessary. Please find out the students who need to do so.
Input
There are multiple test cases. The first line of input contains an integer T indicating the number of test cases. For each test case:
The first line contains two integers N (1 <= N <= 20000) andL (1 <= L <= 3600). The next N lines, each line is a unique time between [00:00:00, 24:00:00) on the same day.
Output
For each test case, output two lines. The first line is the number of students who need to use the card to open the gate. The second line the the index (1-based) of these students in ascending order, separated by a space.
Sample Input
32 112:30:0012:30:015 1517:00:0017:00:1517:00:0617:01:0017:00:143 512:00:0912:00:0512:00:00
Sample Output
21 231 2 422 3
模拟题,按照题目的意思模拟一下过程即可。
#include <stdio.h>#include <algorithm>#define N 20005using namespace std;typedef struct{ int index; int time;}ST;ST a[N];int ans[N];bool cmp(ST a,ST b){ return a.time<b.time;}int main(){ int t; scanf("%d",&t); while(t--) { int n,l; int sum=1; scanf("%d%d",&n,&l); int h,m,s; for(int i=1;i<=n;i++) { a[i].index=i; scanf("%d:%d:%d",&h,&m,&s); a[i].time=h*(3600)+m*60+s; } sort(a+1,a+n+1,cmp); int k=0; ans[k++]=a[1].index; int time=a[1].time; for(int i=2;i<=n;i++) { if(a[i].time-time>=l) { sum++; ans[k++]=a[i].index; time=a[i].time; } } sort(ans,ans+k); printf("%d\n",sum); printf("%d",ans[0]); for(int i=1;i<k;i++) printf(" %d",ans[i]); printf("\n"); } return 0;}
- ZOJ 3787 Access System
- ZOJ 3787 Access System
- ZOJ 3787 Access System
- ZOJ 3787 Access System
- zoj 3787 Access System
- ZOJ 3787 Access System
- ZOJ 3787 Access System
- ZOJ 3787 Access System
- ZOJ 3787 Access System 模拟
- ZOJ 3787Access System(排序)
- ZOJ Access System
- ZOJ-3787-Access System【11th浙江省赛】
- Access System
- Access System
- Access System
- zoj 1088 System Overload
- zoj-1088-System Overload
- zoj 1409 Communication System
- 黑马程序员------关于分布式
- MFC分隔字符串的四种方法
- Android通过代码模拟物理、屏幕点击事件
- 黑马程序员-----Java之你不得不知道的排序
- php set_error_handler() 重要用法
- ZOJ 3787 Access System
- hdu2063
- 数据结构—线性结构—线性及其实现
- 显示rust测试时候的print信息
- 韩鱼总结
- poj 1753 Flip Game
- mysql双主半同步的灾备测试结论
- ROM简单制作教程
- VMware虚拟机安装openstack注意事项