L1-043. 阅览室

//遇到之后新借阅记录不是continue而是覆盖原记录
//平均时间要四舍五入
#include<cstdio>
#include<iostream>
#include<math.h>
#include<string.h>
#include<stdlib.h>
#include<algorithm>
using namespace std;
struct jl
{
  int sthour;
  int stmin;
}book[1005];
int main()
{
  int n,xh;
  cin>>n;
  for(xh=1;xh<=n;xh++)
  {
    int sum=0;
    int cnt=0;
    memset(book,-1,sizeof(book));
    int num,th,tm;
    char act;
    while(1)
    {
      scanf("%d %c",&num,&act);
      scanf("%d:%d",&th,&tm);
      if(num==0) break;
      else if(num<0||num>1000) continue;
      if(act=='S')
      {
          book[num].sthour=th;
          book[num].stmin=tm;
      }
      if(act=='E')
      {
        if(book[num].sthour==-1) continue;
        else
        {
          sum=sum+(th-book[num].sthour)*60+(tm-book[num].stmin);
          book[num].sthour=-1;book[num].stmin=-1;
          cnt++;
        }
      }
    }
    cout<<cnt<<" ";
    if(cnt==0) cout<<0<<endl;
    else 
    {
      double wcl=(double)sum/cnt;
      cout<<(int)(wcl+0.5)<<endl;
    }
  }
  return 0;
}