This documentation is automatically generated by online-judge-tools/verification-helper
#define PROBLEM "https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_3_C"
#include <iostream>
#include "graph/read_graph.hpp"
#include "graph/strongly_connected_component.hpp"
int main() {
int V, E;
std::cin >> V >> E;
auto g = read_graph<int>(V, E, false, true, 0);
auto res = strongly_connected_component(g);
std::vector<int> id(V);
for (int i = 0; i < (int)(res.size()); i++) {
for (auto&& e : res[i]) id[e] = i;
}
int Q;
std::cin >> Q;
for (int i = 0; i < Q; i++) {
int u, v;
std::cin >> u >> v;
std::cout << (id[u] == id[v]) << '\n';
}
return 0;
}
#line 1 "verify/graph/strongly_connected_component_1.test.cpp"
#define PROBLEM "https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_3_C"
#include <iostream>
#line 2 "graph/read_graph.hpp"
#line 2 "graph/graph_template.hpp"
#include <vector>
#include <cassert>
template <class T> struct Edge {
int from, to;
T cost;
int id;
Edge() = default;
Edge(const int from, const int to, const T cost = T(1), const int id = -1) : from(from), to(to), cost(cost), id(id) {}
friend bool operator<(const Edge<T>& a, const Edge<T>& b) { return a.cost < b.cost; }
friend std::ostream& operator<<(std::ostream& os, const Edge<T>& e) {
// output format: {id: cost(from, to) = cost}
return os << "{" << e.id << ": cost(" << e.from << ", " << e.to << ") = " << e.cost << "}";
}
};
template <class T> using Edges = std::vector<Edge<T>>;
template <class T> struct Graph {
struct EdgeIterators {
public:
using Iterator = typename std::vector<Edge<T>>::iterator;
EdgeIterators() = default;
EdgeIterators(const Iterator& begit, const Iterator& endit) : begit(begit), endit(endit) {}
Iterator begin() const { return begit; }
Iterator end() const { return endit; }
size_t size() const { return std::distance(begit, endit); }
Edge<T>& operator[](int i) const { return begit[i]; }
private:
Iterator begit, endit;
};
int n, m;
bool is_build, is_directed;
std::vector<Edge<T>> edges;
// CSR (Compressed Row Storage) 形式用
std::vector<int> start;
std::vector<Edge<T>> csr_edges;
Graph() = default;
Graph(const int n, const bool directed = false) : n(n), m(0), is_build(false), is_directed(directed), start(n + 1, 0) {}
// 辺を追加し, その辺が何番目に追加されたかを返す
int add_edge(const int from, const int to, const T cost = T(1), int id = -1) {
assert(!is_build);
assert(0 <= from and from < n);
assert(0 <= to and to < n);
if (id == -1) id = m;
edges.emplace_back(from, to, cost, id);
return m++;
}
// CSR 形式でグラフを構築
void build() {
assert(!is_build);
for (auto&& e : edges) {
start[e.from + 1]++;
if (!is_directed) start[e.to + 1]++;
}
for (int v = 0; v < n; v++) start[v + 1] += start[v];
auto counter = start;
csr_edges.resize(start.back() + 1);
for (auto&& e : edges) {
csr_edges[counter[e.from]++] = e;
if (!is_directed) csr_edges[counter[e.to]++] = Edge(e.to, e.from, e.cost, e.id);
}
is_build = true;
}
EdgeIterators operator[](int i) {
if (!is_build) build();
return EdgeIterators(csr_edges.begin() + start[i], csr_edges.begin() + start[i + 1]);
}
size_t size() const { return (size_t)(n); }
friend std::ostream& operator<<(std::ostream& os, Graph<T>& g) {
os << "[";
for (int i = 0; i < (int)(g.size()); i++) {
os << "[";
for (int j = 0; j < (int)(g[i].size()); j++) {
os << g[i][j];
if (j + 1 != (int)(g[i].size())) os << ", ";
}
os << "]";
if (i + 1 != (int)(g.size())) os << ", ";
}
return os << "]";
}
};
#line 4 "graph/read_graph.hpp"
template <class T> Graph<T> read_graph(const int n, const int m, const bool weight = false, const bool directed = false, const int offset = 1) {
Graph<T> g(n, directed);
for (int i = 0; i < m; i++) {
int a, b;
std::cin >> a >> b;
a -= offset, b -= offset;
T c = 1;
if (weight) std::cin >> c;
g.add_edge(a, b, c);
}
g.build();
return g;
}
template <class T> Graph<T> read_parent(const int n, const bool weight = false, const bool directed = false, const int offset = 1) {
Graph<T> g(n, directed);
for (int i = 1; i < n; i++) {
int p;
std::cin >> p;
p -= offset;
T c = 1;
if (weight) std::cin >> c;
g.add_edge(p, i, c);
}
g.build();
return g;
}
#line 2 "graph/strongly_connected_component.hpp"
#line 4 "graph/strongly_connected_component.hpp"
template <class T> std::vector<std::vector<int>> strongly_connected_component(Graph<T>& g) {
const int n = (int)(g.size());
int now_ord = 0, group_num = 0;
std::vector<int> visited, low(n), ord(n, -1), ids(n);
visited.reserve(n);
auto dfs = [&](auto f, int cur) -> void {
low[cur] = ord[cur] = now_ord++;
visited.push_back(cur);
for (auto&& e : g[cur]) {
if (ord[e.to] == -1) {
f(f, e.to);
low[cur] = std::min(low[cur], low[e.to]);
} else {
low[cur] = std::min(low[cur], ord[e.to]);
}
}
if (low[cur] == ord[cur]) {
while (true) {
int u = visited.back();
visited.pop_back();
ord[u] = n;
ids[u] = group_num;
if (u == cur) break;
}
group_num++;
}
};
for (int i = 0; i < n; i++) {
if (ord[i] == -1) dfs(dfs, i);
}
for (auto&& x : ids) {
x = group_num - 1 - x;
}
std::vector<int> counts(group_num);
for (auto&& x : ids) counts[x]++;
std::vector<std::vector<int>> groups(group_num);
for (int i = 0; i < group_num; i++) groups[i].reserve(counts[i]);
for (int i = 0; i < n; i++) groups[ids[i]].push_back(i);
return groups;
}
#line 7 "verify/graph/strongly_connected_component_1.test.cpp"
int main() {
int V, E;
std::cin >> V >> E;
auto g = read_graph<int>(V, E, false, true, 0);
auto res = strongly_connected_component(g);
std::vector<int> id(V);
for (int i = 0; i < (int)(res.size()); i++) {
for (auto&& e : res[i]) id[e] = i;
}
int Q;
std::cin >> Q;
for (int i = 0; i < Q; i++) {
int u, v;
std::cin >> u >> v;
std::cout << (id[u] == id[v]) << '\n';
}
return 0;
}