GCPC2013 B. Booking （贪心

题意：

区间覆盖的裸题，结构体排个序即可。

//
// Created by Yishui on 18-9-4.
//
#include <bits/stdc++.h>
using namespace std;

#define cpp_io() {ios::sync_with_stdio(false); cin.tie(NULL);}
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define CLR(a,b) memset(a,(b),sizeof(a))
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ls o<<1
#define rs o<<1|1

typedef long long ll;
typedef vector<int> VI;
const int MAXN = (int)2e2+10;
const int INF = 0x3f3f3f3f;
const int mod = (int)1e9+7;

int m[]={31,28,31,30,31,30,31,31,30,31,30,31};
struct node{
    ll t;
    bool v;
};
bool cmp(node a,node b) {
    if(a.t==b.t) return a.v<b.v;
    return a.t<b.t;
}
ll q(ll a, ll b) {
    ll ans=365*a;
    rep(i,0,b-1) ans+=m[i];
    if(a==2016&&b>2) ans++;
    return ans;
}
int main() {
    // cpp.io()
    int T;cin>>T;
    while(T--){
        vector<node> v;
        int n,t;
        cin>>n>>t; t*=60;
        rep(i,0,n){
            string s;
            ll a,b,c,x,y;
            node t1, t2;
            cin>>s;
            scanf("%lld-%lld-%lld %lld:%lld",&a,&b,&c,&x,&y);
            t1.t=1LL*q(a,b)*(24*3600)+(c*24*3600)+(x*3600)+y*60;
            t1.v=true;

            scanf("%lld-%lld-%lld %lld:%lld",&a,&b,&c,&x,&y);
            t2.t=1LL*q(a,b)*(24*3600)+(c*24*3600)+(x*3600)+y*60+t;
            t2.v=false;
            v.pb(t1); v.pb(t2);
        }
        sort(all(v),cmp);
        int mx=-1, k=0;
        rep(i,0,SZ(v)){
            if(v[i].v) {
                k++; mx=max(mx,k);
            }
            else k--;
        }
        cout<<mx<<endl;
    }
    return 0;
}