#include<bits/stdc++.h>
using namespace std;
const int MAXN=100001;
int n,k;
struct Node{
string ID;
int time;
int sign;
Node(){
sign=-1;
time=-1;
}
};
bool cmp(Node a,Node b){
if(a.ID!=b.ID) return a.ID<b.ID;
else return a.time<b.time;
}
bool cmp1(Node a,Node b){
if(a.time!=b.time) return a.time<b.time;
}
vector<Node> ppp;
int main()
{
#ifndef ONLINE_JUDGE
freopen("in.txt","r",stdin);
#endif
cin>>n>>k;
ppp.resize(n);
for(int i=0;i<n;i++){
string temp1,status;
int h,m,s;
cin>>temp1;
ppp[i].ID=temp1;
scanf("%d:%d:%d",&h,&m,&s);cin>>status;
int t=h*3600+m*60+s;
ppp[i].time=t;
ppp[i].sign=(status=="in"?1:-1);
}
sort(ppp.begin(),ppp.end(),cmp);
vector<Node> qqq;
for(int i=0;i<n-1;i++){
if(ppp[i].sign==1&&ppp[i+1].sign==-1&&(ppp[i].ID==ppp[i+1].ID)){
qqq.push_back(ppp[i]);
qqq.push_back(ppp[i+1]);
}
}
map<string,int> tt;
int maxtime=0;
for(int i=0;i<qqq.size();i+=2){
tt[qqq[i].ID]+=qqq[i+1].time-qqq[i].time;
}
map<string,int>::iterator it=tt.begin();
vector<string> vv;
while(it!=tt.end()){
if(it->second>maxtime){
maxtime=it->second;
vv.clear();
vv.push_back(it->first);
}else if(it->second==maxtime){
vv.push_back(it->first);
}
it++;
}
sort(qqq.begin(),qqq.end(),cmp1);
for(int i=0;i<k;i++){
int h,m,s;
scanf("%d:%d:%d",&h,&m,&s);
int t=h*3600+m*60+s;
int w=0;
for(int ii=0;ii<qqq.size();ii++){
if(t<qqq[ii].time){
w=ii;break;
}
}
int cnt=0;
for(int j=0;j<w;j++){
cnt+=qqq[j].sign;
}
cout<<cnt<<endl;
}
for(int i=0;i<vv.size();i++){
if(i==0) cout<<vv[i];
else cout<<' '<<vv[i];
}
cout<<' ';
printf("%02d:%02d:%02d\n",maxtime/3600,maxtime%3600/60,maxtime%3600%60);
return 0;
}
此题22分飘过,两个段错误待解决