1039. Course List for Student (25)

使用map<string,...>写代码最后一个测试点超时。因为在查找姓名过程中使用时间过多

解决方法：将姓名映射到int型

#define  _CRT_SECURE_NO_WARNINGS 
#include<string>
#include<string.h>
#include<vector>
#include<map>
#include<stack>
#include<iostream> 
#include<algorithm>
#include<stdio.h> 
using namespace std;
vector<int> vName[180000];
struct Course
{
int NO;
vector<int> stu;
};
bool cmp(Course a, Course b)
{
return a.NO < b.NO;
}
int main()
{  

int N, K;
scanf("%d %d",&N,&K);
Course *cou = new Course[K];
for (int i = 0; i < K; i++)
{
int NO, coun;
scanf("%d %d", &NO, &coun);
cou[i].NO = NO;
for (int j = 0; j < coun; j++)
{
char name[5];
scanf("%s",name);
int tmp = (name[0] - 'A')*6760+(name[1] - 'A')*260+(name[2] - 'A')*10+(name[3] - '0');
cou[i].stu.push_back(tmp);
}
}
sort(cou, cou + K, cmp);
for (int i = 0; i < K; i++)
{ 
int size = cou[i].stu.size();
for (int j = 0; j <size ; j++)
{ 
vName[cou[i].stu[j]].push_back(cou[i].NO);
}
}
for (int i = 0; i < N; i++)
{
char name[5];
scanf("%s", name); 
int tmp = (name[0] - 'A') * 6760 + (name[1] - 'A') * 260 + (name[2] - 'A') * 10 + (name[3] - '0');
int is=vName[tmp].size();
printf("%s %d", name, is);
for (int j = 0; j < is; j++)
{
printf(" %d", vName[tmp][j]);
}
cout << endl;
}
return 0;
}