仅供参考

#include <iostream>
#include <unordered_map>
#include <unordered_set>
using namespace std;
int main() {
int t;
cin >> t;
for (int i = 0; i < t; ++i) {
int N, Q;
cin >> N >> Q;
unordered_map<int, unordered_set<int>> followers;
for (int j = 0; j < Q; ++j) {
int C, A, B;
cin >> C >> A >> B;

        if (C == 1) {
            followers[A].insert(B);
        } else if (C == 2) { 
            followers[A].erase(B);
        } else {
            if (followers[A].count(B) && followers[B].count(A)) {
                cout << "Yes" << endl;
            } else {
                cout << "No" << endl;
            }
        }
    }
}

return 0;

}