Misc/input_utils.h

• View this file on GitHub
• Last update: 2023-01-16 20:41:27+07:00

Code

/// GRAPHS, 1-based index
// undirected graph, N M u1 v1 u2 v2 ... {{{
int n, m; cin >> n >> m;
vector<vector<int>> g(n);
for (int i = 0; i < m; ++i) {
    int u, v; cin >> u >> v;
    --u; --v;
    g[u].push_back(v);
    g[v].push_back(u);
}
// }}}
// directed graph, N M u1 v1 u2 v2 ... {{{
int n, m; cin >> n >> m;
vector<vector<int>> g(n);
for (int i = 0; i < m; ++i) {
    int u, v; cin >> u >> v;
    --u; --v;
    g[u].push_back(v);
}
// }}}
// tree N u1 v1 u2 v2 ... {{{
int n; cin >> n;
vector<vector<int>> g(n);
for (int i = 1; i < n; ++i) {
    int u, v; cin >> u >> v;
    --u; --v;
    g[u].push_back(v);
    g[v].push_back(u);
}
// }}}

#line 1 "Misc/input_utils.h"
/// GRAPHS, 1-based index
// undirected graph, N M u1 v1 u2 v2 ... {{{
int n, m; cin >> n >> m;
vector<vector<int>> g(n);
for (int i = 0; i < m; ++i) {
    int u, v; cin >> u >> v;
    --u; --v;
    g[u].push_back(v);
    g[v].push_back(u);
}
// }}}
// directed graph, N M u1 v1 u2 v2 ... {{{
int n, m; cin >> n >> m;
vector<vector<int>> g(n);
for (int i = 0; i < m; ++i) {
    int u, v; cin >> u >> v;
    --u; --v;
    g[u].push_back(v);
}
// }}}
// tree N u1 v1 u2 v2 ... {{{
int n; cin >> n;
vector<vector<int>> g(n);
for (int i = 1; i < n; ++i) {
    int u, v; cin >> u >> v;
    --u; --v;
    g[u].push_back(v);
    g[v].push_back(u);
}
// }}}

Back to top page