Доп. из 13. Пробуждение.

#include <iostream>
#include <unordered_map>
#include <unordered_set>
#include <string>
#include <sstream>
#include <list>
#include <algorithm>

std::unordered_set<int> objSet[1000];
std::unordered_map<std::string, int> dict;
std::vector<std::string> inv;
int nWords = 0;
int nObjSets = 0;

int main()
{
    std::unordered_map<std::string, std::unordered_set<int>*> strToObj;
    std::ios::sync_with_stdio(false);

    std::string input;
    std::getline(std::cin, input);
    int N = std::stoi(input);
    while (N--)
    {
        std::getline(std::cin, input);
        std::stringstream ss(input);
        std::string str;
        ss >> str;
        str.pop_back();
        if (strToObj.find(str) == strToObj.end())
            strToObj.insert({ str, objSet + nObjSets++ });
        while (ss >> str)
        {
            auto it = dict.insert({ str, nWords }).first;
            inv.push_back(str);
            nWords++;
            objSet[nObjSets - 1].insert(it->second);
        }
    }

    std::getline(std::cin, input);
    int M = std::stoi(input);
    while (M--)
    {
        std::getline(std::cin, input);
        std::stringstream ss(input);
        std::string str;
        ss >> str;
        std::list<int> list(strToObj[str]->begin(), strToObj[str]->end());
        while (ss >> str)
        {
            auto set = strToObj[str];
            for (auto it = list.begin(); it != list.end();)
            if (set->find(*it) == set->end())
                it = list.erase(it);
            else
                it++;
        }
        std::vector<std::string> ans;
        for (auto it = list.begin(); it != list.end(); it++)
            ans.push_back(inv[*it]);
        std::sort(ans.begin(), ans.end());
        if (ans.size())
        for (auto it = ans.begin(); it < ans.end(); it++)
            std::cout << *it << " ";
        else
            std::cout << "No solution.";
        std::cout << std::endl;
    }
}