#include<bits/stdc++.h>
using namespace std;
const int N = 2e5 + 6;
int n, op, k, b, cnt, r, flag = -1e9;
map<pair<int, int>, int> mp;
unordered_map<int, int> t;
set<int> st[N];
set<pair<int, int>> rt[N];
signed main() {
	cin >> n;
	for (int i = 1; i <= n; ++i) {
		cin >> op >> k >> b;
		if (k != flag && !st[r].count(k))st[r].insert(k), t[k] = 0;
		if (k != flag && !rt[r].count({k, b}))rt[r].insert({k, b}), mp[ {k, b}] = 0;
		if (op == 1)cnt++, mp[ {k, b}]++, t[k]++;
		if (op == 2) cout << cnt - t[k] << '\n';
		if (op == 3) cnt = t[k] - mp[ {k, b}], t[k] -= mp[ {k, b}], mp[ {k, b}] = 0, flag = k, r++;
	}
}

请求dalao hack

只有#2 Wa