Submission #65901531

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <array>
#include <ranges>
#include <cmath>
#include <queue>

using namespace std;
using ll=long long;
using ull=unsigned long long;
template<typename T> using vc = vector<T>;
template<typename T> using vv = vc<vc<T>>;
using vl = vc<ll>;
using vvl = vv<ll>;
#define rep(i, s, n) for(ll i = s; i < (n); i++)
#define drep(i, s, n) for(ll i = s; i > n; i--)
#define rrep(i, s, n) for(ll i = s; i <= (n); i++)

ll h, w, n;
vl x, y;
vector<set<ll>> xs, ys;
ll q;

int main() {
    cin >> h >> w >> n;
    x = vl(n);
    y = vl(n);
    xs = vector<set<ll>>(h);
    ys = vector<set<ll>>(w);
    rep(i, 0, n) {
        cin >> x[i] >> y[i];
        x[i]--;
        y[i]--;
        xs[x[i]].insert(y[i]);
        ys[y[i]].insert(x[i]);
    }
    cin >> q;
    while(q--) {
        ll t, c;
        cin >> t >> c;
        c--;
        if(t == 1) {
            // x
            cout << xs[c].size() << endl;
            for(ll i : xs[c]){
                ys[i].erase(c);
            }
            xs[c].clear();
        } else {
            // y
            cout << ys[c].size() << endl;
            for(ll i : ys[c]){
                xs[i].erase(c);
            }
            ys[c].clear();
        }
    }
    return 0;
}

Submission Info

Judge Result