SDA - 2020-2021 - test5 - task 1

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <queue>
#include <unordered_set>


using namespace std;

unordered_map<int, unordered_set<int>> graph;
vector<bool> result;

bool isRoute(queue<int>& route){
    int curr = route.front();
    route.pop();
    while(!route.empty()){
        if(graph[curr].find(route.front()) == graph[curr].end())
            return false;
        curr = route.front();
        route.pop();
    }
    return true;
}

int main() {
    int m, num, neighb;
    cin >> m;
    for(int i = 0; i < m; i++){
        cin >> neighb;
        for(int j= 0; j < neighb; j++){
            cin >> num;
            graph[i].insert(num);
            graph[num].insert(i);
        }
    }
    int q, c;
    cin >> q;
    for(int i = 0; i < q; i++){
        queue<int> route;
        cin >> c;
        for(int j = 0; j < c; j++){
            cin >> num;
            route.push(num);
        }
        result.push_back(isRoute(route));
    }

    for(int i : result){
        cout << i << " ";
    }
    return 0;
}