ZOJ

Access System

 ZOJ - 3787 

#include<iostream>#include<cstdio>#include<math.h>#include<cstring>#include<climits>#include<string>#include<queue>#include<stack>#include<set>#include<map>#include<list>#include<vector>#include<sstream>#include<algorithm>using namespace std;#define rep(i,j,k)for(i=j;i<k;i++)#define per(i,j,k)for(i=j;i>k;i--)#define ms(x,y)memset(x,y,sizeof(x))#define lson l,m,rt<<1#define rson m+1,r,rt<<1|1#define ll long longconst int INF=0x7ffffff;const int M=2e4+10;int i,j,k,n,m;int pa[M];struct node{    int num;ll tim;};struct cmp{    bool operator()(node a,node b){     return a.tim>b.tim;    }};priority_queue<node,vector<node>,cmp >q;int main(){    int T;    while(~scanf("%d",&T)){    while(T--){        scanf("%d%d",&n,&k);        int a,b,c;        for(int i=1;i<=n;i++){            scanf("%d:%d:%d",&a,&b,&c);            node qq;            qq.tim=a*3600+b*60+c;            qq.num=i;            q.push(qq);        }        node st;        st=q.top();        q.pop();        int ans=0;        pa[ans++]=st.num;        while(!q.empty()){            node qqq;            qqq=q.top();            q.pop();            if((qqq.tim-st.tim)<k)continue;            pa[ans++]=qqq.num;            st.tim=qqq.tim;        }        sort(pa,pa+ans);        printf("%d\n",ans);        for(i=0;i<ans-1;i++){            printf("%d ",pa[i]);        }        printf("%d\n",pa[ans-1]);    }    }    return 0;}