Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #pragma GCC optimize("Ofast")
- #pragma GCC target("avx2")
- #define _CRT_SECURE_NO_WARNINGS
- #include <iostream>
- #include <vector>
- #include <string>
- #include <algorithm>
- #include <cmath>
- #include <stack>
- #include <iomanip>
- #include <fstream>
- #include <string>
- #include <set>
- #include <deque>
- #include <queue>
- #include <map>
- #include <bitset>
- #include <random>
- using namespace std;
- typedef long long ll;
- typedef unsigned long long ull;
- typedef long double ld;
- typedef string str;
- //typedef __int128 ultraint;
- #define endl "\n"
- #define sqrt sqrtl
- const ll inf = (ll)1e18 + 7;
- ld eps = 1e-12;
- vector <int> p(1000005);
- int mas[3][1000005];
- int res[1000005];
- int ask(int n)
- {
- if (n == p[n])
- {
- return n;
- }
- return p[n] = ask(p[n]);
- }
- void cut(int x, int y)
- {
- int x1 = ask(x);
- int y1 = ask(y);
- p[x1] = y1;
- return;
- }
- signed main()
- {
- ios_base::sync_with_stdio(false);
- cin.tie(0);
- cout.tie(0);
- int n, m, q;
- cin >> n >> m >> q;
- vector <vector<int>> gr(100000);
- for (int i = 0; i < m; i++)
- {
- int a, b;
- cin >> a >> b;
- gr[a].pb(b);
- gr[b].pb(a);
- }
- for (int i = 0; i < q; i++)
- {
- string s;
- cin >> s;
- int a, b;
- cin >> mas[1][i] >> mas[2][i];
- if (s == "ask")
- {
- mas[0][i] = 1;
- }
- else
- {
- mas[0][i] = 0;
- }
- }
- for (int i = 1; i <= n; i++)
- {
- p[i] = i;
- }
- for (int i = q - 1; i >= 0; i--)
- {
- if (mas[0][i] == 1)
- {
- int lol = ask(mas[1][i]);
- int kek = ask(mas[2][i]);
- res[i] = (lol == kek);
- }
- else
- {
- cut(mas[1][i], mas[2][i]);
- }
- }
- for (int i = 0; i < q; i++)
- {
- if (mas[0][i] == 1)
- {
- if (res[i] == 1)
- {
- cout << "YES" << endl;
- }
- else
- {
- cout << "NO" << endl;
- }
- }
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement