p0HyXf - Online C++0x Compiler & Debugging Tool

/*
* @Author: hungeazy
* @Date:   2025-11-12 22:24:27
* @Last Modified by:   hungeazy
* @Last Modified time: 2025-11-12 23:04:25
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
using namespace std;
using namespace __gnu_pbds;
bool M1;
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define int long long
#define ll long long
#define ull unsigned long long
#define sz(x) x.size()
#define sqr(x) (1LL * (x) * (x))
#define all(x) x.begin(), x.end()
#define fill(f,x) memset(f,x,sizeof(f))
#define FOR(i,l,r) for(int i=l;i<=r;i++)
#define FOD(i,r,l) for(int i=r;i>=l;i--)
#define debug(x) cout << #x << " = " << x << '\n'
#define ii pair<int,int>
#define iii pair<int,ii>
#define di pair<ii,ii>
#define vi vector<int>
#define vii vector<ii>
#define mii map<int,int>
#define fi first
#define se second
#define pb push_back
#define MOD 1000000007
#define __lcm(a,b) (1ll * ((a) / __gcd((a), (b))) * (b))
#define YES cout << "YES\n"
#define NO cout << "NO\n"
#define MASK(i) (1LL << (i))
#define c_bit(i) __builtin_popcountll(i)
#define BIT(x,i) ((x) & MASK(i))
#define SET_ON(x,i) ((x) | MASK(i))
#define SET_OFF(x,i) ((x) & ~MASK(i))
#define oo 1e18
#define name "FRIENDS"
#define endl '\n'
#define memory() cerr << abs(&M2-&M1)/1024.0/1024 << " MB" << endl
#define time() cerr << endl << "-------------Time:" << 1000.0 * clock() / CLOCKS_PER_SEC << "ms." << endl
template<typename T> bool maximize(T &res, const T &val) { if (res < val){ res = val; return true; }; return false; }
template<typename T> bool minimize(T &res, const T &val) { if (res > val){ res = val; return true; }; return false; }
template <class T> using ordered_set = tree <T, null_type, less_equal <T>, rb_tree_tag,tree_order_statistics_node_update>;
const int N = (int)2e5+10;
int n,m,deg[N],q;
ii edge[N];

struct Query {
	int type,u,v;
} query[N];
// Olympic 30/4 - Khối 11 - 2021
namespace hungeazy {

	const int M = (int)1e3+10;
	int id[N],ans[M][M];
	bitset<N> b[M];
	bool check[N],f[N];
	vi heavy,g[N];
	map<ii,bool> have;

	void add(int u, int v)
	{
		if (!have[{u,v}])
		{
			if (check[u] and check[v])
			{
				ans[id[u]][id[v]] = ans[id[v]][id[u]] = true;
				b[id[u]][v] = b[id[v]][u] = true;
				for (int x : heavy)
				{
					if (b[id[u]][x])
						ans[id[v]][id[x]] = ans[id[x]][id[v]] = true;
					if (b[id[v]][x])
						ans[id[u]][id[x]] = ans[id[x]][id[u]] = true;
				}
			}
			else if (check[u])
			{
				b[id[u]][v] = true;
				for (int x : g[v])
					if (check[x])
						ans[id[u]][id[x]] = ans[id[x]][id[u]] = true;
			}
			else if (check[v])
			{
				b[id[v]][u] = true;
				for (int x : g[u])
					if (check[x])
						ans[id[v]][id[x]] = ans[id[x]][id[v]] = true;
			}
			g[u].pb(v); g[v].pb(u);
			have[{u,v}] = have[{v,u}] = true;
		}
	}

	void solve(void)
	{
		int S = sqrt(2*(m+q)), cnt = 0;
		FOR(i,1,n)
			if (deg[i] > S)
			{
				heavy.pb(i);
				check[i] = true;
				id[i] = ++cnt;
			}
		FOR(i,1,m)
		{
			auto [u,v] = edge[i];
			add(u,v);
		}
		FOR(i,1,q)
		{
			int u = query[i].u, v = query[i].v;
			if (query[i].type == 1)
				add(u,v);
			else
			{
				bool ok = false;
				if (!check[u] and !check[v])
				{
					for (int x : g[u])
					{
						f[x] = true;
						if (x == v)
						{
							ok = true;
							break;
						}
					}
					for (int x : g[v])
						if (f[x])
						{
							ok = true;
							break;
						}
					for (int x : g[u]) f[x] = false;
				}
				else if (!check[u])
				{
					for (int x : g[u])
					{
						f[x] = true;
						if (x == v or b[id[v]][x])
						{
							ok = true;
							break;
						}
					}
					for (int x : g[u]) f[x] = false;
				}
				else if (!check[v])
				{
					for (int x : g[v])
					{
						f[x] = true;
						if (x == u or b[id[u]][x])
						{
							ok = true;
							break;
						}
					}
					for (int x : g[v]) f[x] = false;
				}
				else ok = ans[id[u]][id[v]];
				cout << (ok ? "YES" : "NO") << endl;
			}
		}
	}

}

bool M2;
signed main()
{
    fast;
    if (fopen(name".inp","r"))
    {
    	freopen(name".inp","r",stdin);
    	freopen(name".out","w",stdout);
    }
    cin >> n >> m;
    FOR(i,1,m)
    {
    	int u,v;
    	cin >> u >> v;
    	edge[i] = {u,v};
    	deg[u]++; deg[v]++;
    }
    cin >> q;
    FOR(i,1,q)
    {
    	cin >> query[i].type >> query[i].u >> query[i].v;
    	if (query[i].type == 2)
    	{
    		deg[query[i].u]++;
    		deg[query[i].v]++;
    	}
    }
    hungeazy::solve();
    time();
    memory();
    return 0;
}
// ██░ ██  █    ██  ███▄    █   ▄████
//▓██░ ██▒ ██  ▓██▒ ██ ▀█   █  ██▒ ▀█▒
//▒██▀▀██░▓██  ▒██░▓██  ▀█ ██▒▒██░▄▄▄░
//░▓█ ░██ ▓▓█  ░██░▓██▒  ▐▌██▒░▓█  ██▓
//░▓█▒░██▓▒▒█████▓ ▒██░   ▓██░░▒▓███▀▒
// ▒ ░░▒░▒░▒▓▒ ▒ ▒ ░ ▒░   ▒ ▒  ░▒   ▒
// ▒ ░▒░ ░░░▒░ ░ ░ ░ ░░   ░ ▒░  ░   ░
// ░  ░░ ░ ░░░ ░ ░    ░   ░ ░ ░ ░   ░
// ░  ░  ░   ░              ░       ░