This documentation is automatically generated by online-judge-tools/verification-helper
#define PROBLEM "https://judge.yosupo.jp/problem/aplusb"
#include "../../../src/template/template.hpp"
#include "../../../src/graph/graph_template.hpp"
#include "../../../src/graph/compressed_sparse_row.hpp"
int main() {
Graph<int> undirected(4);
undirected.add_edge(0, 1);
undirected.add_edge(0, 2);
undirected.add_edge(2, 3);
CompressedSparseRow<int> csr1(undirected);
assert(csr1.start == vector<int>({0, 2, 3, 5, 6}));
assert(csr1.elist == vector<int>({1, 2, 0, 0, 3, 2}));
Graph<int> directed(4);
directed.add_directed_edge(0, 1);
directed.add_directed_edge(0, 2);
directed.add_directed_edge(2, 3);
CompressedSparseRow<int> csr2(directed);
assert(csr2.start == vector<int>({0, 2, 2, 3, 3}));
assert(csr2.elist == vector<int>({1, 2, 3}));
int a, b;
cin >> a >> b;
cout << a + b << '\n';
}#line 1 "verify/unit_test/graph/compressed_sparse_row.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/aplusb"
#line 2 "src/template/template.hpp"
#include <bits/stdc++.h>
#line 4 "src/template/template.hpp"
using namespace std;
using ll = long long;
using P = pair<long long, long long>;
#define rep(i, a, b) for(long long i = (a); i < (b); ++i)
#define rrep(i, a, b) for(long long i = (a); i >= (b); --i)
constexpr long long inf = 4e18;
struct SetupIO {
SetupIO() {
ios::sync_with_stdio(0);
cin.tie(0);
cout << fixed << setprecision(30);
}
} setup_io;
#line 3 "src/graph/graph_template.hpp"
template <typename T>
struct Edge {
int from, to;
T cost;
int idx;
Edge()
: from(-1), to(-1), cost(-1), idx(-1) {}
Edge(const int from, const int to, const T& cost = 1, const int idx = -1)
: from(from), to(to), cost(cost), idx(idx) {}
operator int() const {
return to;
}
};
template <typename T>
struct Graph {
Graph(const int N)
: n(N), es(0), g(N) {}
int size() const {
return n;
}
int edge_size() const {
return es;
}
void add_edge(const int from, const int to, const T& cost = 1) {
assert(0 <= from and from < n);
assert(0 <= to and to < n);
g[from].emplace_back(from, to, cost, es);
g[to].emplace_back(to, from, cost, es++);
}
void add_directed_edge(const int from, const int to, const T& cost = 1) {
assert(0 <= from and from < n);
assert(0 <= to and to < n);
g[from].emplace_back(from, to, cost, es++);
}
inline vector<Edge<T>>& operator[](const int& k) {
assert(0 <= k and k < n);
return g[k];
}
inline const vector<Edge<T>>& operator[](const int& k) const {
assert(0 <= k and k < n);
return g[k];
}
private:
int n, es;
vector<vector<Edge<T>>> g;
};
template <typename T>
using Edges = vector<Edge<T>>;
#line 4 "src/graph/compressed_sparse_row.hpp"
template <typename T>
struct CompressedSparseRow {
vector<int> start, elist;
CompressedSparseRow(const Graph<T>& g)
: start(g.size() + 1) {
const int n = g.size();
for(int i = 0; i < n; ++i) {
start[i + 1] = start[i] + g[i].size();
}
elist.resize(start[n]);
for(int i = 0; i < n; ++i) {
int counter = start[i];
for(const Edge<T>& e : g[i]) {
elist[counter++] = e.to;
}
}
}
};
#line 5 "verify/unit_test/graph/compressed_sparse_row.test.cpp"
int main() {
Graph<int> undirected(4);
undirected.add_edge(0, 1);
undirected.add_edge(0, 2);
undirected.add_edge(2, 3);
CompressedSparseRow<int> csr1(undirected);
assert(csr1.start == vector<int>({0, 2, 3, 5, 6}));
assert(csr1.elist == vector<int>({1, 2, 0, 0, 3, 2}));
Graph<int> directed(4);
directed.add_directed_edge(0, 1);
directed.add_directed_edge(0, 2);
directed.add_directed_edge(2, 3);
CompressedSparseRow<int> csr2(directed);
assert(csr2.start == vector<int>({0, 2, 2, 3, 3}));
assert(csr2.elist == vector<int>({1, 2, 3}));
int a, b;
cin >> a >> b;
cout << a + b << '\n';
}