leetcode-master/problems/kamacoder/获取连通的相邻节点列表.md

#include <iostream>
#include <vector>
#include <algorithm>
#include <unordered_set>
using namespace std;
int main() {
    unordered_set<int> uset;
    int n, a;
    cin >> n;
    while (n--) {
        cin >> a;
        uset.insert(a);
    }
    int m, x, vlan_id;
    long long tb;
    vector<long long> vecTB;
    cin >> m;
    while(m--) {
        cin >> tb;
        cin >> x;
        vector<long long> vecVlan_id(x);
        for (int i = 0; i < x; i++) {
            cin >> vecVlan_id[i];
        }
        for (int i = 0; i < x; i++) {
            if (uset.find(vecVlan_id[i]) != uset.end()) {
                vecTB.push_back(tb);
                break;
            }
        }

    }

    cout << vecTB.size() << endl;
    if (vecTB.size() != 0) {
        sort(vecTB.begin(), vecTB.end());
        for (int i = 0; i < vecTB.size() ; i++) cout << vecTB[i] << " ";
    }


}