算法笔记-问题 A: Course List for Student (25)

问题 A: Course List for Student (25)

题目描述

Zhejiang University has 40000 students and provides 2500 courses. Now given the student name lists of all the courses, you are supposed to output the registered course list for each student who comes for a query.

输入

Each input file contains one test case. For each case, the first line contains 2 positive integers: N (<=40000), the number of students who look for their course lists, and K (<=2500), the total number of courses. Then the student name lists are given for the courses (numbered from 1 to K) in the following format: for each course i, first the course index i and the number of registered students Ni (<= 200) are given in a line. Then in the next line, Ni student names are given. A student name consists of 3 capital English letters plus a one-digit number. Finally the last line contains the N names of students who come for a query. All the names and numbers in a line are separated by a space.

输出

For each test case, print your results in N lines. Each line corresponds to one student, in the following format: first print the student's name, then the total number of registered courses of that student, and finally the indices of the courses in increasing order. The query results must be printed in the same order as input. All the data in a line must be separated by a space, with no extra space at the end of the line.

样例输入 Copy

11 5
4 7
BOB5 DON2 FRA8 JAY9 KAT3 LOR6 ZOE1
1 4
ANN0 BOB5 JAY9 LOR6
2 7
ANN0 BOB5 FRA8 JAY9 JOE4 KAT3 LOR6
3 1
BOB5
5 9
AMY7 ANN0 BOB5 DON2 FRA8 JAY9 KAT3 LOR6 ZOE1
ZOE1 ANN0 BOB5 JOE4 JAY9 FRA8 DON2 AMY7 KAT3 LOR6 NON9

样例输出 Copy

ZOE1 2 4 5
ANN0 3 1 2 5
BOB5 5 1 2 3 4 5
JOE4 1 2
JAY9 4 1 2 4 5
FRA8 3 2 4 5
DON2 2 4 5
AMY7 1 5
KAT3 3 2 4 5
LOR6 4 1 2 4 5
NON9 0

思路：

思路一：

以课程名为主码建立结构体，为每门课程维护一个学生列表，然后对前来查询的学生依次进行检索。

但是学生姓名冗余出现，占用空间较大。

#include <bits/stdc++.h>

using namespace std;

struct course{
    int cno;
    vector<string> name;
};

bool cmp(course a, course b){
    return a.cno < b.cno;
}

int main() {
    int N, K;
    scanf("%d %d", &N, &K);
    vector<course> cou(K);
    for(int i=0; i<K; i++){
        int m, n;
        scanf("%d %d", &m, &n);
        cou[i].cno = m;
        for(int j=0; j<n; j++){
            string s;
            cin >> s;
            cou[i].name.push_back(s);
        }
    }
    sort(cou.begin(), cou.begin() + K, cmp);
    vector<string> temp;
    for(int i=0; i<N; i++){
        string s;
        cin >> s;
        temp.push_back(s);
    }
    for(int i=0; i<temp.size(); i++){
        int cont = 0;
        vector <int> result;
        printf("%s ", temp[i].c_str());
        for(int j=0; j<K; j++){
            auto index = std::find(cou[j].name.begin(), cou[j].name.end(), temp[i]);
            if(index!=cou[j].name.end()){
                cont++;
                result.push_back(cou[j].cno);
            }
        }
        if(cont == 0)
            printf("%d\n", cont);
        else{
            printf("%d ", cont);
            for(int k=0; k<result.size()-1; k++)
                printf("%d ", result[k]);
            printf("%d\n", result[result.size()-1]);
        }
        result.clear();
    }
    return 0;
}

思路二：

以学生名为主码建立结构体，为每名学生维护一个课程列表，然后对前来查询的学生依次进行检索。

但对每名前来学生都要对结构体进行一次检索耗时较多。

#include <bits/stdc++.h>

using namespace std;

struct student{
    vector<int> cno;
    string name;
};

int main() {
    int N, K;
    scanf("%d %d", &N, &K);
    vector<student> stu;
    for(int i=0; i<K; i++){
        int m, n;
        scanf("%d %d", &m, &n);
        for(int j=0; j<n; j++){
            string s;
            cin >> s;
            int k;
            for(k=0; k<stu.size(); k++){
                if(s==stu[k].name){
                    stu[k].cno.push_back(m);
                    break;
                }
            }
            if(k==stu.size()){
                student temp;
                temp.name = s;
                temp.cno.push_back(m);
                stu.push_back(temp);
            }
        }
    }
    vector<string> temp;
    for(int i=0; i<N; i++){
        string s;
        cin >> s;
        temp.push_back(s);
    }
    for(int i=0; i<temp.size(); i++){
        int j;
        for(j=0; j<stu.size(); j++){
            if(temp[i] == stu[j].name){
                printf("%s ", temp[i].c_str());
                sort(stu[j].cno.begin(), stu[j].cno.end());
                printf("%d ", stu[j].cno.size());
                for(int k=0; k<stu[j].cno.size()-1; k++)
                    printf("%d ", stu[j].cno[k]);
                printf("%d\n", stu[j].cno[stu[j].cno.size()-1]);
                break;
            }
        }
        if(j==stu.size()){
            printf("%s ", temp[i].c_str());
            printf("%d\n", 0);
        }
    }
    return 0;
}

正确思路：

时间超限则考虑采用hash加快查找！！！

首先我们利用散列那一章的字符串hash，将名字这个字符串转化成唯一的整数，利用这个整数，找到hash表对应的位置。

由于是三个字符加一个字母。所以一共有26*26*26*10种名字的组合。

#include <bits/stdc++.h>

using namespace std;

const int M = 26*26*26*10 + 1;
vector<int> selectCourse[M];

int getID(char name[]){
  int id = 0;
  for(int i = 0; i < 3; i++){
    id = id * 26 + (name[i] - 'A');
  }
  id = id * 10 + (name[3] - '0');
  return id;
}

int main(){
  char name[5];
  int n, k;
  scanf("%d %d", &n, &k);
  for(int i = 0; i < k; i++){
    int course, x;
    scanf("%d %d", &course, &x);
    for(int j = 0; j < x; j++){
      scanf("%s", name);
      int id = getID(name);
      selectCourse[id].push_back(course);
    }
  }
  for(int i = 0; i < n; i++){
    scanf("%s", name);
    int id = getID(name);
    sort(selectCourse[id].begin(),selectCourse[id].end());
    printf("%s %d", name, selectCourse[id].size());
    for(int j = 0; j < selectCourse[id].size(); j++){
      printf(" %d", selectCourse[id][j]);
    }
    printf("\n");
  }
  return 0;
}