Submission #65247316

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << '\n'
#define debug2(x, y) debug(x), debug(y)
#define repn(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(i, a) for(int i = 0; i < (int)(a); i++)
#define all(v) v.begin(), v.end()
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define sq(x) ((x) * (x))
#define sz(x) (int)(x.size())
#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin())
const int mxN = 2e5 + 5;

set<int> vis[mxN];
int uwu[mxN];

void solve(){
	int n, m, q;
	cin >> n >> m >> q;
	rep(i, q){
		int t;
		cin >> t;
		if(t == 1){
			int x, y;
			cin >> x >> y;
			if(!uwu[x]) vis[x].insert(y);
		}
		else if(t == 2){
			int x;
			cin >> x;
			uwu[x] = 1;
		}
		else if(t == 3){
			int x, y;
			cin >> x >> y;
			if(uwu[x] || vis[x].find(y) != vis[x].end()){
				cout << "Yes\n";
			}
			else cout << "No\n";
		}
	}
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	int t = 1;
	//cin >> t;
	while(t--) solve();
	return 0;
}

Submission Info

Judge Result