hdu 4509 湫湫系列故事――减肥记II

水题

#include <iostream>#include <cstring>#include <string>#include <cstdio>#include <cmath>#include <algorithm>#include <vector>#include <queue>#include <map>#define inf 0x3f3f3f3f#define ll __int64using namespace std;int ty[1450];int main(){    int n,a,b,c,d,i,j,sta,end,ans;    while(~scanf("%d",&n))    {        memset(ty,0,sizeof ty);        for(i=0;i<n;i++)        {            scanf("%d:%d %d:%d",&a,&b,&c,&d);            sta=a*60+b;            end=c*60+d;            for(j=sta;j<end;j++)                ty[j]++;        }        ans=1440;        for(i=0;i<1440;i++)            if(ty[i]) ans--;        printf("%d\n",ans);    }    return 0;}