Submission #65922170

---

Source Code Expand

#include <algorithm>
#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <unordered_map>
#include <unordered_set>
using namespace std;

const int MAXN = 2e5 + 5;
typedef unordered_set<int> uset;
// typedef unordered_map<int, uset> umap;
uset L[MAXN], C[MAXN];

int main() {
    cin.tie(0) -> sync_with_stdio(0);
    int h, w, n, q, x, y, op;
    cin >> h >> w >> n;
    for (int i = 1; i <= n; i ++) {
        cin >> x >> y;
        L[x].insert(y);
        C[y].insert(x);
    }
    cin >> q;
    while (q --) {
        cin >> op;
        switch (op) {
            case 1:
                cin >> x;
                cout << L[x].size() << '\n';
                for (auto y : L[x]) {
                    C[y].erase(x);
                }
                L[x].clear();
                break;
                
            case 2:
                cin >> y;
                cout << C[y].size() << '\n';
                for (auto x : C[y]) {
                    L[x].erase(y);
                }
                C[y].clear();
                break;
                
            default:
                break;
        }
    }
    return 0;
}

Submission Info

Judge Result