PAT A1095 map应用

#include
#include
#include

struct car{
char id[8];
int time;
char status[6];
} all[10010],vaild[10010];

int timechange(int h,int m,int s)
{
return h3600+m60+s;
}

bool idorder(car a,car b)
{
if(strcmp(a.id,b.id)!=0) return strcmp(a.id,b.id)<0;
else return a.time<b.time;
}

bool timeorder(car a,car b)
{
return a.time<b.time;
}

int main()
{
int n,k,h,m,s;
map<string,int> stay;
scanf("%d%d",&n,&k);
for(int i=0;i<n;i++)
{
scanf("%s %d:%d:%d %s",all[i].id,&h,&m,&s,all[i].status);
all[i].time=timechange(h,m,s);
}
sort(all,all+n,idorder);
int j=0;
int maxt=-1;
for(int i=0;i<n;i++)
{
if(strcmp(all[i].id,all[i+1].id)==0&&strcmp(all[i].status,“in”)==0&&strcmp(all[i+1].status,“out”)==0)
{
vaild[j++]=all[i];
vaild[j++]=all[i+1];
if(stay.count(all[i].id)==0)
{
stay[all[i].id]=0;
}
stay[all[i].id]+=all[i+1].time-all[i].time;
maxt=max(maxt,stay[all[i].id]);
}
}
sort(vaild,vaild+j,timeorder);
int count=0;
int index=0;
for(int r=0;r<k;r++)
{
//count=0;
scanf("%d:%d:%d",&h,&m,&s);
int tt=timechange(h,m,s);
for(int i=index;tt>=vaild[i].time;i++)
{
if(strcmp(vaild[i].status,“in”)0)
count++;
else count–;
index=i+1;
if(ij-1) break;
}
printf("%d\n",count);
}
map<string,int>::iterator it;
for(it= stay.begin();it!=stay.end();it++)
{
if(it->second == maxt)
printf("%s “,it->first.c_str());//没见过
}
printf(”%02d:%02d:%02d\n",maxt/3600,maxt%3600/60,maxt%60);
return 0;
}

#include<cstdio>
#include<cstring>
#include<map>
#include<algorithm>
#include<string>//string 类型所需 
using namespace std;
 
struct car{
	char id[8];
	int time;
	char status[6];
} all[10010],vaild[10010];

int timechange(int h,int m,int s)
{
	return h*3600+m*60+s;
}

bool idorder(car a,car b)
{
	if(strcmp(a.id,b.id)!=0) return strcmp(a.id,b.id)<0;
	else return a.time<b.time;
}

bool timeorder(car a,car b)
{
	return a.time<b.time;
}

int main()
{
	int n,k,h,m,s;
	map<string,int> stay;
	scanf("%d%d",&n,&k);
	for(int i=0;i<n;i++)
	{
		scanf("%s %d:%d:%d %s",all[i].id,&h,&m,&s,all[i].status);
		all[i].time=timechange(h,m,s);	
	}
	sort(all,all+n,idorder);
	int j=0;
	int maxt=-1;
	for(int i=0;i<n;i++)
	{
		if(strcmp(all[i].id,all[i+1].id)==0&&strcmp(all[i].status,"in")==0&&strcmp(all[i+1].status,"out")==0)
		{
			vaild[j++]=all[i];
			vaild[j++]=all[i+1];
			if(stay.count(all[i].id)==0)
			{
				stay[all[i].id]=0;
			}
			stay[all[i].id]+=all[i+1].time-all[i].time;
			maxt=max(maxt,stay[all[i].id]);
		}
	}
	sort(vaild,vaild+j,timeorder);
	int count=0;
	for(int r=0;r<k;r++)
	{
		count=0;
		scanf("%d:%d:%d",&h,&m,&s);
		int tt=timechange(h,m,s);
		for(int i=0;tt>=vaild[i].time;i++)
		{
			if(strcmp(vaild[i].status,"in")==0) 
			count++;
			else count--;
			if(i==j-1) break;
		}
		printf("%d\n",count);
	}
	map<string,int>::iterator it;
	for(it= stay.begin();it!=stay.end();it++)
	{
		if(it->second == maxt)
		printf("%s ",it->first.c_str());//没见过 
	}
	/*const char *c_str();
c_str()函数返回一个指向正规C字符串的指针, 内容与本string串相同.
为了与C兼容，在C中没有string类型，故必须通过string类对象的成员函数c_str()把string对象转换成C中的字符串样式。
	*/printf("%02d:%02d:%02d\n",maxt/3600,maxt%3600/60,maxt%60);
	return 0;
}

超时

#include<cstdio>
#include<cstring>
#include<map>
#include<algorithm>
#include<string>//string 类型所需 
using namespace std;
 
struct car{
	char id[8];
	int time;
	char status[6];
} all[10010],vaild[10010];

int timechange(int h,int m,int s)
{
	return h*3600+m*60+s;
}

bool idorder(car a,car b)
{
	if(strcmp(a.id,b.id)!=0) return strcmp(a.id,b.id)<0;
	else return a.time<b.time;
}

bool timeorder(car a,car b)
{
	return a.time<b.time;
}

int main()
{
	int n,k,h,m,s;
	map<string,int> stay;
	scanf("%d%d",&n,&k);
	for(int i=0;i<n;i++)
	{
		scanf("%s %d:%d:%d %s",all[i].id,&h,&m,&s,all[i].status);
		all[i].time=timechange(h,m,s);	
	}
	sort(all,all+n,idorder);
	int j=0;
	int maxt=-1;
	for(int i=0;i<n;i++)
	{
		if(strcmp(all[i].id,all[i+1].id)==0&&strcmp(all[i].status,"in")==0&&strcmp(all[i+1].status,"out")==0)
		{
			vaild[j++]=all[i];
			vaild[j++]=all[i+1];
			if(stay.count(all[i].id)==0)
			{
				stay[all[i].id]=0;
			}
			stay[all[i].id]+=all[i+1].time-all[i].time;
			maxt=max(maxt,stay[all[i].id]);
		}
	}
	sort(vaild,vaild+j,timeorder);
	int count=0;
	int index=0;//利用题目减少时间
	for(int r=0;r<k;r++)
	{
		//count=0;
		scanf("%d:%d:%d",&h,&m,&s);
		int tt=timechange(h,m,s);
		for(int i=index;tt>=vaild[i].time;i++)
		{
			if(strcmp(vaild[i].status,"in")==0) 
			count++;
			else count--;
			index=i+1;
			if(i==j-1) break;
		}
		printf("%d\n",count);
	}
	map<string,int>::iterator it;
	for(it= stay.begin();it!=stay.end();it++)
	{
		if(it->second == maxt)
		printf("%s ",it->first.c_str());//没见过 
	}
	printf("%02d:%02d:%02d\n",maxt/3600,maxt%3600/60,maxt%60);
	return 0;
}

const char *c_str();
c_str()函数返回一个指向正规C字符串的指针, 内容与本string串相同.
为了与C兼容，在C中没有string类型，故必须通过string类对象的成员函数c_str()把string对象转换成C中的字符串样式。