Submission #65881748

---

Source Code Expand

#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES

#include <algorithm>
#include <cstdio>
#include <ctime>
#include <map>
#include <string>
#include <cstring>
#include <vector>
#include <set>
#include <stack>
#include <list>
#include <queue>
#include <deque>
#include <cassert>
#include <iostream>
#include <cmath>
#include <sstream>
#include <complex>
#include <limits>
#include <functional>
#include <memory.h>
#include <inttypes.h>

using namespace std;

typedef long long int64;
typedef unsigned long long uint64;

#define y1 _dsfkjdsfksdj
#define y0 _sfsdkfdop

typedef unsigned int uint;
typedef unsigned char uchar;
typedef vector<int64> vi64;
typedef vector<vi64> vvi64;
typedef vector<vvi64> vvvi64;
typedef vector<double> vd;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<string> vs;
typedef pair<int,int> pii;
typedef pair<int,string> pis;
typedef pair<string,string> pss;
typedef pair<int,pii> piii;
typedef pair<pii,pii> piiii;
typedef pair<int64,int64> pii64;
typedef pair<pii64,int64> piii64;
typedef vector<pii64> vpii64;
typedef pair<int64,int> qelem;
typedef vector<pii> vpii;
typedef vector<vpii> vvpii;
typedef pair<double,int> pdi;
typedef pair<double,pii> pdii;
typedef pair<double,double> pdd;
typedef pair<double,pdd> pddd;
typedef pair<pdd,int> pddi;

int n, m, k, q;
vector<set<int>> r;
vector<set<int>> c;

int main() {
#ifdef _PKHAU_DEBUG
    freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
#endif
    ios_base::sync_with_stdio(false); cin.tie(0);

    cin >> n >> m >> k;
    int x, y;
    r.resize(n);
    c.resize(m);
    for (int i = 0; i < k; ++i) {
        cin >> x >> y;
        --x, --y;
        r[x].insert(y);
        c[y].insert(x);
    }

    cin >> q;
    for (;q--;) {
        cin >> y >> x;
        --x;
        if (y == 1) {
            cout << r[x].size() << endl;
            for (auto sit = r[x].begin(); sit != r[x].end(); sit++) {
                c[*sit].erase(x);
            }
            r[x].clear();
        } else {
            cout << c[x].size() << endl;
            for (auto sit = c[x].begin(); sit != c[x].end(); sit++) {
                r[*sit].erase(x);
            }
            c[x].clear();
        }
    }

    return 0;
}

Submission Info

Judge Result