This documentation is automatically generated by competitive-verifier/competitive-verifier
// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/scc
#include "../../template/template.hpp"
#include "../../graph/connected-components/strongly-connected-components.hpp"
int main() {
int N, M;
cin >> N >> M;
StronglyConnectedComponents<> g(N);
g.read(M, 0, false, true);
g.build();
cout << g.group.size() << "\n";
for(auto &p : g.group) {
cout << p.size() << " " << p << "\n";
}
}
#line 1 "test/verify/yosupo-scc.test.cpp"
// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/scc
#line 1 "template/template.hpp"
#include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
#endif
using namespace std;
using int64 = long long;
const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
}
} iosetup;
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
os << p.first << " " << p.second;
return os;
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
for (int i = 0; i < (int)v.size(); i++) {
os << v[i] << (i + 1 != v.size() ? " " : "");
}
return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
for (T &in : v) is >> in;
return is;
}
template <typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
template <typename T = int64>
vector<T> make_v(size_t a) {
return vector<T>(a);
}
template <typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t) fill_v(e, v);
}
template <typename F>
struct FixPoint : F {
explicit FixPoint(F &&f) : F(std::forward<F>(f)) {}
template <typename... Args>
decltype(auto) operator()(Args &&...args) const {
return F::operator()(*this, std::forward<Args>(args)...);
}
};
template <typename F>
inline decltype(auto) MFP(F &&f) {
return FixPoint<F>{std::forward<F>(f)};
}
#line 4 "test/verify/yosupo-scc.test.cpp"
#line 2 "graph/connected-components/strongly-connected-components.hpp"
#line 2 "graph/graph-template.hpp"
template <typename T = int>
struct Edge {
int from, to;
T cost;
int idx;
Edge() = default;
Edge(int from, int to, T cost = 1, int idx = -1)
: from(from), to(to), cost(cost), idx(idx) {}
operator int() const { return to; }
};
template <typename T = int>
struct Graph {
vector<vector<Edge<T> > > g;
int es;
Graph() = default;
explicit Graph(int n) : g(n), es(0) {}
size_t size() const { return g.size(); }
void add_directed_edge(int from, int to, T cost = 1) {
g[from].emplace_back(from, to, cost, es++);
}
void add_edge(int from, int to, T cost = 1) {
g[from].emplace_back(from, to, cost, es);
g[to].emplace_back(to, from, cost, es++);
}
void read(int M, int padding = -1, bool weighted = false,
bool directed = false) {
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
a += padding;
b += padding;
T c = T(1);
if (weighted) cin >> c;
if (directed)
add_directed_edge(a, b, c);
else
add_edge(a, b, c);
}
}
inline vector<Edge<T> > &operator[](const int &k) { return g[k]; }
inline const vector<Edge<T> > &operator[](const int &k) const { return g[k]; }
};
template <typename T = int>
using Edges = vector<Edge<T> >;
#line 4 "graph/connected-components/strongly-connected-components.hpp"
template <typename T = int>
struct StronglyConnectedComponents : Graph<T> {
public:
using Graph<T>::Graph;
using Graph<T>::g;
vector<int> comp;
Graph<T> dag;
vector<vector<int> > group;
void build() {
rg = Graph<T>(g.size());
for (size_t i = 0; i < g.size(); i++) {
for (auto &e : g[i]) {
rg.add_directed_edge(e.to, e.from, e.cost);
}
}
comp.assign(g.size(), -1);
used.assign(g.size(), 0);
for (size_t i = 0; i < g.size(); i++) dfs(i);
reverse(begin(order), end(order));
int ptr = 0;
for (int i : order)
if (comp[i] == -1) rdfs(i, ptr), ptr++;
dag = Graph<T>(ptr);
for (size_t i = 0; i < g.size(); i++) {
for (auto &e : g[i]) {
int x = comp[e.from], y = comp[e.to];
if (x == y) continue;
dag.add_directed_edge(x, y, e.cost);
}
}
group.resize(ptr);
for (size_t i = 0; i < g.size(); i++) {
group[comp[i]].emplace_back(i);
}
}
int operator[](int k) const { return comp[k]; }
private:
vector<int> order, used;
Graph<T> rg;
void dfs(int idx) {
if (exchange(used[idx], true)) return;
for (auto &to : g[idx]) dfs(to);
order.push_back(idx);
}
void rdfs(int idx, int cnt) {
if (comp[idx] != -1) return;
comp[idx] = cnt;
for (auto &to : rg.g[idx]) rdfs(to, cnt);
}
};
#line 6 "test/verify/yosupo-scc.test.cpp"
int main() {
int N, M;
cin >> N >> M;
StronglyConnectedComponents<> g(N);
g.read(M, 0, false, true);
g.build();
cout << g.group.size() << "\n";
for(auto &p : g.group) {
cout << p.size() << " " << p << "\n";
}
}
Env | Name | Status | Elapsed | Memory |
---|---|---|---|---|
g++ | example_00 | AC | 6 ms | 3 MB |
g++ | large_cycle_00 | AC | 222 ms | 64 MB |
g++ | max_random_00 | AC | 368 ms | 111 MB |
g++ | max_random_01 | AC | 374 ms | 111 MB |
g++ | max_random_02 | AC | 369 ms | 111 MB |
g++ | max_random_03 | AC | 380 ms | 112 MB |
g++ | max_random_04 | AC | 365 ms | 112 MB |
g++ | random_00 | AC | 305 ms | 89 MB |
g++ | random_01 | AC | 307 ms | 100 MB |
g++ | random_02 | AC | 103 ms | 28 MB |
g++ | random_03 | AC | 101 ms | 64 MB |
g++ | random_04 | AC | 100 ms | 50 MB |
clang++ | example_00 | AC | 6 ms | 3 MB |
clang++ | large_cycle_00 | AC | 238 ms | 81 MB |
clang++ | max_random_00 | AC | 363 ms | 112 MB |
clang++ | max_random_01 | AC | 362 ms | 111 MB |
clang++ | max_random_02 | AC | 370 ms | 111 MB |
clang++ | max_random_03 | AC | 365 ms | 112 MB |
clang++ | max_random_04 | AC | 367 ms | 112 MB |
clang++ | random_00 | AC | 315 ms | 89 MB |
clang++ | random_01 | AC | 314 ms | 100 MB |
clang++ | random_02 | AC | 108 ms | 29 MB |
clang++ | random_03 | AC | 98 ms | 64 MB |
clang++ | random_04 | AC | 101 ms | 50 MB |