Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <vector>
- #include <iostream>
- #include <fstream>
- std::vector <std::vector<int>> g, gr;
- std::vector<char> used;
- std::vector<int> order, component;
- void dfs1 (int v) {
- used[v] = true;
- for (size_t i=0; i<g[v].size(); ++i)
- if (!used[ g[v][i] ])
- dfs1 (g[v][i]);
- order.push_back (v);
- }
- void dfs2 (int v) {
- used[v] = true;
- component.push_back (v);
- for (size_t i=0; i<gr[v].size(); ++i)
- if (!used[ gr[v][i] ])
- dfs2 (gr[v][i]);
- }
- int main() {
- for (int ii = 1; ii < 2; ii++) {
- // std::ifstream cin(std::to_string(ii).c_str());
- int n, m, q;
- std::cin >> n >> m >> q;
- g.resize(n);
- gr.resize(n);
- for (int i = 0; i < m; i++) {
- int a, b;
- std::cin >> a >> b;
- a--;
- b--;
- g[a].push_back(b);
- gr[b].push_back(a);
- }
- used.assign(n, false);
- for (int i = 0; i < n; ++i) {
- if (!used[i]) {
- dfs1(i);
- }
- }
- used.assign(n, false);
- std::vector<std::vector<int>> components;
- for (int i = 0; i < n; ++i) {
- int v = order[n - 1 - i];
- if (!used[v]) {
- dfs2(v);
- components.emplace_back(component);
- component.clear();
- }
- }
- std::vector<int> ver(n, 0);
- for (int i = 0; i < components.size(); i++) {
- for (auto j: components[i]) {
- ver[j] = i;
- }
- }
- std::vector<bool> answer(q);
- for (int j = 0; j < q; j++) {
- int a, b;
- std::cin >> a >> b;
- a--;
- b--;
- answer[j] = (ver[a] == ver[b]);
- }
- // std::ofstream cout((std::to_string(ii) + ".a").c_str());
- for (auto j: answer) {
- if (j) {
- std::cout << "YES\n";
- } else {
- std::cout << "NO\n";
- }
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement