Anime Shops

#include <iostream>
#include <vector>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <string>
#include <sstream>

using namespace std;

vector<string> split(const string &s) {
    vector<string> result;
    istringstream iss(s);
    for (string token; iss >> token;)
        result.push_back(move(token));
    return result;
}

int bfs(const string& node, const unordered_set<string>& animeArr, const unordered_map<string, vector<string>>& graph) {
    unordered_set<string> visited;
    queue<pair<string, vector<string>>> queue;
    queue.push({node, {node}});
    visited.insert(node);

    while (!queue.empty()) {
        auto s = queue.front();
        queue.pop();

        for (const auto& neighbor : graph.at(s.first)) {
            if (visited.find(neighbor) == visited.end()) {
                if (animeArr.find(neighbor) != animeArr.end()) {
                    return s.second.size();
                }

                auto path = s.second;
                path.push_back(neighbor);
                queue.push({neighbor, path});
                visited.insert(neighbor);
            }
        }
    }

    return -1;
}

int main() {
    int n, m, k;
    cin >> n >> m >> k;
    cin.ignore(); 

    unordered_set<string> animeArr;
    string inputLine;

    getline(cin, inputLine);
    auto input2 = split(inputLine);
    for (int i = 0; i < k; ++i) {
        animeArr.insert(input2[i]);
    }

    unordered_map<string, vector<string>> graph;
    for (int i = 0; i < m; ++i) {
        getline(cin, inputLine);
        auto inputTemp = split(inputLine);
        string a = inputTemp[0];
        string b = inputTemp[1];

        graph[a].push_back(b);
        graph[b].push_back(a);
    }

    for (int i = 1; i <= n; ++i) {
        string node = to_string(i);
        if (graph.find(node) == graph.end()) {
            cout << -1 << " ";
            continue;
        }
        cout << bfs(node, animeArr, graph) << " ";
    }
    cout << endl;

    return 0;
}

Test 1

Group: 1, 3

Verdict: ACCEPTED

Test 2

Group: 1, 3

Verdict: ACCEPTED

Test 3

Group: 1, 3

Verdict: ACCEPTED

Test 4

Group: 1, 3

Verdict: ACCEPTED

Test 5

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 6

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 7

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 3

Verdict: ACCEPTED

Test 9

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 11

Group: 2, 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 3

Verdict: ACCEPTED

Test 16

Group: 3

Verdict: TIME LIMIT EXCEEDED