PAT (Advanced Level) 1095. Cars on Campus (30)

模拟题。仔细一些即可。

#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<map>
#include<queue>
#include<cstring>
#include<stack>
#include<vector>
#include<iostream>
using namespace std;

int n,m;
struct Info
{
    string id;
    int time,f;
    int quary;
}tmp[+],s[+];

string ans[+];

struct SJ
{
    string id;
    int time;
}sj[+];

bool cmp(const Info&a,const Info&b)
{
    if(a.id==b.id) return a.time<b.time;
    return a.id<b.id;
}

bool cmp2(const Info&a,const Info&b)
{
    if(a.time==b.time) return a.quary<b.quary;
    return a.time<b.time;
}

int main()
{
    scanf("%d%d",&n,&m);
    for(int i=;i<=n;i++)
    {
        cin>>tmp[i].id;
        int hh,mm,ss; scanf("%d:%d:%d",&hh,&mm,&ss);
        tmp[i].time=hh**+mm*+ss;
        char op[]; scanf("%s",op);
        if(op[]=='i') tmp[i].f=;
        else tmp[i].f=;
        tmp[i].quary=;
    }

    sort(tmp+,tmp++n,cmp);

    int sz=,p=;
    while()
    {
        if(p>n) break;
        if(tmp[p].f==)
        {
            if(tmp[p+].f==&&tmp[p+].id==tmp[p].id)
            {
                s[sz++]=tmp[p];
                s[sz++]=tmp[p+];
                p=p+;
            }
            else p++;
        }
        else p++;
    }

    int r=;
    sj[r].id=s[].id;
    sj[r].time=s[].time-s[].time;
    for(int i=;i<sz;i=i+)
    {
        if(s[i].id==s[i-].id)
        {
            sj[r].time=sj[r].time+s[i+].time-s[i].time;
        }
        else
        {
            r++;
            sj[r].id=s[i].id;
            sj[r].time=s[i+].time-s[i].time;
        }
    }
    r++;

    int Max=,u=;
    for(int i=;i<r;i++) Max=max(Max,sj[i].time);
    for(int i=;i<r;i++)
        if(sj[i].time==Max)
            ans[u++]=sj[i].id;
    sort(ans,ans+u);

    for(int i=;i<m;i++)
    {
        int hh,mm,ss; scanf("%d:%d:%d",&hh,&mm,&ss);
        s[sz].quary=;
        s[sz++].time=hh**+mm*+ss;
    }

    sort(s,s+sz,cmp2);

    int num=;
    for(int i=;i<sz;i++)
    {
        if(s[i].quary==)
        {
            printf("%d\n",num);
        }
        else {
            if(s[i].f==) num++;
            else num--;
        }
    }

    sort(ans,ans+u);
    for(int i=;i<u;i++)
    {
        cout<<ans[i];
        printf(" ");
    }

    int hh,mm,ss;
    hh=Max/; Max=Max-hh*;
    mm=Max/; Max=Max-mm*;
    ss=Max;

    printf("%02d:%02d:%02d\n",hh,mm,ss);

    return ;
}