团体程序设计天梯赛-L2-042 老板的作息表

#include<bits/stdc++.h>
using namespace std;
typedef struct
{
    int x,y,z,h,m,s;
} Q;
Q a[101010];
bool cmp(Q t1,Q t2)
{
    if(t1.x!=t2.x)return t1.x<t2.x;
    else if(t1.y!=t2.y ) return t1.y<t2.y;
    else return t1.z<t2.z;
}
int main()
{
    int n,i,j,k;
    cin>>n;
    for(i=0; i<n; i++)scanf("%d:%d:%d - %d:%d:%d",&a[i].x,&a[i].y,&a[i].z,&a[i].h,&a[i].m,&a[i].s);
    sort(a,a+n,cmp);
    if(!(a[0].x==0&&a[0].y==0&&a[0].z==0))//如果第一个时间不是00：00：00，变成00：00：00
        printf("00:00:00 - %02d:%02d:%02d\n",a[0].x,a[0].y,a[0].z);
    for(i=0; i<n; i++)
    {
        if(i==n-1)
        {
            if(a[i].h==23&&a[i].m==59&&a[i].s==59)
            {
                continue;
            }
        }
        if(a[i].h!=a[i+1].x)
        {
            if(a[i+1].x==0&&a[i+1].y==0&&a[i+1].z==0)//判断排序后最后的时间是不是23：59：59，如果不是变成23：59：59
                a[i+1].x=23,a[i+1].y=59,a[i+1].z=59;
            printf("%02d:%02d:%02d - %02d:%02d:%02d\n",a[i].h,a[i].m,a[i].s,a[i+1].x,a[i+1].y,a[i+1].z);
        }
        else
        {
            if(a[i].m!=a[i+1].y)
            {
                if(a[i+1].x==0&&a[i+1].y==0&&a[i+1].z==0)
                    a[i+1].x=23,a[i+1].y=59,a[i+1].z=59;
                printf("%02d:%02d:%02d - %02d:%02d:%02d\n",a[i].h,a[i].m,a[i].s,a[i+1].x,a[i+1].y,a[i+1].z);
            }
            else
            {
                if(a[i].s!=a[i+1].z)
                {
                    if(a[i+1].x==0&&a[i+1].y==0&&a[i+1].z==0)
                        a[i+1].x=23,a[i+1].y=59,a[i+1].z=59;
                    printf("%02d:%02d:%02d - %02d:%02d:%02d\n",a[i].h,a[i].m,a[i].s,a[i+1].x,a[i+1].y,a[i+1].z);
                }
            }
        }
    }
}