This documentation is automatically generated by online-judge-tools/verification-helper
View the Project on GitHub plasmatic1/templates
#define PROBLEM "https://judge.yosupo.jp/problem/scc" #include "../../template.hpp" #include "../test_utils.hpp" #include "../../graph/scc.hpp" #include "../../graph/edge_types.hpp" const int MN = 5e5 + 1; int N, M; vector<int> g[MN]; int main() { fast_io(); cin >> N >> M; for (int i = 0; i < M; i++) { int a, b; cin >> a >> b; a++; b++; g[a].pb(b); } SCC<vector<int>[MN], Edge> scc; auto ans = scc.solve(N, g); reverse(all(ans)); print(ans.size()); for (auto c : ans) { cout << c.size(); for (auto x : c) cout << ' ' << x-1; cout << '\n'; } }
#line 1 "tests/graph/scc.test.cpp" #define PROBLEM "https://judge.yosupo.jp/problem/scc" #line 2 "template.hpp" #include <bits/stdc++.h> #define DEBUG 1 using namespace std; // Defines #define fs first #define sn second #define pb push_back #define eb emplace_back #define mpr make_pair #define mtp make_tuple #define all(x) (x).begin(), (x).end() // Basic type definitions #if __cplusplus == 201703L // CPP17 only things template <typename T> using opt_ref = optional<reference_wrapper<T>>; // for some templates #endif using ll = long long; using ull = unsigned long long; using ld = long double; using pii = pair<int, int>; using pll = pair<long long, long long>; #ifdef __GNUG__ // PBDS order statistic tree #include <ext/pb_ds/assoc_container.hpp> // Common file #include <ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; template <typename T, class comp = less<T>> using os_tree = tree<T, null_type, comp, rb_tree_tag, tree_order_statistics_node_update>; template <typename K, typename V, class comp = less<K>> using treemap = tree<K, V, comp, rb_tree_tag, tree_order_statistics_node_update>; // HashSet #include <ext/pb_ds/assoc_container.hpp> template <typename T, class Hash> using hashset = gp_hash_table<T, null_type, Hash>; template <typename K, typename V, class Hash> using hashmap = gp_hash_table<K, V, Hash>; const ll RANDOM = chrono::high_resolution_clock::now().time_since_epoch().count(); struct chash { ll operator()(ll x) const { return x ^ RANDOM; } }; #endif // More utilities int SZ(string &v) { return v.length(); } template <typename C> int SZ(C &v) { return v.size(); } template <typename C> void UNIQUE(vector<C> &v) { sort(v.begin(), v.end()); v.resize(unique(v.begin(), v.end()) - v.begin()); } template <typename T, typename U> void maxa(T &a, U b) { a = max(a, b); } template <typename T, typename U> void mina(T &a, U b) { a = min(a, b); } const ll INF = 0x3f3f3f3f, LLINF = 0x3f3f3f3f3f3f3f3f; #line 3 "tests/test_utils.hpp" // I/O template <typename T> void print(T v) { cout << v << '\n'; } template <typename T, typename... Rest> void print(T v, Rest... vs) { cout << v << ' '; print(vs...); } void fast_io() { ios_base::sync_with_stdio(false); cin.tie(NULL); } // Reading operators template <typename T, typename U> istream& operator>>(istream& in, pair<T, U> &o) { return in >> o.first >> o.second; } // Read helpers int readi() { int x; cin >> x; return x; } ll readl() { ll x; cin >> x; return x; } template <typename T> vector<T> readv(int n) { vector<T> res(n); for (auto &x : res) cin >> x; return res; } // Functional stuff template <typename T> vector<pair<int, T>> enumerate(vector<T> v, int start = 0) { vector<pair<int, T>> res; for (auto &x : v) res.emplace_back(start++, x); return res; } #line 3 "graph/scc.hpp" template <typename GraphType, typename EdgeType> struct SCC { EdgeType E; int cord = 0; vector<int> ord, low, stk; vector<bool> instk; vector<vector<int>> solve(int N, GraphType &g) { ord.assign(N+1, 0); low.assign(N+1, 0); instk.assign(N+1, false); stk.clear(); cord = 0; vector<vector<int>> cs; function<void(int)> tarjan = [&] (int c) { ord[c] = low[c] = ++cord; instk[c] = true; stk.push_back(c); for (auto _to : g[c]) { int to = E.v(_to); if (!ord[to]) { tarjan(to); low[c] = min(low[c], low[to]); } else if (instk[to]) low[c] = min(low[c], ord[to]); } if (low[c] == ord[c]) { int u; cs.push_back(vector<int>()); do { u = stk.back(); instk[u] = false; stk.pop_back(); cs.back().push_back(u); } while (u != c); } }; for (int i = 1; i <= N; i++) if (!ord[i]) tarjan(i); return cs; } #if __cplusplus == 201703L // CPP17 only things void bind(opt_ref<vector<int>> ord0, opt_ref<vector<int>> low0) { if (ord0) ord.swap(*ord0); if (low0) low.swap(*low0); } #endif }; #line 3 "graph/edge_types.hpp" struct Edge { using EdgeType = int; int v(EdgeType e) { return e; } int w(EdgeType e) { return 1; } int i(EdgeType e) { throw domain_error("no information on edge indices"); } EdgeType swapNode(EdgeType e, int v) { return v; } }; template <typename T> struct WeightedEdge { using EdgeType = pair<int, T>; using WeightType = T; int v(EdgeType e) { return e.first; } T w(EdgeType e) { return e.second; } int i(EdgeType e) { throw domain_error("no information on edge indices"); } EdgeType swapNode(EdgeType e, int v) { return {v, w(e)}; } }; struct IndexedEdge { using EdgeType = pair<int, int>; int v(EdgeType e) { return e.first; } int w(EdgeType e) { return 1; } int i(EdgeType e) { return e.second; } EdgeType swapNode(EdgeType e, int v) { return {v, i(e)}; } }; template <typename T> struct WeightedIndexedEdge { using EdgeType = tuple<int, T, int>; using WeightType = T; int v(EdgeType e) { return get<0>(e); } T w(EdgeType e) { return get<1>(e); } int i(EdgeType e) { return get<2>(e); } EdgeType swapNode(EdgeType e, int v) { return {v, w(e), i(e)}; } }; #line 6 "tests/graph/scc.test.cpp" const int MN = 5e5 + 1; int N, M; vector<int> g[MN]; int main() { fast_io(); cin >> N >> M; for (int i = 0; i < M; i++) { int a, b; cin >> a >> b; a++; b++; g[a].pb(b); } SCC<vector<int>[MN], Edge> scc; auto ans = scc.solve(N, g); reverse(all(ans)); print(ans.size()); for (auto c : ans) { cout << c.size(); for (auto x : c) cout << ' ' << x-1; cout << '\n'; } }